A ZERO-ONE INTEGER-PROGRAMMING FORMULATION OF THE PROBLEM OF LAND-USE ASSIGNMENT AND TRANSPORTATION NETWORK DESIGN

A zero-one integer-programming formulation of the simultaneous optimization of the problems of land-use assignment and transportation-network design is presented. The problem is modeled through a set-partitioning approach and incorporates a multiple-criteria objective function, appropriate upper- and lower-bound constraints on area assignments, and construction costs. A simple example and a more complicated urban-design case study are included to demonstrate the viability of this approach in solving the simultaneous-optimization problem. As a secondary benefit, this set-partitioning model can be reformulated as an integer, generalized-network, flow problem for which new efficient computer codes, capable of solving networks with thousands of nodes and variables, are available.(a)

  • Availability:
  • Corporate Authors:

    Pion Limited

    207 Brondesburg Park
    London NW2 5JN,   England 
  • Authors:
    • MacGregor, D S
    • Liebman, J S
  • Publication Date: 1978-6

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00188405
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Files: ITRD, TRIS
  • Created Date: Apr 12 1981 12:00AM