A tabu search algorithm for rerouting trains during rail operations

Corman, Francesco; D’Ariano, Andrea; Pacciarelli, Dario; Pranzo, Marco

doi:10.1016/j.trb.2009.05.004

Cited by 279 publications

(149 citation statements)

References 20 publications

Supporting

Mentioning

148

Contrasting

Unclassified

Order By: Relevance

“…After these early works there has been a ourishing of papers representing the RTD by means of disjunctive formulations and exploiting the associated disjunctive graph. Recent examples can be found in [13], [14], [15], [32]. A comprehensive list of bibliographic references is out of our scope and again we refer to the above mentioned surveys.…”

Section: Introductionmentioning

confidence: 99%

An Exact Decomposition Approach for the Real-Time Train Dispatching Problem

Lamorgese

Mannino

2015

Operations Research

117

View full text Add to dashboard Cite

Trains’ movements on a railway network are regulated by official timetables. Deviations and delays occur quite often in practice, demanding fast rescheduling and rerouting decisions in order to avoid conflicts and minimize overall delay. This is the real-time train dispatching problem. In contrast with the classic “holistic” approach, we show how to decompose the problem into smaller subproblems associated with the line and the stations. This decomposition is the basis for a master-slave solution algorithm, in which the master problem is associated with the line and the slave problem is associated with the stations. The two subproblems are modeled as mixed integer linear programs, with specific sets of variables and constraints. Similarly to the classical Benders’ decomposition approach, slave and master communicate through suitable feasibility cuts in the variables of the master. Extensive tests on real-life instances from single and double-track lines in Italy showed significant improvements over current dispatching performances. A decision support system based on this exact approach has been in operation in Norway since February 2014 and represents one of the first operative applications of mathematical optimization to train dispatching.

show abstract

Section: Introductionmentioning

confidence: 99%

An Exact Decomposition Approach for the Real-Time Train Dispatching Problem

Lamorgese

Mannino

2015

Operations Research

117

View full text Add to dashboard Cite

show abstract

“…To compute a solution to this model the following approach is used, based on the structure in (D' Ariano et al, 2008;Corman et al, 2010). Basically the problem is decomposed by considering the routing variables, (i.e., the assignments of containers to AGV) separately than the scheduling variables (i.e., the orders on the machines, and the related timing).…”

Section: Mathematical Models 31 Optimization Of Discrete Event Dynamicsmentioning

confidence: 99%

“…Those algorithms are metaheuristics (a variable neighborhood search and a tabu search introduced in (Corman et al, 2010;Samà et al, 2015a;2015b)) developed in order to decide the assignment of containers to the machines in the second stage (a routing problem). A truncated branchand-bound algorithm, introduced in (D'Ariano et al, 2007), is applied to solve the scheduling problem.…”

Section: Introductionmentioning

confidence: 99%

Optimal Scheduling and Routing of Free-range AGVs at Large Scale Automated Container Terminals

Corman¹,

Xin²,

Negenborn³

et al. 2016

Period. Polytech. Transp. Eng.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The interpretation of the constraints is as follows: (2) makes sure that no train departs earlier than planned and that source delays at events are taken into account. (3) propagates the delay along waiting and driving activities while (4) propagates the delay along maintained changing activities. For each pair of events competing for the same infrastructure (6) makes sure that exactly one of the two headway constraints is respected and (5) propagates the delay along this headway activity.…”

Section: Integer Programming Formulationmentioning

confidence: 99%

“…A branch-and-bound algorithm for finding a conflict-free train schedule, minimizing the largest delay, is developed in [5,1]. In [4], the authors suggest a tabu search to solve both the train sequencing and train routing problem, where a set of possible routes is given as input. The problem has been modeled using a set packing approach in [11].…”

Section: Introductionmentioning

confidence: 99%

Delay Management Including Capacities of Stations

Dollevoet

Huisman

Kroon

et al. 2015

Transportation Science

View full text Add to dashboard Cite

The question of delay management (DM) is whether trains should wait for delayed feeder trains or should depart on time. Solutions to this problem strongly depend on the capacity constraints of the tracks making sure that no two trains can use the same piece of track at the same time. While these capacity constraints have been included in integer programming formulations for DM, the capacity constraints of the stations (only offering a limited number of platforms) have been neglected so far. This can lead to highly infeasible solutions. In order to overcome this problem we suggest two new formulations for DM both including the stations' capacities. We present numerical results showing that the assignment-based formulation is clearly superior to the packing formulation. We furthermore propose an iterative algorithm in which we improve the platform assignment with respect to the current delays of the trains at each station in each step. We will show that this subproblem asks for coloring the nodes of a graph with a given number of colors while minimizing the weight of the conflicts. We show that the graph to be colored is an interval graph and that the problem can be solved in polynomial time by presenting a totally unimodular IP formulation.

show abstract

A tabu search algorithm for rerouting trains during rail operations

Cited by 279 publications

References 20 publications

An Exact Decomposition Approach for the Real-Time Train Dispatching Problem

An Exact Decomposition Approach for the Real-Time Train Dispatching Problem

Optimal Scheduling and Routing of Free-range AGVs at Large Scale Automated Container Terminals

Delay Management Including Capacities of Stations

Contact Info

Product

Resources

About