A DISCRETE-CONVEX PROGRAMMING APPROACH TO THE SIMULTANEOUS OPTIMIZATION OF LAND USE AND TRANSPORTATION

Three design problems are discussed in this article. First, it is shown that the transportation 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 Xoopmans-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. /TRRL/

  • Availability:
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,    
  • Authors:
    • Los, M
  • Publication Date: 1979-3

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00300204
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD, TRIS
  • Created Date: Oct 17 1979 12:00AM