Metaheuristics Generating a Sequence of Solutions

Nacima Labadie (1) , Christian Prins (1) , Caroline Prodhon (1)

1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

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).

Domains: Computer Science [cs]; Operations Research [cs.RO]

Nacima Labadie, Christian Prins, Caroline Prodhon. Metaheuristics Generating a Sequence of Solutions. Metaheuristics for Vehicle Routing Problems, John Wiley & Sons, Inc., pp.39-75, 2016, ⟨10.1002/9781119136767.ch3⟩. ⟨hal-03273300⟩