A cooperative strategy for guiding the corridor method

Link:

Autor/in:

Beteiligte Person:

Verlag/Körperschaft:

Springer

Erscheinungsjahr:

2009

Medientyp:

Text

Beschreibung:

In this paper we present a four-step algorithm based on the corridor method, in which a local search technique is coupled with ideas inspired by the GRASP metaheuristic to define a cooperative strategy. On the one hand, a GRASP inspired stochastic technique is used to effectively define a corridor around the incumbent solution. On the other hand, the effective calibration of a corridor around the incumbent solution fosters the efficient exploration of the induced neighborhood and, consequently, increases the quality of the greedy solution construction process. This "corridor definition-greedy construction" iterative process is repeated until a feasible solution is reached, tracing a path from the initial to the final solution. In order to test the effectiveness of the proposed approach, we selected a relevant problem from the domain of container terminal logistics, known as the blocks relocation problem, where one wants to retrieve a set of blocks from a bay in a specified order, while minimizing the overall number of movements and relocations. Computational results on 190 benchmark instances attest the quality of the algorithm, both in terms of objective function value and running time. © 2009 Springer-Verlag Berlin Heidelberg.

Lizenz:

Quellsystem:

Forschungsinformationssystem der UHH

Interne Metadaten

Quelldatensatz: oai:www.edit.fis.uni-hamburg.de:publications/1caf1670-5650-4893-ac97-05e88e4d4bee