In the last 15 years, heuristics based on large neighborhood search (LNS) and the variant adaptive large neighborhood search (ALNS) have become some of the most successful paradigms for solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood through the use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence follow a more promising search path. Starting from the general framework of large neighborhood search, we study in depth adaptive large neighborhood search, discussing design ideas and properties of the framework. Application of large neighborhood search methods in routing and scheduling are discussed. We end the chapter by presenting the related framework of very large-scale neighborhood search (VLSN) and discuss parallels to LNS, before drawing some conclusions about algorithms exploiting large neighborhoods.
|Series||Handbook of Metaheuristics|
|Series||International Series in Operations Research and Management Science|
- Business and Management
- Operations Research/Decision Theory
- Operations Research, Management Science
- Math Applications in Computer Science