Next Article in Journal
BELMKN: Bayesian Extreme Learning Machines Kohonen Network
Next Article in Special Issue
Optimal Control Algorithms and Their Analysis for Short-Term Scheduling in Manufacturing Systems
Previous Article in Journal / Special Issue
Dual Market Facility Network Design under Bounded Rationality
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(4), 55; https://doi.org/10.3390/a11040055

A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time

Department of Computer Science and Engineering, Blekinge Institute of Technology, Valhallavägen 1, 371 79 Karlskrona, Sweden
*
Author to whom correspondence should be addressed.
Received: 28 February 2018 / Revised: 11 April 2018 / Accepted: 12 April 2018 / Published: 21 April 2018
(This article belongs to the Special Issue Algorithms for Scheduling Problems)
View Full-Text   |   Download PDF [1428 KB, uploaded 3 May 2018]   |  

Abstract

Effectiveness in managing disturbances and disruptions in railway traffic networks, when they inevitably do occur, is a significant challenge, both from a practical and theoretical perspective. In this paper, we propose a heuristic approach for solving the real-time train traffic re-scheduling problem. This problem is here interpreted as a blocking job-shop scheduling problem, and a hybrid of the mixed graph and alternative graph is used for modelling the infrastructure and traffic dynamics on a mesoscopic level. A heuristic algorithm is developed and applied to resolve the conflicts by re-timing, re-ordering, and locally re-routing the trains. A part of the Southern Swedish railway network from Karlskrona centre to Malmö city is considered for an experimental performance assessment of the approach. The network consists of 290 block sections, and for a one-hour time horizon with around 80 active trains, the algorithm generates a solution in less than ten seconds. A benchmark with the corresponding mixed-integer program formulation, solved by commercial state-of-the-art solver Gurobi, is also conducted to assess the optimality of the generated solutions. View Full-Text
Keywords: railway traffic; disturbance management; real-time re-scheduling; job-shop scheduling; optimization; alternative graph railway traffic; disturbance management; real-time re-scheduling; job-shop scheduling; optimization; alternative graph
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Gholami, O.; Törnquist Krasemann, J. A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time. Algorithms 2018, 11, 55.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top