FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION

The optimal transportation network design problem is formulated as a convex nonlinear programming problem and a solution method based on standard traffic assignment algorithms is presented. The technique can deal with network improvements which introduce new links, which increase the capacity of existing links, or which decrease the free-flow (uncongested) travel time on existing links (with or without simultaneously increasing link capacity). Preliminary computational experience with the method demonstrates that it is capable of solving very large problems with reasonable amounts of computer time. /Author/TRRL/

  • Availability:
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,    
  • Authors:
    • Dantzig, G B
    • Harvey, R P
    • Lansdowne, Z F
    • Robinson, D W
    • Maier, S F
  • Publication Date: 1979-3

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00300118
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD, TRIS
  • Created Date: Nov 7 1979 12:00AM