Train dispatching
L Lamorgese, C Mannino, D Pacciarelli… - … of optimization in the …, 2018 - Springer
Train rescheduling problems have received significant attention in the operations research
community during the past 20–30 years. These are complex problems with many aspects …
community during the past 20–30 years. These are complex problems with many aspects …
An exact decomposition approach for the real-time train dispatching problem
L Lamorgese, C Mannino - Operations Research, 2015 - pubsonline.informs.org
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 …
delays occur quite often in practice, demanding fast rescheduling and rerouting decisions in …
Optimal train dispatching by Benders'-like reformulation
L Lamorgese, C Mannino… - Transportation …, 2016 - pubsonline.informs.org
Train movements on railway lines are generally controlled by human dispatchers. Because
disruptions often occur, dispatchers make real-time scheduling and routing decisions in an …
disruptions often occur, dispatchers make real-time scheduling and routing decisions in an …
Modeling network transition constraints with hypergraphs
S Harrod - Transportation Science, 2011 - pubsonline.informs.org
Discrete time dynamic graphs are frequently used to model multicommodity flows or activity
paths through constrained resources, but simple graphs fail to capture the interaction effects …
paths through constrained resources, but simple graphs fail to capture the interaction effects …
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming
Trains running through railway lines often accumulate some delay. When this happens,
rescheduling and rerouting decisions must be quickly taken in real time. Despite the fact that …
rescheduling and rerouting decisions must be quickly taken in real time. Despite the fact that …
Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US
A Talebian, B Zou - Transportation Research Part B: Methodological, 2015 - Elsevier
This paper studies strategic level train planning for high performance passenger and freight
train operations on shared-use corridors in the US. We develop a hypergraph-based, two …
train operations on shared-use corridors in the US. We develop a hypergraph-based, two …
Capacity consumption analysis using heuristic solution method for under construction railway routes
In this paper, a compressed timetable is generated to calculate capacity consumption for
under construction railway routes using an optimization approach. Since the detailed …
under construction railway routes using an optimization approach. Since the detailed …
An optimization based decision support system for integrated planning and scheduling on dedicated freight corridors
A Upadhyay, NB Bolia - International Journal of Production …, 2014 - Taylor & Francis
Empty wagon redistribution, train formation, routing and scheduling are complex problems
for large railways, many of which currently have or are planning dedicated freight railway …
for large railways, many of which currently have or are planning dedicated freight railway …
Station dispatching problem for a large terminal: A constraint programming approach
At Howrah Station, the largest railway station in India, planners manually determine the
routing and scheduling of train movements (referred to as train dispatching) at present. This …
routing and scheduling of train movements (referred to as train dispatching) at present. This …
Scheduling of vehicle movement in resource-constrained transportation networks using a capacity-aware heuristic
H Khadilkar - 2017 American Control Conference (ACC), 2017 - ieeexplore.ieee.org
This paper proposes a novel vehicle movement scheduling heuristic for transportation
networks with controlled access and limited infrastructure resources at each node and edge …
networks with controlled access and limited infrastructure resources at each node and edge …