An ILS-Based metaheuristic for the stacker crane problem

Authors:
Thais Ávila;Ángel Corberán;Isaac Plana;José M. Sanchis
Affiliations:
Dept. de Estadística e Investigación Operativa, Universitat de València, Spain;Dept. de Estadística e Investigación Operativa, Universitat de València, Spain;Dept. Matemáticas para la Economía y la Empresa, Universitat de València, Spain;Dept. de Matemática Aplicada, Universidad Politécnica de Valencia, Spain
Venue:
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2012

Citing 6
Cited 0

Modeling and solving several classes of arc routing problems as traveling salesman problems

Computers and Operations Research
Variable neighborhood search

Computers and Operations Research
z-Approximations

Journal of Algorithms
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Improvement Procedures for the Undirected Rural Postman Problem

INFORMS Journal on Computing
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.