In this paper we face the train loading problem (TLP) at seaport terminals by proposing a general purpose Lagrangian heuristic. The TLP consists of assigning import containers to the trains departing from the terminal, maximizing the utilization of trains, minimizing the distance travelled by containers from their locations in the storage area to the wagons, as well as the number of needed unproductive movements of containers (re-handles). We define a 0-1 LP formulation consisting of a network flow model complicated by additional constraints. We design a Lagrangian heuristic, which exploits a mixed integer programming (MIP) heuristic to find a first feasible solution in an acceptable time and then to improve it. We show the effectiveness of this approach by comparing the obtained results with the ones provided by a state-of-the-art MIP solver.

A general purpose Lagrangian heuristic applied to the train loading problem

ANGHINOLFI, DAVIDE;PAOLUCCI, MASSIMO
2014

Abstract

In this paper we face the train loading problem (TLP) at seaport terminals by proposing a general purpose Lagrangian heuristic. The TLP consists of assigning import containers to the trains departing from the terminal, maximizing the utilization of trains, minimizing the distance travelled by containers from their locations in the storage area to the wagons, as well as the number of needed unproductive movements of containers (re-handles). We define a 0-1 LP formulation consisting of a network flow model complicated by additional constraints. We design a Lagrangian heuristic, which exploits a mixed integer programming (MIP) heuristic to find a first feasible solution in an acceptable time and then to improve it. We show the effectiveness of this approach by comparing the obtained results with the ones provided by a state-of-the-art MIP solver.
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/628567
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 7
social impact