The green vehicle routing problem: A heuristic based exact solution approach

Applied Soft Computing Journal

Volumn 39, Issue , 2016, Pages 154-164

  Koç, Çaʇri ^a   Karaoglan, Ismail ^b  

^a HEC MONTRÉAL   (Canada)

^b SELCUK UNIVERSITY   (Turkey)

Author keywords

Branch and cut algorithm; Mixed integer programming formulation; Simulated annealing; The green vehicle routing problem

Indexed keywords

ALGORITHMS; DISTRIBUTION OF GOODS; FLEET OPERATIONS; HEURISTIC ALGORITHMS; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; SIMULATED ANNEALING; URBAN TRANSPORTATION; VEHICLES;

ALTERNATIVE ENERGY; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; EXACT ALGORITHMS; MIXED INTEGER PROGRAMMING; SOLUTION APPROACH; TRANSPORTATION SYSTEM; VEHICLE ROUTING PROBLEMS;

INTEGER PROGRAMMING;

EID: 84948423326     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2015.10.064     Document Type: Article

References (46)

1. G.B. Dantzig, and J. Ramser The truck dispatching problem Manag. Sci. 6 1959 80 88
2. A.A. Juan, J. Faulin, R. Ruiz, B. Barrios, and S. Caballé The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem Appl. Soft Comput. 10 2010 215 224
3. M.R. Khouadjia, B. Sarasola, E. Alba, L. Jourdan, and E.G. Talbi A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests Appl. Soft Comput. 12 2012 1426 1439
4. Y. Marinakis, G.R. Iordanidou, and M. Marinaki Particle swarm optimization for the vehicle routing problem with stochastic demands Appl. Soft Comput. 13 2013 1693 1704
5. Z. Ursani, D. Essam, D. Cornforth, and R. Stocker Localized genetic algorithm for vehicle routing problem with time windows Appl. Soft Comput. 11 2011 5375 5390
6. J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, and D. Vigo Vehicle routing C. Barnhart, G. Laporte, Transportation, Handbooks in Operations Research and Management Science 1st ed. 2007 Elsevier Science Publishers Amsterdam 367 428
7. B.L. Golden, S. Raghavan, and E.A. Wasil The Vehicle Routing Problem: Latest Advances and New Challenges 2008 Springer Science + Business Media, LLC New York
8. G. Laporte Fifty years of vehicle routing Transp. Sci. 43 2009 408 416
9. P. Toth, and D. Vigo Vehicle Routing: Problems, Methods, and Applications 2014 MOS-SIAM Series on Optimization Philadelphia
10. 2 emissions from road freight transport: a review of UK experience Energy Policy 37 2009 3733 3742
11. A. Sbihi, and R.W. Eglese Combinatorial optimization and green logistics Ann Oper Res 5 2007 99 116
12. T. Bektaş, and G. Laporte The pollution-routing problem Transp. Res. B: Methodol. 45 2011 1232 1250
13. A.A. Juan, J. Goentzel, and T. Bektaş Routing fleets with multiple driving ranges: is it possible to use greener fleet configurations? Appl. Soft Comput. 21 2014 84 94
14. Ç. Koç, T. Bektaş, O. Jabali, and G. Laporte The fleet size and mix pollution-routing problem Transp. Res. B: Methodol. 70 2014 239 254
15. R. Eglese, and T. Bektaş Green vehicle routing P. Toth, D. Vigo, Vehicle Routing: Problems, Methods, and Applications 2014 MOS-SIAM Series on Optimization Philadelphia 437 458
16. E. Demir, T. Bektaş, and G. Laporte A review of recent research on green road freight transportation Eur. J. Oper. Res. 237 2014 775 793
17. C. Lin, K.L. Choy, G.T.S. Ho, S.H. Chung, and H.Y. Lam Survey of green vehicle routing problem: past and future trends Expert Syst. Appl. 41 2014 1118 1138
18. S. Erdogan, and E. Miller-Hooks A green vehicle routing problem Transp. Res. E: Logist. Transp. Rev. 48 2012 100 114
19. J.F. Bard, L. Huang, M. Dror, and P. Jaillet A branch and cut algorithm for the VRP with satellite facilities IIE Trans. 30 1998 821 834
20. Y. Chan, and S.F. Baker The multiple depot, multiple traveling salesmen facility-location problem: vehicle range, service frequency, and heuristic implementations Math. Comput. Model. 41 2005 1035 1053
21. B. Crevier, J. Cordeau, and G. Laporte The multi-depot vehicle routing problem with inter-depot routes Eur. J. Oper. Res. 176 2007 756 773
22. C.D. Tarantilis, E.E. Zachariadis, and C.T. Kiranoudis A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities Inf. J. Comput. 20 2008 154 168
23. I. Frade, A. Ribeiro, G. Gonçalves, and A.P. Antunes Optimal location of charging stations for electric vehicles in a neighborhood in Lisbon, Portugal Transp. Res. Rec. J. Transp. Res. Board 2252 1 2011 91 98
24. T.D. Chen, K.M. Kockelman, and M. Khan Electric vehicle charging station location problem: a parking-based assignment method for Seattle Transportation Research Board 92nd Annual Meeting (No. 13-1254) 2013
25. Y.M. Nie, and M.A. Ghamami Corridor-centric approach to planning electric vehicle charging infrastructure Transp. Res. B: Methodol. 57 2013 172 190
26. J. Cavadas, G. Correia, and J. Gouveia Electric vehicles charging network planning Computer-based Modelling and Optimization in Transportation 2014 Springer International Publishing 85 100
27. M. Schneider, A. Stenger, and D. Goeke The electric vehicle-routing problem with time windows and recharging stations Transp. Sci. 48 2014 500 520
28. M. Schneider, A. Stenger, and J. Hof An Adaptive VNS Algorithm for Vehicle Routing Problems with Intermediate Stops, Technical Report LPIS-01/2014 2014
29. Á. Felipe, M.T. Ortuño, G. Righini, and G. Tirado A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges Transp. Res. E: Logist. Transp. Rev. 71 2014 111 128
30. C. Miller, A. Tucker, and R. Zemlin Integer programming formulations and traveling salesman problems J. ACM 7 1960 326 329
31. R.V. Kulkarni, and P.R. Bhave Integer programming formulations of vehicle routing problems Eur. J. Oper. Res. 20 1985 58 67
32. M. Desrochers, and G. Laporte Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints Oper. Res. Lett. 10 1991 27 36
33. I. Kara, G. Laporte, and T. Bektas A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem Eur. J. Oper. Res. 158 2004 793 795
34. I. Kara Two Indexed Polynomial Size Formulations for Vehicle Routing Problems 2008 Başkent University Ankara/Turkey
35. N.R. Achuthan, L. Caccetta, and S.P. Hill An improved branch-and-cut algorithm for the capacitated vehicle routing problem Transp. Sci. 37 2003 153 169
36. I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery Eur. J. Oper. Res. 211 2011 318 332
37. I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz The location-routing problem with simultaneous pickup and delivery: formulations and a heuristic approach Omega 40 2012 465 477
38. G. Laporte, Y. Nobert, and P. Pelletier Hamiltonian location problems Eur. J. Oper. Res. 12 1983 82 89
39. L. Gouveia A result on projection for the vehicle routing problem Eur. J. Oper. Res. 85 1995 610 624
40. A.N. Letchford, and J.-J. Salazar-González Projection results for vehicle routing Math. Program. 105 2006 251 274
41. K.A. Dowsland, and J.M. Thompson Simulated annealing Handbook of Natural Computing 2012 Springer Berlin 1623 1655
42. R. Banos, J. Ortega, C. Gil, A. Fernandez, and F. De Toro A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows Expert Syst. Appl. 40 2013 1696 1707
43. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper. Res. 12 1964 568 581
44. B. Suman, and P. Kumar A survey of simulated annealing as a tool for single and multiobjective optimization J. Oper. Res. Soc. 57 2005 1143 1160
45. T. Achterberg SCIP - A Framework to Integrate Constraint and Mixed Integer Programming 2004 Zuse Institute Berlin
46. IBM-ILOG CPLEX 12.2 http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/