Geodesic
A three-phase heuristic for the vehicle fleet and route optimization
Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 6, pp. 55-77.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: vehicle routing, time window, work shift, pause, local search, fleet optimization. 
@article{DA_2015_22_6_a3,
     author = {A. V. Khmelev},
     title = {A three-phase heuristic for the vehicle fleet and route optimization},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {55--77},
     publisher = {mathdoc},
     volume = {22},
     number = {6},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2015_22_6_a3/}
}
TY  - JOUR
AU  - A. V. Khmelev
TI  - A three-phase heuristic for the vehicle fleet and route optimization
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2015
SP  - 55
EP  - 77
VL  - 22
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2015_22_6_a3/
LA  - ru
ID  - DA_2015_22_6_a3
ER  - 
%0 Journal Article
%A A. V. Khmelev
%T A three-phase heuristic for the vehicle fleet and route optimization
%J Diskretnyj analiz i issledovanie operacij
%D 2015
%P 55-77
%V 22
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2015_22_6_a3/
%G ru
%F DA_2015_22_6_a3
A. V. Khmelev. A three-phase heuristic for the vehicle fleet and route optimization. Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 6, pp. 55-77. http://geodesic.mathdoc.fr/item/DA_2015_22_6_a3/

[1] Yu. A. Kochetov, A. V. Khmelev, “Hybrid local search for the heterogenous fixed fleet vehicle routing problem”, Diskretn. Anal. Issled. Oper., 22:5 (2015), 5–29

[2] Bent R., van Hentenryck P., “A two-stage hybrid local search for the vehicle routing problem with time windows”, Transp. Sci., 38:4 (2004), 515–530 | DOI

[3] Bostel N., Dejax P., Guez P., Tricoire F., “Multiperiod planning and routing on a rolling horizon for field force optimization logistics”, The vehicle routing problem: Latest advances and new challenges, Oper. Res./Comput. Sci. Interfaces, 43, Springer-Verl., New York, 2008, 503–525 | DOI | MR | Zbl

[4] Bräysy O., Gendreau M., “Vehicle routing problem with time windows. Part I: Route constraction and local search algorithms”, Transp. Sci., 39 (2005), 104–118 | DOI

[5] Bräysy O., Gendreau M., “Vehicle routing problem with time windows. Part II: Metaheuristics”, Transp. Sci., 39:1 (2005), 119–139 | DOI

[6] Gagliardi J.-Ph., Renaud J., Ruiz A., Coehlo C. L., The vehicle routing problem with pauses, Tech. Rep. CIRRELT-2104-22. Available at , Interuniv. Res. Cent. Enterp. Netw., Logist. Transp., Montreal, QC, Canada, 2014, Accessed Oct. 15, 2015 https://www.cirrelt.ca/DocumentsTravail/CIRRELT-FSA-2014-22.pdf

[7] Gehring H., Homberger J., “Parallelization of a two-phase metaheuristic for routing problems with time windows”, Asia-Pac. J. Oper. Res., 18:1 (2001), 35–47

[8] Goel A., “Vehicle scheduling and routing with drivers' working hours”, Transp. Sci., 43:1 (2009), 17–26 | DOI

[9] Goel A., Archetti C., Savelsbergh M., “Truck driver scheduling in Australia”, Comput. Oper. Res., 39:5 (2012), 1122–1132 | DOI | MR | Zbl

[10] Goel A., Vidal T., “Hours of service regulations in road freight transport: An optimization-based international assessment”, Transp. Sci., 48:3 (2014), 391–412 | DOI

[11] Mladenović N., Hansen P., “Variable neighborhood search”, Comput. Oper. Res., 24:11 (1997), 1097–1100 | DOI | MR | Zbl

[12] Nagata Yu., Bräysy O., “A powerful route minimization heuristic for the vehicle routing problem with time windows”, Oper. Res. Lett., 37:5 (2009), 333–338 | DOI | MR | Zbl

[13] Sahoo S., Kim S., Kim B.-I., Kraas B., Popov A. (Jr.), “Routing optimization for waste management”, Interfaces, 35:1 (2005), 24–36 | DOI

[14] Vidal T., Crainic T. G., Gendreau M., Prins C., “A unified solution framework for multi-attribute vehicle routing problems”, Eur. J. Oper. Res., 234:3 (2014), 658–673 | DOI | MR | Zbl