Optimizing yard assignment in an automotive transshipment terminal

Jean François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino

Research output: Contribution to journalArticlepeer-review

34 Citations (SciVal)


This paper studies a yard management problem in an automotive transshipment terminal. Groups of cars arrive to and depart from the terminal in a given planning period. These groups must be assigned to parking rows under some constraints resulting from managerial rules. The main objective is the minimization of the total handling time. Model extensions to handle application specific issues such as a rolling horizon and a manpower leveling objective are also discussed. The main features of the problem are modeled as an integer linear program. However, solving this formulation by a state-of-the-art solver is impractical. In view of this, we develop a metaheuristic algorithm based on the adaptive large neighborhood search framework. Computational results on real-life data show the efficacy of the proposed metaheuristic algorithm.

Original languageEnglish
Pages (from-to)149-160
Number of pages12
JournalEuropean Journal of Operational Research
Issue number1
Publication statusPublished - 16 Nov 2011


  • Adaptive large neighborhood search
  • Automotive transshipment terminal
  • Logistics
  • Yard management

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Optimizing yard assignment in an automotive transshipment terminal'. Together they form a unique fingerprint.

Cite this