Authors: Marco Caserta, Stefan Voß, Moshe Sniedovich
The Corridor Method is a solution concept which may be characterized as a method-based metaheuristic. That is, based on a given algorithm which is meant to work well at least on small sized instances of a specific type of optimization problem, it defines one or more neighborhoods which seem to be well suited for the specific problem and the given algorithm. These neighborhoods may be viewed as corridors around given solutions. Experiments show that this type of approach is a successful hybridization between exact and metaheuristic methods. We show successful applications for the block relocation problem arising, e.g., at container terminals.