arrow
Return

An efficient evolutionary algorithm for high-speed train rescheduling under a partial station blockage

delete2023-09-01
delete3
delete
OA
AI
R
Rongsheng Wang
Q
Qi Zhang *
X
Xuewu Dai
Z
Zhiming Yuan
T
Tao Zhang
S
Shuxin Ding
Y
Yaochu Jin
DOI:10.1016/j.asoc.2023.110590delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
This paper investigates the high-speed train rescheduling (HSTR) problem under a partial station blockage and proposes an efficient problem-specific strengthen elitist genetic algorithm (PS-SEGA) for HSTR. Firstly, a HSTR model subject to train operation constraints is established to minimize the total train delay. A permutation-based encoding method is developed to define an efficient search space based on the train departure sequence. A heuristic decoding method is employed to eliminate all train operation constraints and output the rescheduled timetable. Moreover, a hybrid initialization method involving an efficient heuristic strategy (EHS) is put forward to accelerate the convergence speed of PS-SEGA. Using problem-specific knowledge, EHS generates an efficient and feasible solution for the initial population. Finally, a restart strategy is presented to maintain genetic diversity. Compared with other advanced evolutionary algorithms and their improved variants also using the improvements of PS-SEGA, experimental results demonstrate the effectiveness of the proposed PS -SEGA for addressing HSTR scenarios under the partial station blockage. As for the scenarios that CPLEX cannot obtain optimal solutions within 10 min, PS-SEGA can provide quasi-optimal solutions in real time. Furthermore, compared with the other two heuristics algorithms (i.e., First-Scheduled-First-Served and EHS), PS-SEGA can give the train departure sequence with a smaller total train delay.& COPY; 2023 Elsevier B.V. All rights reserved.
Keywords:
High-speed railways
Train rescheduling
Evolutionary algorithm
Genetic algorithm
Permutation-based optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

N
northeastern university - china
Scholars:
3.2W
Papers: 2.7W
Citations: 37
U
University of Surrey
Scholars:
1.2W
Papers: 1.3W
Citations: 22
Cited Papers

Cited Papers

Elastic train scheduling model
err2021-10-01
err3
PREAI
errJafarian-Moghaddam, Ahmad Reza
errShare
errSave
A multi-objective optimization-simulation approach for real time rescheduling in dense railway systems
err2020-10-01
err37
errOAAI
errAltazin, Estelle; Dauzere-Peres, Stephane; Ramond, Francois; Trefond, Sabine
errShare
errSave
A Branch-and-Price algorithm for railway rolling stock rescheduling
err2017-05-01
err49
errOAAI
errLusby, Richard M.; Haahr, Jorgen Thorlund; Larsen, Jesper; Pisinger, David
errShare
errSave
Adaptive Coordination Ant Colony Optimization for Multipoint Dynamic Aggregation
err2022-08-01
err29
PREAI
errGao, Guanqiang; Mei, Yi; Jia, Ya-Hui; Browne, Will N.; Xin, Bin
errShare
errSave
errShare
errSave
Brain magnetic resonance imaging features in multiple sclerosis and neuromyelitis optica spectrum disorders patients with or without aquaporin-4 antibody in a Latin American population
err2020-07-01
err0
PREAI
errFacundo Silveira; Agustín Pappolla; Francisco Sánchez; Vanessa Daccach Marques; Ibis Soto de Castillo; Verónica Tkachuk; Alejandro Caride; Maria C. Castillo; Edgardo Cristiano; Camila de Aquino Cruz; Gabriel Braga Diégues Serva; Antonio Carlos dos Santos; Carolina Lavigne Moreira; Pablo A. López; Liliana Patrucco; Omaira Molina; Juan Pablo Pettinicchi; Edgar Carnero Contentti; Juan Ignacio Rojas
errShare
errSave
researcher View more