This article is cited in 1 scientific paper (total in 1 paper)
A three-phase heuristic for the vehicle fleet and route optimization
A. V. Khmelev
Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
We consider the applied vehicle routing problem with time windows. Each driver works in a given shift. Each shift has the start, finish and set of pauses which need to be scheduled en route. We introduce the mathematical formulation for this problem in terms of the mixed integer linear programming. In order to tackle large instances, we developed a three-phase local search algorithm with an effective procedure for search in neighbourhoods. Computational experiments for instances from one delivery company have shown the efficiency of the developed algorithm and significant reduction in costs. Tab. 2, ill. 4, bibliogr. 14.
vehicle routing, time window, work shift, pause, local search, fleet optimization.
PDF file (486 kB)
A. V. Khmelev, “A three-phase heuristic for the vehicle fleet and route optimization”, Diskretn. Anal. Issled. Oper., 22:6 (2015), 55–77
Citation in format AMSBIB
\paper A three-phase heuristic for the vehicle fleet and route optimization
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
I. S. Litvinchev, G. Cedillo, M. Velarde, “Integrating territory design and routing problems”, J. Comput. Syst. Sci. Int., 56:6 (2017), 969–974
|Number of views:|