Abstract In this work we introduce the vehicle routing problem with multiple pauses, where the fleet is heterogeneous in terms of capacity and drivers availability. Each shift has a time interval when the driver is available and a set of breaks that needs to be scheduled in the route during this shift. The objective is to minimize the number of vehicles and the travel distance. To tackle large instances, we develop a three-phase local search algorithm taking multiple breaks into account by introducing an ejection pool and randomized variable neighborhood descent as local improvement procedure. For effective break scheduling, we develop a special dynamic programming routine. Computational experiments are done on the data set provided by a delivery company situated in Novosibirsk, Russia. The instances contain 1000 customers and 30 vehicles. Experiments show effectiveness of our algorithm. It substantially reduces the fleet and travel distance.
Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses
2017-01-01
7 pages
Article/Chapter (Book)
Electronic Resource
English
Time Window , Travel Distance , Vehicle Route Problem , Vehicle Rout Problem With Time Window , Variable Neighborhood Descent Business and Management , Operations Research/Decision Theory , Operations Research, Management Science , Operations Management , Game Theory, Economics, Social and Behav. Sciences , Engineering Economics, Organization, Logistics, Marketing
Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses
British Library Conference Proceedings | 2015
|Vehicle Routing Problem for Emissions Minimization
Transportation Research Record | 2010
|Vehicle Routing Problem for Emissions Minimization
Online Contents | 2010
|A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips
British Library Online Contents | 2007
|