This chapter presents the main metaheuristics working on a sequence of solutions, and their applications on vehicle routing problems (VRP). Eight metaheuristics generating a sequence of solutions include simulated annealing (SA), greedy randomized adaptive search procedure (GRASP), Tabu search (TS), variable neighborhood search (VNS), iterated local search (ILS), guided local search (GLS), large neighborhood search (LNS), and evolutionary local search (ELS). Adaptive large neighborhood search (ALNS) is a relatively efficient framework to solve variants of the vehicle routing problems, especially the so‐called Rich VRP in which various, possibly tight, constraints need to hold. Rather than using one large neighborhood as in LNS, it applies several removal and insertion operators, selected dynamically according to their past performance, to a given solution. The chapter also presents main features of the ALNS algorithm for the pickup and delivery problem with time windows (PDPTW).
Metaheuristics Generating a Sequence of Solutions
2016-03-30
37 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Metaheuristics Based on a Set of Solutions
Wiley | 2016
|Metaheuristics Hybridizing Various Components
Wiley | 2016
|Metaheuristics for Ship Operations
Wiley | 2018
|Parallel Metaheuristics for Workforce Planning
British Library Online Contents | 2007
|CLAM: Clustering Large Applications Using Metaheuristics
British Library Online Contents | 2011
|