Metaheuristics for Vehicle Routing Problems

Caroline Prodhon (1) , Christian Prins (1)

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

The basic problem of vehicle routing is a classical operations research problem, known to be NP-hard Leung et al., Eur J Op Res 225(2): 199–210, 2013, [64] and called the vehicle routing problem (VRP) or capacitated VRP (CVRP).It consists in determining a least-cost set of routes from a depot for a fleet of capacitated vehicles in order to meet the demands of a set of customers.

Keywords: Local Search; Travel Salesman Problem; Memetic Algorithm; Greedy Randomized Adaptive Search Procedure; Vehicle Rout Problem

Domains: Operations Research [cs.RO]

Caroline Prodhon, Christian Prins. Metaheuristics for Vehicle Routing Problems. Metaheuristics, Springer International Publishing, pp.407-437, 2016, 978-3-319-45403-0. ⟨10.1007/978-3-319-45403-0_15⟩. ⟨hal-02497417⟩