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

We develop a solution approach to solve the green vehicle routing problem.We propose a simulated annealing heuristic to improve the quality of solutions.We present a new formulation having fewer variable and constraints.We evaluate the algorithm in terms of the several performance criterions.Our algorithm is able to optimally solve 22 of 40 benchmark instances. This paper develops a simulated annealing heuristic based exact solution approach to solve the green vehicle routing problem (G-VRP) which extends the classical vehicle routing problem by considering a limited driving range of vehicles in conjunction with limited refueling infrastructure. The problem particularly arises for companies and agencies that employ a fleet of alternative energy powered vehicles on transportation systems for urban areas or for goods distribution. Exact algorithm is based on the branch-and-cut algorithm which combines several valid inequalities derived from the literature to improve lower bounds and introduces a heuristic algorithm based on simulated annealing to obtain upper bounds. Solution approach is evaluated in terms of the number of test instances solved to optimality, bound quality and computation time to reach the best solution of the various test problems. Computational results show that 22 of 40 instances with 20 customers can be solved optimally within reasonable computation time.

[1]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .

[2]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[3]  Julian Hof,et al.  An adaptive VNS algorithm for vehicle routing problems with intermediate stops , 2014, OR Spectrum.

[4]  Ismail Karaoglan,et al.  A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery , 2011, Eur. J. Oper. Res..

[5]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[6]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[7]  Gilbert Laporte,et al.  The fleet size and mix pollution-routing problem , 2014 .

[8]  Maja Piecyk,et al.  Measurement of CO2 emissions from road freight transport: A review of UK experience , 2009 .

[9]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[10]  Gonçalo Homem de Almeida Correia,et al.  Electric Vehicles Charging Network Planning , 2014 .

[11]  G. Laporte,et al.  Hamiltonian location problems , 1983 .

[12]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[13]  Kara M. Kockelman,et al.  THE ELECTRIC VEHICLE CHARGING STATION LOCATION PROBLEM: A PARKING-BASED ASSIGNMENT METHOD FOR SEATTLE , 2013 .

[14]  Richard W. Eglese,et al.  Combinatorial optimization and Green Logistics , 2007 .

[15]  Gilbert Laporte,et al.  A review of recent research on green road freight transportation , 2014, Eur. J. Oper. Res..

[16]  Lou Caccetta,et al.  An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem , 2003, Transp. Sci..

[17]  Enrique Alba,et al.  Applied Soft Computing a Comparative Study between Dynamic Adapted Pso and Vns for the Vehicle Routing Problem with Dynamic Requests , 2022 .

[18]  Gilbert Laporte,et al.  A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem , 2003, Eur. J. Oper. Res..

[19]  Angel A. Juan,et al.  The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem , 2008 .

[20]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[21]  Angel A. Juan,et al.  Routing fleets with multiple driving ranges: Is it possible to use greener fleet configurations? , 2014, Appl. Soft Comput..

[22]  Tolga Bektas,et al.  Green Vehicle Routing , 2014, Vehicle Routing.

[23]  F. Altiparmak,et al.  The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach , 2012 .

[24]  B. Suman,et al.  A survey of simulated annealing as a tool for single and multiobjective optimization , 2006, J. Oper. Res. Soc..

[25]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[26]  Dominik Goeke,et al.  The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations , 2014, Transp. Sci..

[27]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[28]  Ziauddin Ursani,et al.  Localized genetic algorithm for vehicle routing problem with time windows , 2011, Appl. Soft Comput..

[29]  Gilbert Laporte,et al.  The multi-depot vehicle routing problem with inter-depot routes , 2007, Eur. J. Oper. Res..

[30]  António Pais Antunes,et al.  Optimal Location of Charging Stations for Electric Vehicles in a Neighborhood in Lisbon, Portugal , 2011 .

[31]  Yupo Chan,et al.  The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations , 2005, Math. Comput. Model..

[32]  Daniele Vigo,et al.  Chapter 6 Vehicle Routing , 2007, Transportation.

[33]  Emmanouil E. Zachariadis,et al.  A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities , 2008, INFORMS J. Comput..

[34]  Juan José Salazar González,et al.  Projection results for vehicle routing , 2005, Math. Program..

[35]  Julio Ortega Lopera,et al.  A Simulated Annealing-based parallel multi-objective approach to vehicle routing problems with time windows , 2013, Expert Syst. Appl..

[36]  Magdalene Marinaki,et al.  Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands , 2013, Appl. Soft Comput..

[37]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[38]  Moshe Dror,et al.  A branch and cut algorithm for the VRP with satellite facilities , 1998 .

[39]  Yu Nie,et al.  A corridor-centric approach to planning electric vehicle charging infrastructure , 2013 .

[40]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[41]  Giovanni Righini,et al.  A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges , 2014 .

[42]  Elise Miller-Hooks,et al.  A Green Vehicle Routing Problem , 2012 .

[43]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[44]  Tobias Achterberg,et al.  SCIP - a framework to integrate Constraint and Mixed Integer Programming , 2004 .

[45]  L. Gouveia.  A result on projection for the vehicle routing ptoblem , 1995 .