Paper Info
Title
Freight transportation in railway networks with automated terminals: A mathematical model and MIP heuristic approaches.
Abstract
In this paper we propose a planning procedure for serving freight transportation requests in a railway network with fast transfer equipment at terminals. We consider a transportation system where different customers make their requests (orders) for moving boxes, i.e., either containers or swap bodies, between different origins and destinations, with specific requirements on delivery times. The decisions to be taken concern the route (and the corresponding sequence of trains) that each box follows in the network and the assignment of boxes to train wagons, taking into account that boxes can change more than one train and that train timetables are fixed. The planning procedure includes a pre-analysis step to determine all the possible sequences of trains for serving each order, followed by the solution of a 0-1 linear programming problem to find the optimal assignment of each box to a train sequence and to a specific wagon for each train in the sequence. This latter is a generalized assignment problem which is NP-hard. Hence, in order to find good solutions in acceptable computation times, two MIP heuristic approaches are proposed and tested through an experimental analysis considering realistic problem instances. (C) 2011 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2011
10.1016/j.ejor.2011.05.013
European Journal of Operational Research
Keywords
Field
DocType
Freight transportation,Optimal planning,Mathematical programming,MIP heuristics
Heuristic,Mathematical optimization,Generalized assignment problem,Optimal planning,Linear programming,Swap (finance),Train,Operations management,Mathematics,Computation
Journal
Volume
Issue
ISSN
214
3
0377-2217
Citations 
PageRank 
References 
3
0.41
10
Authors
4
Name
Order
Citations
PageRank
Davide Anghinolfi114111.81
Massimo Paolucci24573423.28
Simona Sacone312932.17
Silvia Siri48821.27