TY - JOUR
T1 - A bi-objective timetable optimization model incorporating energy allocation and passenger assignment in an energy-regenerative metro system
AU - Yang, S.
AU - Liao, Feixiong
AU - Wu, Jianjun
AU - Timmermans, Harry J.P.
AU - Sun, H.
AU - Gao, Ziyou
PY - 2020/3
Y1 - 2020/3
N2 - Complex passenger demand and electricity transmission processes in metro systems cause difficulties in formulating optimal timetables and train speed profiles, often leading to inefficiency in energy consumption and passenger service. Based on energy-regenerative technologies and smart-card data, this study formulates an optimization model incorporating energy allocation and passenger assignment to balance energy use and passenger travel time. The Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is applied and the core components are redesigned to obtain an efficient Pareto frontier of irregular timetables for maximizing the use of regenerative energy and minimizing total travel time. Particularly, a parallelogram-based method is developed to generate random feasible timetables; crossover and local-search-driven mutation operators are proposed relying on the graphic representations of the domain knowledge. The suggested approach is illustrated using real-world data of a bi-directional metro line in Beijing. The results show that the approach significantly improves regenerative energy use and reduces total travel time compared to the fixed regular timetable.
AB - Complex passenger demand and electricity transmission processes in metro systems cause difficulties in formulating optimal timetables and train speed profiles, often leading to inefficiency in energy consumption and passenger service. Based on energy-regenerative technologies and smart-card data, this study formulates an optimization model incorporating energy allocation and passenger assignment to balance energy use and passenger travel time. The Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is applied and the core components are redesigned to obtain an efficient Pareto frontier of irregular timetables for maximizing the use of regenerative energy and minimizing total travel time. Particularly, a parallelogram-based method is developed to generate random feasible timetables; crossover and local-search-driven mutation operators are proposed relying on the graphic representations of the domain knowledge. The suggested approach is illustrated using real-world data of a bi-directional metro line in Beijing. The results show that the approach significantly improves regenerative energy use and reduces total travel time compared to the fixed regular timetable.
KW - Block operation
KW - Energy allocation
KW - Irregular timetable
KW - Local search
KW - Passenger assignment
UR - http://www.scopus.com/inward/record.url?scp=85077790858&partnerID=8YFLogxK
U2 - 10.1016/j.trb.2020.01.001
DO - 10.1016/j.trb.2020.01.001
M3 - Article
VL - 133
SP - 85
EP - 113
JO - Transportation Research. Part B: Methodological
JF - Transportation Research. Part B: Methodological
SN - 0191-2615
ER -