Global optimum of the linearized network design problem with equilibrium flows
David Z.W. Wang and
Hong K. Lo
Transportation Research Part B: Methodological, 2010, vol. 44, issue 4, 482-492
Abstract:
The road network design problem, typically formulated as a bi-level program or a mathematical program with equilibrium constraints, is generally non-convex. The non-convexity stems from both the traffic assignment equilibrium conditions and the non-linear travel time function. In this study, we formulate the network design problem as a single-level optimization problem with equilibrium constraints, and then we transform the equilibrium constraints into a set of mixed-integer constraints and linearize the travel time function. The final result is that we cast the network design problem with equilibrium flows into a mixed-integer linear program, whose solution possesses the desirable property of global optimality, subject to the resolution of the linearization scheme adopted.
Keywords: Transportation; network; design; problem (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (60)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0191-2615(09)00120-9
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:44:y:2010:i:4:p:482-492
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Transportation Research Part B: Methodological is currently edited by Fred Mannering
More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().