A NETWORK DESIGN ALGORITHM USING A STOCHASTIC INCREMENTAL TRAFFIC ASSIGNMENT APPROACH

被引:91
作者
CHEN, MY
ALFA, AS
机构
[1] Univ of Manitoba, Winnipeg, Manit
关键词
D O I
10.1287/trsc.25.3.215
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are presented to illustrate the algorithm for solving the NDP.
引用
收藏
页码:215 / 224
页数:10
相关论文
共 21 条
[1]   CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS [J].
ABDULAAL, M ;
LEBLANC, LJ .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :19-32
[2]   THE MEDIAN SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE APPROACH TO ANALYZE COST VS ACCESSIBILITY IN THE DESIGN OF TRANSPORTATION NETWORKS [J].
CURRENT, JR ;
REVELLE, CS ;
COHON, JL .
TRANSPORTATION SCIENCE, 1987, 21 (03) :188-197
[3]   THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION [J].
CURRENT, JR ;
VELLE, CSR ;
COHON, JL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) :189-199
[4]   FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION [J].
DANTZIG, GB ;
HARVEY, RP ;
LANSDOWNE, ZF ;
ROBINSON, DW ;
MAIER, SF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :5-17
[5]   PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION [J].
DIAL, RB .
TRANSPORTATION RESEARCH, 1971, 5 (02) :83-&
[6]   INCREMENTAL METHODS FOR TRAFFIC ASSIGNMENT [J].
FERLAND, JA ;
FLORIAN, M ;
ACHIM, C .
TRANSPORTATION RESEARCH, 1975, 9 (04) :237-239
[8]  
Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810
[9]  
HOANG HH, 1982, IEEE T AUTOMATIC CON, V27, P164
[10]  
Leblanc L. J., 1975, Transportation Science, V9, P183, DOI 10.1287/trsc.9.3.183