An ILS-Based Metaheuristic for the Stacker Crane Problem

[EN] 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.The authors wish to thank the Ministerio de Innovación y Ciencia of Spain (project MTM2010-19576-C02-02) and the Generalitat Valenciana (grant VALi+d for young researchers) for their support.Ávila, T.; Corberán, A.; Plana, I.; Sanchís Llopis, JM. (2012). An ILS-Based Metaheuristic for the Stacker Crane Problem. Lecture Notes in Computer Science. 7245:25-36. https://doi.org/10.1007/978-3-642-29124-1_3S2536724