A system-optimum relaxation based approach to discrete network design problems

Shuaian Wang, Qiang Meng, Hai Yang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

We address the discrete network design problem (DNDP) which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose a global optimization method that is based on the system-optimum relaxation of the UE model. Numerical examples are given.
Original languageEnglish
Title of host publicationProceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012
Subtitle of host publicationTransportation and Logistics Management
Pages615-622
Number of pages8
Publication statusPublished - 1 Dec 2012
Externally publishedYes
Event17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012 - Kowloon, Hong Kong
Duration: 15 Dec 201217 Dec 2012

Conference

Conference17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012
CountryHong Kong
CityKowloon
Period15/12/1217/12/12

Keywords

  • Bi-level programming
  • Discrete network design problem
  • Mixed-integer nonlinear programming
  • Network optimization
  • Traffic equilibrium

ASJC Scopus subject areas

  • Transportation

Cite this