A Lagrangian heuristic for a train-unit assignment problem

Authors:
Valentina Cacchiani;Alberto Caprara;Paolo Toth
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 8
Cited 1

Schedule Optimization at Sncf: From Conception to Day of Departure

Interfaces
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem

Transportation Science
Routing of Railway Carriages

Journal of Global Optimization
Allocation of Railway Rolling Stock for Passenger Trains

Transportation Science
Efficient Circulation of Railway Rolling Stock

Transportation Science
Circulation of railway rolling stock: a branch-and-price approach

Computers and Operations Research
Integrating Robust Railway Network Design and Line Planning under Failures

Robust and Online Large-Scale Optimization
Solving a real-world train-unit assignment problem

Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming

Models and algorithms for the train unit assignment problem

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present a fast heuristic for an important NP-hard problem, arising in the planning of a railway passenger system, that calls for the definition of the train units to be assigned to a given set of timetabled trips, each with a given number of passenger seats requested. The heuristic is based on the Lagrangian relaxation of a natural formulation of the problem, whose solution can be found by solving a sequence of assignment problems. With respect to an already existing method, the heuristic we propose turns out to be much faster in practice and still providing solutions of good quality. This makes it suitable for all cases in which the problem either must be solved many times, e.g., when it is integrated with other phases of railway planning, or when it must be solved within short computing time, e.g., within real-time operations.