Journal ArticleDOI
A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
Reads0
Chats0
TLDR
A number of algorithmic improvements implemented in the AGLIBRARY optimization solver are presented in order to improve the possibility of finding good quality solutions quickly and often outperform a state-of-the-art tabu search algorithm and a commercial solver in terms of reduced computation times and/or train delays.About:
This article is published in Computers & Operations Research.The article was published on 2017-02-01. It has received 114 citations till now. The article focuses on the topics: Tabu search & Solver.read more
Citations
More filters
Journal ArticleDOI
Towards the Internet of Smart Trains: A Review on Industrial IoT-Connected Railways
TL;DR: The aim of this article is to provide a detailed examination of the state-of-the-art of different technologies and services that will revolutionize the railway industry and will allow for confronting today challenges.
Journal ArticleDOI
Collaborative optimization for metro train scheduling and train connections combined with passenger flow control strategy
TL;DR: Under the proposed collaborative optimization approach, the number of train service connections and the crowding inside stations and carriages with the proper passenger flow control strategy can be evidently balanced, and thereby the operation efficiency and safety of the metro lines are effectively improved.
Journal ArticleDOI
Integrated stochastic optimization approaches for tactical scheduling of trains and railway infrastructure maintenance
TL;DR: The experiments show that forcing the routing stability reduces the routing flexibility and the ability to optimize the two performance indicators when dealing with stochastic disturbances.
Journal ArticleDOI
A rolling horizon approach to the high speed train rescheduling problem in case of a partial segment blockage
TL;DR: In this paper, train services on a double-track high speed railway are rescheduled in a disrupted situation, where one track of a segment is temporarily unavailable, and the uncertain duration of the disruption is handled.
Journal ArticleDOI
Timetable coordination in a rail transit network with time-dependent passenger demand
TL;DR: The computational results illustrate that the proposed approaches reduce the level of crowdedness of metro stations by around 8% in comparison with the current practical timetable of the investigated Beijing urban rail network.
References
More filters
Journal ArticleDOI
A Survey of Optimization Models for Train Routing and Scheduling
TL;DR: A survey of recent optimization models for the most commonly studied rail transportation problems is presented and a classification of models is proposed and their important characteristics are described by focusing on model structure and algorithmic aspects.
Journal ArticleDOI
A branch and bound algorithm for scheduling trains in a railway network
TL;DR: A branch and bound algorithm which includes implication rules enabling to speed up the computation of a train scheduling problem faced by railway infrastructure managers during real-time traffic control is developed.
Journal ArticleDOI
An overview of recovery models and algorithms for real-time railway rescheduling
Valentina Cacchiani,Dennis Huisman,Martin Philip Kidd,Leo Kroon,Paolo Toth,Lucas P. Veelenturf,Joris Wagenaar +6 more
TL;DR: In this article, an overview of recovery models and algorithms for real-time railway disturbance and disruption management is presented, which are tested mainly in an experimental setting, thereby showing promising results.
Journal ArticleDOI
Variable neighbourhood search: methods and applications
TL;DR: Variable neighbourhood search is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley.
Journal ArticleDOI
Job-shop scheduling with blocking and no-wait constraints
TL;DR: It is shown that several key properties, used to design heuristic procedures, do not hold in the blocking and no-wait cases, while some of the most effective ideas used to develop branch and bound algorithms can be easily extended.