In the classical Vehicle Routing Problem (VRP) a fleet of capacitated vehicles is available to serve a set of customers with known demand. Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this chapter we present a survey of the state-of-the-art on the SDVRP. © Springer Science+Business Media, LLC 2008.
CITATION STYLE
Archetti, C., & Speranza, M. G. (2008). The split delivery vehicle routing problem: A survey. Operations Research/ Computer Science Interfaces Series, 43, 103–122. https://doi.org/10.1007/978-0-387-77778-8_5
Mendeley helps you to discover research relevant for your work.