Metaheuristics for Vehicle Routing Problems - Archive ouverte HAL Access content directly
Book Sections Year : 2016

Metaheuristics for Vehicle Routing Problems

(1) , (1)
1

Abstract

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.
Not file

Dates and versions

hal-02497417 , version 1 (03-03-2020)

Identifiers

Cite

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⟩

Collections

CNRS UTT LOSI
24 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More