Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this chapter we consider techniques for examining very large neighborhoods, in particular, ways for exactly searching them. We first illustrate such techniques using three paradigmatic examples. In the largest part of the chapter, we focus on the development and experimental study of ver...

The large neighborhood search (LNS) framework introduced by Shaw [11] provides a powerful hybridization of Local Search (LS) and Constraint Programming (CP). The idea of LNS is to combine the expressiveness of CP and the efciency of Local Search (LS) without requiring any meta-heuristic. LNS consists in improving a best-so-far solution by iteratively relaxing it and optimizing this solution usi...

Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering. A critical issue in the design of a neighborhood search algorith...

This work considers the problem of planning how a fleet shared electric vehicles is charged and used for serving set reservations. While exact approaches can be to efficiently solve small medium-sized instances this problem, heuristic have been demonstrated superior in larger instances. The present proposes large neighborhood search approach solving which employs mixed integer linear programmin...

This paper considers the VRP Problem with Soft Time-Windows (VRPSTW), a challenging routing problem due to its combination of hard time windows and a lexicographic objective function minimizing the number of vehicles, the violations of the soft time windows, and the total travel distance. The paper presents a multi-stage, variable neighborhood search algorithm for the VRPSTW, which uses the sam...

A Fuzzy Adaptive Neighborhood Search for Function Optimization David A. Pelta Armando Blanco Jose-L. Verdegay Depto. de Ciencias de la Computaci6n e Inteiigencia Artificial. Universidad de Granada, Granada, Spain {dpelta,armando ,verdegay}@ugr . es Neighborhood based search algorithms have been applied with success in the optimization field. In this work, a Fuzzy Adaptive Neighborhood Search al...