IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v13y1979i1p33-48.html
   My bibliography  Save this article

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

Author

Listed:
  • Los, Marc

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.

Suggested Citation

  • Los, Marc, 1979. "A discrete-convex programming approach to the simultaneous optimization of land use and transportation," Transportation Research Part B: Methodological, Elsevier, vol. 13(1), pages 33-48, March.
  • Handle: RePEc:eee:transb:v:13:y:1979:i:1:p:33-48
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(79)90005-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. W. Szeto & Y. Jiang & D. Wang & A. Sumalee, 2015. "A Sustainable Road Network Design Problem with Land Use Transportation Interaction over Time," Networks and Spatial Economics, Springer, vol. 15(3), pages 791-822, September.
    2. Sagarika Patowary & Banasri Sarma & Arup Kumar Sarma, 2019. "A Revision of OPTEMP-LS Model for Selecting Optimal EMP Combination for Minimizing Sediment and Water Yield from Hilly Urban Watersheds," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 33(4), pages 1249-1264, March.
    3. Michael B Lowry & Richard J Balling, 2009. "An Approach to Land-Use and Transportation Planning That Facilitates City and Region Cooperation," Environment and Planning B, , vol. 36(3), pages 487-504, June.
    4. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2010. "A meta-heuristic approach for solving the Urban Network Design Problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 144-157, February.
    5. P Gordon & J E Moore II, 1989. "Endogenizing the Rise and Fall of Urban Subcenters via Discrete Programming Models," Environment and Planning A, , vol. 21(9), pages 1195-1203, September.
    6. Mouhamadou A. M. T. Baldé & Serigne Gueye & Babacar M. Ndiaye, 2021. "A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem," Operational Research, Springer, vol. 21(3), pages 1663-1690, September.
    7. L D Hopkins, 1979. "Quadratic versus Linear Models for Land-Use Plan Design," Environment and Planning A, , vol. 11(3), pages 291-298, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:13:y:1979:i:1:p:33-48. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.