The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

European Journal of Operational Research

Volumn 252, Issue 3, 2016, Pages 995-1018

  Hiermann, Gerhard ^a   Puchinger, Jakob ^a,d,e   Ropke, Stefan ^b   Hartl, Richard F ^c  

^a AIT AUSTRIAN INSTITUTE OF TECHNOLOGY   (Austria)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c UNIVERSITY OF VIENNA   (Austria)

^d UNIVERSITÉ PARIS SACLAY   (France)

^e Institut de Recherche Technologique SystemX   (France)

Author keywords

Efficient constraint handling; Electric vehicle routing; Heterogenous fleet

Indexed keywords

BENCHMARKING; CHARGING (BATTERIES); ELECTRIC BATTERIES; ELECTRIC VEHICLES; FLEET OPERATIONS; INTEGER PROGRAMMING; NETWORK ROUTING; PROBLEM SOLVING; ROUTING ALGORITHMS; SECONDARY BATTERIES; VEHICLE ROUTING; VEHICLES;

CONSTRAINT HANDLING; FLEET SIZE AND MIXES; HETEROGENOUS FLEET; LARGE NEIGHBOURHOOD SEARCHES; RESEARCH COMMUNITIES; TECHNOLOGICAL PROGRESS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

BATTERY ELECTRIC VEHICLES;

EID: 84968353905     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2016.01.038     Document Type: Article

References (48)

