Abstract
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 language | English |
|---|---|
| Pages (from-to) | 149-160 |
| Number of pages | 12 |
| Journal | European Journal of Operational Research |
| Volume | 215 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 16 Nov 2011 |
Funding
This work was partly supported by the MUR (Italy) under project FIT, and by the Natural Sciences and Engineering Council of Canada under grants 227837-09 and 39682-10 . This support is gratefully acknowledged. The authors thank the BLG Italia managers Francesco De Bonis and Francesco Scalise for their kind availability in explaining the application, and Alessandra De Luca for her help in defining the instance set. Special thanks are due to Manlio Gaudioso who initiated the cooperation framework that made this research possible, and to the referees for their valuable comments.
Keywords
- 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