Approximation Techniques for Transportation Network Design Problem under Demand Uncertainty

被引:9
作者
Sharma, Sushant [2 ]
Mathew, Tom V. [1 ]
Ukkusuri, Satish V. [3 ]
机构
[1] Indian Inst Technol, Dept Civil Engn, Bombay 400076, Maharashtra, India
[2] Purdue Univ, NEXTRANS, Reg Univ Transportat Ctr, W Lafayette, IN 47907 USA
[3] Purdue Univ, Sch Civil Engn, W Lafayette, IN 47907 USA
关键词
Demand uncertainty; Transportation network design; Sampling techniques; Single-point approximation; Genetic algorithm; VARIANCE;
D O I
10.1061/(ASCE)CP.1943-5487.0000091
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Conventional transportation network design problems treat origin-destination (OD) demand as fixed, which may not be true in reality. Some recent studies model fluctuations in OD demand by considering the first and the second moment of the system travel time, resulting in stochastic and robust network design models, respectively. Both of these models need to solve the traffic equilibrium problem for a large number of demand samples and are therefore computationally intensive. In this paper, three efficient solution-approximation approaches are identified for addressing demand uncertainty by solving for a small sample size, reducing the computational effort without much compromise on the solution quality. The application and the performance of these alternative approaches are reported. The results from this study will help in deciding suitable approximation techniques for network design under demand uncertainty. DOI: 10.1061/(ASCE)CP.1943-5487.0000091. (C) 2011 American Society of Civil Engineers.
引用
收藏
页码:316 / 329
页数:14
相关论文
共 30 条
[1]   CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS [J].
ABDULAAL, M ;
LEBLANC, LJ .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :19-32
[2]   Two-stage robust network row and design under demand uncertahty [J].
Atamtuerk, Alper ;
Zhang, Muhong .
OPERATIONS RESEARCH, 2007, 55 (04) :662-673
[3]  
ATAMTURK A, 2003, BCOL0304 U CA BERK D
[4]   Simulation estimation of mixed discrete choice models using randomized and scrambled Halton sequences [J].
Bhat, CR .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (09) :837-855
[5]  
CHEN A, 2007, TRANSP RES BOARD 86
[6]   Bilevel programming for the continuous transport network design problem [J].
Chiou, SW .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (04) :361-383
[7]   ASYMPTOTIC-BEHAVIOR OF STATISTICAL ESTIMATORS AND OF OPTIMAL-SOLUTIONS OF STOCHASTIC OPTIMIZATION PROBLEMS [J].
DUPACOVA, J ;
WETS, R .
ANNALS OF STATISTICS, 1988, 16 (04) :1517-1549
[8]   Optimal transit route network design problem with variable transit demand: Genetic algorithm approach [J].
Fan, W ;
Machemehl, RB .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 2006, 132 (01) :40-51
[9]   VARIANCE REDUCTION TECHNIQUES IN STOCHASTIC SHORTEST ROUTE ANALYSIS - APPLICATION PROCEDURES AND RESULTS [J].
GRANT, FH ;
SOLBERG, JJ .
MATHEMATICS AND COMPUTERS IN SIMULATION, 1983, 25 (04) :366-375
[10]   The sample average approximation method for stochastic discrete optimization [J].
Kleywegt, AJ ;
Shapiro, A ;
Homem-De-Mello, T .
SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (02) :479-502