6533b853fe1ef96bd12ad5f8

RESEARCH PRODUCT

An ILS-Based Metaheuristic for the Stacker Crane Problem

Thais ÁVilaÁNgel CorberánIsaac PlanaJosé M. Sanchis

subject

Mathematical optimizationIterated local searchComputer scienceStackerComputerApplications_COMPUTERSINOTHERSYSTEMSMetaheuristicsUpper and lower boundsParallel metaheuristicDirected rural postman problemCombinatorial OptimizationCombinatorial optimizationLarge set (combinatorics)MATEMATICA APLICADAMetaheuristicArc routingAlgorithm

description

[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.

yearjournalcountryeditionlanguage
2012-01-01
10.1007/978-3-642-29124-1_3https://doi.org/10.1007/978-3-642-29124-1_3