Abstract
In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Ávila, T., Corberán, Á., Plana, I., & Sanchis, J. M. (2012). An ILS-based metaheuristic for the stacker crane problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7245 LNCS, pp. 25–36). https://doi.org/10.1007/978-3-642-29124-1_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