1. Austriatech (2014). Annex: Electric fleets in urban logistics, project ENCLOSE. http://www.austriatech.at/files/get/9e26eb124ad90ffa93067085721d4942/austriatech-electricfleets-annex.pdf, Last accessed 2015-07-21.
2. Baldacci R., Bartolini E., Mingozzi A., and Roberti R. An exact solution framework for a broad class of vehicle routing problems Computational Management Science 7 3 2010 229 268
3. Baldacci R., Battarra M., and Vigo D. Routing a heterogeneous fleet of vehicles Golden B. Raghavan S. Wasil E. The vehicle routing problem: Latest advances and new challenges Operations Research/Computer Science Interfaces Vol. 43 2008 Springer US 3 27
4. Bektas T., and Laporte G. The pollution-routing problem Transportation Research Part B: Methodological 45 2011 1232 1250
5. Bräysy O., Dullaert W., Hasle G., Mester D.I., and Gendreau M. An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows Transportation Science 42 3 2008 371 386
6. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part i: Route construction and local search algorithms Transportation Science 39 1 2005 104 118
7. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part ii: Metaheuristics Transportation Science 39 1 2005 119 139
8. Bräysy O., Porkka P., Dullaert W., Repoussis P.P., and Tarantilis C.D. A well-scaleable metaheuristic for the fleet size and mix vehicle routing problem with time windows Expert Systems with Applications 36 4 2008 8460 8475
9. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
10. Conrad R.G., and Figliozzi M.A. The recharging vehicle routing problem Doolen T. Aken E.V. Proceedings of the 2011 industrial engineering research conference 2011 Reno Nevada
11. Cordeau J.-F, Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society 52 8 2001 928 936
12. Crevier B., Cordeau J.F., and Laporte G. The multi-depot vehicle routing problem with inter-depot routes European Journal of Operational Research 176 2 2007 756 773
13. Dekker R., Bloemhof J., and Mallidis I. Operations research for green logistics - an overview of aspects, issues, contributions and challenges European Journal of Operational Research 219 3 2012 671 679
14. Dell'Amico M., Monaci M., Pagani C., and Vigo D. Heuristic approaches for the fleet size and mix vehicle routing problem with time windows Transportation Science 41 4 2007 516 526
15. Desaulniers G., Fausto E., Irnich S., and Schneider M. Technical report les cahiers du gerad, g-2014-110 2014 Montral Canada
16. Desaulniers G., Lessard F., and Hadjar A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science 42 3 2008 387 404
17. Desrosiers J., and Lübbecke M. Branch-price-and-cut algorithms Wiley encyclopedia of operations research and management science (EORMS) 2011 Wiley
18. Di Gaspero L., and Schaerf A. Multi-neighbourhood local search with application to course timetabling Burke E. De Causmaecker P. Practice and theory of automated timetabling IV 2002 Springer, DE 262 275
19. Dullaert W., Janssens G.K., Sörensen K., and Vernimmen B. New heuristics for the fleet size and mix vehicle routing problem with time windows Journal of the Operations Research Society 53 11 2002 1232 1238
20. Erdǒan S., and Miller-Hooks E. A green vehicle routing problem Transportation Research Part E: Logistics and Transportation Review 48 1 2012 100 114
21. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems Networks 44 3 2004 216 229
22. Goeke D., and Schneider M. Routing a mixed fleet of electric and conventional vehicles European Journal of Operational Research 245 1 2015 81 99
23. Golden B., Assad A., Levy L., and Gheysens F. The fleet size and mix vehicle routing problem Computers & Operations Research 11 1 1984 49 66
24. Hart J.P., and Shogan A.W. Semi-greedy heuristics: an empirical study Operations Research Letters 6 3 1987 107 114
25. Hiermann G., Prandtstetter M., Rendl A., Puchinger J., and Raidl G.R. Metaheuristics for solving a multimodal home-healthcare scheduling problem Central European Journal of Operations Research 23 1 2015 89 113
26. Irnich S., and Desaulniers G. Shortest path problems with resource constraints Desaulniers G. Desrosiers J. Solomon M.M. Column generation 2005 Springer 33 65
27. Irnich S., and Villeneuve D. The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3 INFORMS Journal on Computing 18 3 2006 391 406
28. Kindervater G.A.P., and Savelsbergh M.W.P. Vehicle routing: Handling edge exchanges Aarts E. Lenstra J.K. Local Search in Combinatorial Optimization 1997 John Wiley & Sons Ltd 337 360
29. Koç Ç., Bektas T., and Jabali O. Laporte g the fleet size and mix pollution-routing problem Transportation Research Part B: Methodological 70 2014 230 254
30. Liu F.H., and Shen S.Y. The fleet size and mix vehicle routing problem with time windows The Journal of the Operational Research Society 50 7 1999 721 732
31. Nagata Y., Bräysy O., and Dullaert W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows Computers & Operations Research 37 4 2010 724 737
32. Paraskevopoulos D.C., Repoussis P.P., Tarantilis C.D., Ioannou G., and Prastacos G.P. A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows Journal of Heuristics 14 5 2008 425 455
33. Pelletier S., Jabali O., and Laporte G. Goods distribution with electric vehicles: review and research perspectives Technical Report CIRRELT-2014-44, CIRRELT, Montreal, Canada 2015
34. Pisinger D., and Ropke S. Large neighborhood search Gendreau M. Potvin J.Y. Handbook of metaheuristics, international series in operations research & management science Vol. 146 2010 Springer US 399 419
35. Potvin J.Y., and Rousseau J.M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows European Journal of Operational Research 66 3 1993 331 340
36. Repoussis P.P., and Tarantilis C.D. Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming Transportation Research Part C: Emerging Technologies 18 5 2010 695 712
37. Righini G., and Salani M. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints Discrete Optimization 3 3 2006 255 273
38. Ropke S., and Cordeau J.F. Branch and cut and price for the pickup and delivery problem with time windows Transportation Science 43 3 2009 267 286
39. Ropke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 4 2006 455 472
40. Sbihi A., and Eglese R.W. Combinatorial optimization and green logistics Annals of Operations Research 175 1 2010 159 175
41. Schneider M., Sand B., and Stenger A. A note on the time travel approach for handling time windows in vehicle routing problems Computers & Operations Research 40 10 2013 2564 2568
42. Schneider M., Stenger A., and Goeke D. The electric vehicle routing problem with time windows and recharging stations Transportation Science 48 4 2014 500 520
43. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems Maher M.J. Puget J.F. Proceedings of the 4th international conference on principles and practice of constraint programming. CP '98 1998 Springer UK 417 431
44. Tarantilis C.D., Zachariadis E.E., and Kiranoudis C.T. A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities INFORMS Journal on Computing 20 1 2008 154 168
45. Toth P., and Vigo D. Vehicle routing: problems, methods, and applications MOS-SIAM Series on Optimization 2nd ed. 2014 SIAM Philadelphia, PA
46. Trick M.A. A linear relaxation heuristic for the generalized assignment problem Naval Research Logistics (NRL) 39 2 1992 137 151
47. Vidal T., Crainic T.G., Gendreau M., and Prins C. Heuristics for multi-attribute vehicle routing problems: a survey and synthesis European Journal of Operational Research 231 1 2013 1 21
48. Vidal T., Crainic T.G., Gendreau M., and Prins C. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows Computers & Operations Research 40 1 2013 475 489