Abstract Three design problems are discussed in this article. First, it is shown that the network design problem with congestion reduces to an all-or nothing traffic assignment problem under some assumptions on the congestion function and the investment cost function. Second, the land use design problem is formulated as an extension of the Koopmans-Beckmann problem and a heuristic is proposed to solve this problem. Third, it is shown that the seemingly more complex problem of designing jointly a land-use plan and a transportation network reduces to a pure land-use design problem. All that is needed to solve the joint optimization problem is a shortest path algorithm and a heuristic to solve the land use design problem. Computational experience is reported for each algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A discrete-convex programming approach to the simultaneous optimization of land use and transportation


    Beteiligte:
    Los, Marc (Autor:in)

    Erscheinungsdatum :

    1978-05-25


    Format / Umfang :

    16 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Simultaneous Optimization Formulation of a Discrete–Continuous Transportation System

    Wong, S. C. / Du, Y. C. / Ho, H. W. et al. | Transportation Research Record | 2003


    Simultaneous Optimization Formulation of a Discrete-Continuous Transportation System

    Wong, S. C. / Du, Y. C. / Ho, H. W. et al. | British Library Conference Proceedings | 2003