A Freight Service Design Problem for a Railway Corridor

Authors:
Alberto Caprara;Enrico Malaguti;Paolo Toth
Affiliations:
Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 40136 Bologna, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 40136 Bologna, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 40136 Bologna, Italy
Venue:
Transportation Science
Year:
2011

Citing 7
Cited 2

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Approximation Algorithms for Resource Allocation

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-And-Bound

Operations Research
A Survey of Optimization Models for Train Routing and Scheduling

Transportation Science
Optimizing the Cargo Express Service of Swiss Federal Railways

Transportation Science

Partial convexification of general MIPs by Dantzig-Wolfe reformulation

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of designing a set of highly profitable freight routes in a railway corridor, taking into account the level of service requested by different goods; in particular, the profit achieved by transporting a good is a nonlinear function of the associated travel time. We propose an ILP model that is solved heuristically by column generation and fixing techniques. Computational results on a real corridor crossing 11 European countries are reported, showing that we can find solutions that are provably close to optimal. Given the large size of our instances, a key issue of our approach is to avoid finding an optimal solution of the continuous relaxation of our model, stopping as soon as near-optimal primal and dual solutions are available.