Simulation-Based Headway Optimization for the Bangkok Airport Railway System under Uncertainty

被引:2
作者
Sasithong, Pruk [1 ]
Parnianifard, Amir [1 ]
Sinpan, Nitinun [1 ]
Poomrittigul, Suvit [2 ]
Saadi, Muhammad [3 ]
Wuttisittikulkij, Lunchakorn [1 ]
机构
[1] Chulalongkorn Univ, Dept Elect Engn, Wireless Commun Ecosyst Res Unit, Bangkok 10330, Thailand
[2] King Mongkuts Inst Technol Ladkrabang KMITL, Sch Informat Technol, Bangkok 10520, Thailand
[3] Univ Cent Punjab, Dept Elect Engn, Lahore 54590, Pakistan
关键词
simulation-based model; railway system; timetable scheduling; uncertainty; particle swarm optimization; TIMETABLE OPTIMIZATION; ROBUST; MODEL;
D O I
10.3390/electronics12163493
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The ever-increasing demand for intercity travel, as well as competition among all modes of transportation, is an unavoidable reality that today's urban rail transit system must deal with. To meet this problem, urban railway companies must try to make better use of their existing plans and resources. Analytical approaches or simulation modeling can be used to develop or change a rail schedule to reflect the appropriate passenger demand. However, in the case of complex railway networks with several interlocking zones, analytical methods frequently have drawbacks. The goal of this article is to create a new simulation-based optimization model for the Bangkok railway system that takes into account the real assumptions and requirements in the railway system, such as uncertainty. The common particle swarm optimization (PSO) technique is combined with the developed simulation model to optimize the headways for each period in each day. Two different objective functions are incorporated into the models to consider both customer satisfaction by reducing the average waiting time and railway management satisfaction by reducing needed energy usage (e.g., reducing operating trains). The results obtained using a real dataset from the Bangkok railway system demonstrate that the simulation-based optimization approach for robust train service timetable scheduling, which incorporates both passenger waiting times and the number of operating trains as equally important objectives, successfully achieved an average waiting time of 11.02 min (with a standard deviation of 1.65 min) across all time intervals.
引用
收藏
页数:17
相关论文
共 32 条
[1]   Robust optimization - A comprehensive survey [J].
Beyer, Hans-Georg ;
Sendhoff, Bernhard .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2007, 196 (33-34) :3190-3218
[2]   Approaches to a real-world Train Timetabling Problem in a railway node [J].
Cacchiani, Valentina ;
Furini, Fabio ;
Kidd, Martin Philip .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 58 :97-110
[3]   Nominal and robust train timetabling problems [J].
Cacchiani, Valentina ;
Toth, Paolo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (03) :727-737
[4]  
Caimi G, 2017, J RAIL TRANSPORT PLA, V6, P285, DOI 10.1016/j.jrtpm.2016.11.002
[5]  
datagov.mot.go, US
[6]   Hybrid artificial intelligence and robust optimization for a multi-objective product portfolio problem Case study: The dairy products industry [J].
Goli, Alireza ;
Zare, Hasan Khademi ;
Tavakkoli-Moghaddam, Reza ;
Sadeghieh, Ahmad .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 137
[7]  
Hansen IngoArne., 2008, RAILWAY TIMETABLE TRAFFIC, Analysis, Modeling, Simulation, V1
[8]   Train service timetabling in railway open markets by particle swarm optimisation [J].
Ho, T. K. ;
Tsang, C. W. ;
Ip, K. H. ;
Kwan, K. S. .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (01) :861-868
[9]  
Jing Li, 2011, Proceedings of the 2011 International Conference on Transportation and Mechanical & Electrical Engineering (TMEE), P1896, DOI 10.1109/TMEE.2011.6199584
[10]   Robust, Resilient and Reliable Architecture for V2X Communications [J].
Khan, Muhammad Awais ;
Ghosh, Saptarshi ;
Busari, Sherif Adeshina ;
Huq, Kazi Mohammed Saidul ;
Dagiuklas, Tasos ;
Mumtaz, Shahid ;
Iqbal, Muddesar ;
Rodriguez, Jonathan .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 22 (07) :4414-4430