Optimising Public Bus Transit Networks Using Deep Reinforcement Learning

被引:16
作者
Darwish, Ahmed [1 ,2 ]
Khali, Momen [1 ,2 ]
Badawi, Karim [3 ,4 ]
机构
[1] Motion Inc, R&D Dept Idea, Rocky Hill, CT 06067 USA
[2] German Univ Cairo GUC, Comp Sci & Engn Fac, Cairo, Egypt
[3] Trapeze Grp, Neuhausen, Switzerland
[4] Swiss Fed Inst Technol, Swiss Fed Inst Technol Zurich, Dept Informat Technol & Elect Engn, Res Grp, Zurich, Switzerland
来源
2020 IEEE 23RD INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC) | 2020年
关键词
Deep Reinforcement Learning; Attention Models; Transit Network Design; Frequency Setting; DESIGN; OPTIMIZATION;
D O I
10.1109/itsc45102.2020.9294710
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Public Transportation Buses are an integral part of our cities, which relies heavily on optimal planning of routes. The quality of the routes directly influences the quality of service provided to passengers, in terms of coverage, directness, and in-vehicle travel time. In addition, it affects the profitability of the transportation system, since the network structure directly influences the operational costs. We propose a system which automates the planning of bus networks based on given demand. The system implements a paradigm, Deep Reinforcement Learning, which has not been used in past literature before for solving the well-documented multi-objective Transit Network Design and Frequency Setting Problem (TNDFSP). The problem involves finding a set of routes in an urban area, each with its own bus frequency. It is considered an NP-Hard combinatorial problem with a massive search space. Compared to state-of-the-art paradigms, our system produced very competitive results, outperforming state-of-the-art solutions.
引用
收藏
页数:7
相关论文
共 22 条
[1]   Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm [J].
Arbex, Renato Oliveira ;
da Cunha, Claudio Barbieri .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 81 :355-376
[2]  
Baaj M.H., 1991, J Adv Transp, V25, P187, DOI DOI 10.1002/ATR.5670250205
[3]  
Bello I., 2017, P 5 INT C LEARN REPR, P1
[4]  
Bengio Y., 2018, Machine learning for combinatorial optimization: a methodological tour d'horizon
[5]   BUS NETWORK DESIGN [J].
CEDER, A ;
WILSON, NHM .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1986, 20 (04) :331-344
[6]   Optimal route network design for transit systems using genetic algorithms [J].
Chakroborty, P ;
Dwivedi, T .
ENGINEERING OPTIMIZATION, 2002, 34 (01) :83-100
[7]  
Dai HJ, 2017, ADV NEUR IN, V30
[8]  
Dijkstra EW, 1959, NUMER MATH, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[9]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345
[10]   Transit network design and scheduling: A global review [J].
Guihaire, Valerie ;
Hao, Jin-Kao .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2008, 42 (10) :1251-1273