Improved Quantum-Inspired Evolutionary Algorithm for Large-Size Lane Reservation

被引:79
作者
Che, Ada [1 ]
Wu, Peng [1 ,2 ]
Chu, Feng [2 ,3 ]
Zhou, MengChu [4 ,5 ]
机构
[1] Northwestern Polytech Univ, Sch Management, Xian 710072, Peoples R China
[2] Univ Evry Val Essonne, Lab IBISC, F-91020 Evry, France
[3] Hefei Univ Technol, Sch Transportat Engn, Hefei 230009, Peoples R China
[4] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
[5] Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China
来源
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS | 2015年 / 45卷 / 12期
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Integer linear program (ILP); lane reservation; large-size problem; optimization; transportation planning; SOLVE-BASED ALGORITHM; TABU SEARCH; OPTIMIZATION; ASSIGNMENT; CAPACITY; MODEL;
D O I
10.1109/TSMC.2015.2417509
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies a lane reservation problem for large sport events in big cities. Such events require organizers to deliver certain people and materials from athlete villages to geographically dispersed venues within a given travel duration. A lane reservation strategy is usually adopted in this circumstance to ensure that time-critical transportation tasks can be completed despite heavy urban traffic congestion. However, it causes negative impact on normal traffic. The problem aims to optimally select and reserve some lanes in a transportation network for the exclusive use of the tasks such that the total traffic impact is minimized. To solve the problem, we first develop an improved integer linear program. Then, its properties are analyzed and used to reduce the search space for its optimal solutions. Finally, we develop a fast and effective quantum-inspired evolutionary algorithm for large-size problems. Computational results on instances with up to 500 nodes in the network and 50 tasks show that the proposed algorithm is efficient in yielding high-quality solutions within a relatively short time.
引用
收藏
页码:1535 / 1548
页数:14
相关论文
共 45 条
  • [31] A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem
    Yan, Shangyao
    Chen, Chun-Ying
    Lin, Yu-Fang
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2011, 12 (04) : 1362 - 1373
  • [32] A cut-and-solve based algorithm for the single-source capacitated facility location problem
    Yang, Zhen
    Chu, Feng
    Chen, Haoxun
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 221 (03) : 521 - 532
  • [33] A Lagrangian relaxation algorithm for finding the MAP configuration in QMR-DT
    Yu, Feili
    Tu, Fang
    Tu, Haiying
    Pattipati, Krishna R.
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2007, 37 (05): : 746 - 757
  • [34] A new model and hybrid approach for large scale inventory routing problems
    Yu, Yugang
    Chen, Haoxun
    Chu, Feng
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1022 - 1040
  • [35] Large scale stochastic inventory routing problems with split delivery and service level constraints
    Yu, Yugang
    Chu, Chengbin
    Chen, Haoxun
    Chu, Feng
    [J]. ANNALS OF OPERATIONS RESEARCH, 2012, 197 (01) : 135 - 158
  • [36] Zagorianakos E., 2004, J TRANSP GEOGR, V12, P115, DOI [DOI 10.1016/J.JTRANGEO.2003.12.001, https://doi.org/10.1016/j.jtrangeo.2003.12.001]
  • [37] Zhang JL, 2008, LECT NOTES COMPUT SC, V5226, P31, DOI 10.1007/978-3-540-87442-3_5
  • [38] Last-Position Elimination-Based Learning Automata
    Zhang, Junqi
    Wang, Cheng
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (12) : 2484 - 2492
  • [39] ε-Constraint and Fuzzy Logic-Based Optimization of Hazardous Material Transportation via Lane Reservation
    Zhou, Zhen
    Chu, Feng
    Che, Ada
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2013, 14 (02) : 847 - 857
  • [40] Role Transfer Problems and Algorithms
    Zhu, Haibin
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2008, 38 (06): : 1442 - 1450