The corridor method is a general method originally proposed as a way to gain efficiency in dynamic programming search, possibly losing optimality. Later, it has been extended beyond DP to other exact optimization methods. The basic idea is that of using the exact method over successive restricted portions of the solution space of the given problem. The restriction is obtained by applying exogenous constraints, which define local neighborhoods around points of interest. The corridor method is very general, the basic structure of the neighborhoods to explore is determined by the needs and requirements of the optimization method used for searching. The intrinsic reliance on mathematical programming makes this approach a prototypical case of matheuristic. A possible application to the GAP is detailed.
Corridor Method / Maniezzo, Vittorio; Boschetti, Marco Antonio; Stützle, Thomas. - STAMPA. - (2021), pp. 179-187. [10.1007/978-3-030-70277-9_8]
Corridor Method
Maniezzo, Vittorio;Boschetti, Marco Antonio;
2021
Abstract
The corridor method is a general method originally proposed as a way to gain efficiency in dynamic programming search, possibly losing optimality. Later, it has been extended beyond DP to other exact optimization methods. The basic idea is that of using the exact method over successive restricted portions of the solution space of the given problem. The restriction is obtained by applying exogenous constraints, which define local neighborhoods around points of interest. The corridor method is very general, the basic structure of the neighborhoods to explore is determined by the needs and requirements of the optimization method used for searching. The intrinsic reliance on mathematical programming makes this approach a prototypical case of matheuristic. A possible application to the GAP is detailed.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
