Bi-level multi-objective model for existing link capacity expansion problem across urban transportation network considering travel time reliability: presenting dynamic particle swarm algorithm

被引:6
作者
Barahimi, Amir Hossein [1 ]
Eydi, Alireza [1 ]
Aghaie, Abdolah [2 ]
机构
[1] Univ Kurdistan, Dept Engn, Ind Engn, Sanandaj, Iran
[2] KN Toosi Univ Technol, Dept Ind Engn, Tehran, Iran
来源
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES | 2020年 / 45卷 / 01期
关键词
Existing link capacity expansion; bi-level multi-objective model; travel time reliability; correlation of existing links along a path; particle swarm optimization; network uncertainty; SHORTEST-PATH PROBLEM; KTH-BEST APPROACH; SCHEDULE COORDINATION; STOCHASTIC NETWORKS; OPTIMIZATION; DESIGN; CHOICE; BEHAVIOR; PENALTY;
D O I
10.1007/s12046-020-01486-z
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Urban transportation network design and traffic control problems fall within the scope of infrastructural engineering sciences which become increasingly more important in ever-growing societies of today. In highly populated old cities where establishing new links are facing many human-related, social, economic, and political problems, a workaround for addressing traffic problems is to expand the capacity of existing links, so as to not only control the traffic, but also reduce the urban environmental pollutions caused by vehicles stuck in traffic and decrease the time wasted in traffic to accelerate routines of the society. In the present research, an urban transportation network design model is presented with the aim of enhancing travel time reliability by expanding the capacity of existing network links at minimum possible cost. A significant assumption taken in the present study is that demands in normal condition and peak traffic hours are treated separately, so as to prevent possible problems by congestion management. In the present study, the uncertainty associated with demand for travel, travel time, and the flow passing through different links are taken into consideration. Travel time reliability calculations are carried out assuming that the demand for travel and travel time follow lognormal distributions. In order to solve this bi-level model, particle swarm optimization algorithm was used. Incorporation of the inertial coefficients dynamics, personal learning, and communal learning into the algorithm contributes to the convergence of this algorithm for solving the bi-level model.
引用
收藏
页数:21
相关论文
共 89 条
[1]   CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS [J].
ABDULAAL, M ;
LEBLANC, LJ .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :19-32
[2]   An exact penalty on bilevel programs with linear vector optimization lower level [J].
Ankhili, Z. ;
Mansouri, A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (01) :36-41
[3]  
[Anonymous], 1960, IRE Transactions on Communications Systems, DOI [DOI 10.1109/TCOM.1960.1097606, 10.1109/tcom.1960.1097606]
[4]   Disjunctive cuts for continuous linear bilevel programming [J].
Audet, Charles ;
Haddad, Jean ;
Savard, Gilles .
OPTIMIZATION LETTERS, 2007, 1 (03) :259-267
[5]  
Bagherian M, 2016, 9 TRIENN S TRANSP AN
[6]   AN EXPLICIT SOLUTION TO THE MULTILEVEL PROGRAMMING PROBLEM [J].
BARD, JF ;
FALK, JE .
COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (01) :77-100
[7]  
Bard Jonathan F, 2013, PRACTICAL BILEVEL OP, V30
[8]   The valuation of reliability for personal travel [J].
Bates, J ;
Polak, J ;
Jones, P ;
Cook, A .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2001, 37 (2-3) :191-229
[9]   COMPUTATIONAL DIFFICULTIES OF BILEVEL LINEAR-PROGRAMMING [J].
BENAYED, O ;
BLAIR, CE .
OPERATIONS RESEARCH, 1990, 38 (03) :556-560
[10]   ON 2-LEVEL OPTIMIZATION [J].
BIALAS, WF ;
KARWAN, MH .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1982, 27 (01) :211-214