EconPapers    
Economics at your fingertips  
 

Transport Network Design Problem under Uncertainty: A Review and New Developments

Anthony Chen, Zhong Zhou, Piya Chootinan, Seungkyu Ryu, Chao Yang and S. Wong

Transport Reviews, 2011, vol. 31, issue 6, 743-768

Abstract: This paper aims to provide a state-of-the-art review of the transport network design problem (NDP) under uncertainty and to present some new developments on a bi-objective-reliable NDP (BORNDP) model that explicitly optimizes the capacity reliability and travel time reliability under demand uncertainty. Both are useful performance measures that can describe the supply-side reliability and demand-side reliability of a road network. A simulation-based multi-objective genetic algorithm solution procedure, which consists of a traffic assignment algorithm, a genetic algorithm, a Pareto filter, and a Monte-Carlo simulation, is developed to solve the proposed BORNDP model. A numerical example based on the capacity enhancement problem is presented to demonstrate the tradeoff between capacity reliability and travel time reliability in the NDP.

Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://hdl.handle.net/10.1080/01441647.2011.589539 (text/html)
Access to full text is restricted to subscribers.

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:taf:transr:v:31:y:2011:i:6:p:743-768

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TTRV20

DOI: 10.1080/01441647.2011.589539

Access Statistics for this article

Transport Reviews is currently edited by Professor David Banister and Moshe Givoni

More articles in Transport Reviews from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:transr:v:31:y:2011:i:6:p:743-768