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.
Cite
CITATION STYLE
APA
Prodhon, C., & Prins, C. (2016). Metaheuristics for vehicle routing problems. In Metaheuristics (pp. 407–437). Springer International Publishing. https://doi.org/10.1007/978-3-319-45403-0_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free