Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 215, Issue 1, Pages 149-160Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2011.06.008
Keywords
Logistics; Yard management; Automotive transshipment terminal; Adaptive large neighborhood search
Funding
- MUR (Italy)
- Natural Sciences and Engineering Council of Canada [227837-09, 39682-10]
Ask authors/readers for more resources
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. (C) 2011 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available