A Freight Service Design Problem for a Railway Corridor

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.

[1]  Marcus Poggi de Aragão,et al.  Solving the Freight Car Flow Problem to Optimality , 2002, Electron. Notes Theor. Comput. Sci..

[2]  Teodor Gabriel Crainic,et al.  Planning models for freight transportation , 1997 .

[3]  Alberto Ceselli,et al.  Optimizing the Cargo Express Service of Swiss Federal Railways , 2008, Transp. Sci..

[4]  Marco Campetella,et al.  Freight Service Design for the Italian Railways Company , 2006, ATMOS.

[5]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[6]  Elise Miller-Hooks,et al.  Market Potential for International Rail-Based Intermodal Services in Europe , 2008 .

[7]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[8]  Elise Miller-Hooks,et al.  Application and Validation of Dynamic Freight Simulation–Assignment Model to Large-Scale Intermodal Rail Network , 2008 .

[9]  Paolo Toth,et al.  Chapter 3 Passenger Railway Optimization , 2007, Transportation.

[10]  Elise Miller-Hooks,et al.  Dynamic Network Simulation–Assignment Platform for Multiproduct Intermodal Freight Transportation Analysis , 2007 .

[11]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Teodor Gabriel Crainic,et al.  Service network design in freight transportation , 2000, Eur. J. Oper. Res..

[14]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[15]  M. Christiansen,et al.  Designing new European rail freight services , 2009, J. Oper. Res. Soc..

[16]  Yuval Rabani,et al.  Improved Approximation Algorithms for Resource Allocation , 2002, IPCO.