SOLUTION ALGORITHM FOR THE BI-LEVEL DISCRETE NETWORK DESIGN PROBLEM

The network design problem (NDP) involves the optimal decision on the expansion of a street and highway system in response to a growing demand for travel. The NDP has become a necessary part of effective transport planning in an era when the demand for roadway travel is growing faster than the transport system can accommodate. This article reports on the modification of a transportation system by adding new links, resulting in the discrete network design problem (DNDP). The objective of the DNDP is to make an optimal investment decision in order to minimize the total travel cost in the network, while accounting for the route choice behaviors of the network users. The authors first introduce a traditional bi-level programming model for the DNDP, then propose a new solution algorithm for bi-level network design problems that uses the support function concept to express the relationship between improvement flows and the new additional links in the existing urban network. The authors also present computational results on two specific networks. The authors conclude that the proposed algorithm would be efficient in practice.

  • Availability:
  • Corporate Authors:

    Elsevier

    The Boulevard, Langford Lane
    Kidlington, Oxford  United Kingdom  OX5 1GB
  • Authors:
    • Gao, Ziyou
    • Wu, Jingxian
    • Sun, H Q
  • Publication Date: 2005-7

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00988895
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Apr 4 2005 12:00AM