In this paper we propose a planning procedure for serving freight transportation requests (i.e. orders) in a railway network in which the terminals are provided with innovative transfer systems. We consider a consolidated transportation system where different customers make their own transportation requests for moving boxes (either containers or swap bodies) between different origins and destinations, with specific requirements on delivery times. The decisions to be taken concern the path (and the corresponding sequence of trains) that each box follows over the network and the assignment of boxes to train wagons, taking into account that boxes can change more than one train during their path and that train timetables are fixed. This planning problem is divided in two sequential phases: a preprocessing analysis for which a specific algorithm is provided and an optimization phase for which a mathematical programming formulation is proposed. The effectiveness of the proposed procedure is tested on a set of randomly generated instances.

Order-based freight transportation operation planning in railway networks

ANGHINOLFI, DAVIDE;PAOLUCCI, MASSIMO;SACONE, SIMONA;SIRI, SILVIA
2009-01-01

Abstract

In this paper we propose a planning procedure for serving freight transportation requests (i.e. orders) in a railway network in which the terminals are provided with innovative transfer systems. We consider a consolidated transportation system where different customers make their own transportation requests for moving boxes (either containers or swap bodies) between different origins and destinations, with specific requirements on delivery times. The decisions to be taken concern the path (and the corresponding sequence of trains) that each box follows over the network and the assignment of boxes to train wagons, taking into account that boxes can change more than one train during their path and that train timetables are fixed. This planning problem is divided in two sequential phases: a preprocessing analysis for which a specific algorithm is provided and an optimization phase for which a mathematical programming formulation is proposed. The effectiveness of the proposed procedure is tested on a set of randomly generated instances.
2009
978-989674003-0
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11567/239042
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact