The Plug-In Hybrid Electric Vehicle Routing Problem with Time Windows

There is an increasing interest in sustainability and a growing debate about environmental policy measures aiming at the reduction of green house gas emissions across different economic sectors worldwide. The transportation sector is one major greenhouse gas emitter which is heavily regulated to reduce its dependance on oil. These regulations along with the growing customer awareness about global warming has led vehicle manufacturers to seek different technologies to improve vehicle efficiencies and reduce the green house gases emissions while at the same time meeting customer’s expectation of mobility and flexibility. Plug-in hybrid electric vehicles (PHEV) is one major promising solution for a smooth transition from oil dependent transportation sector to a clean electric based sector while not compromising the mobility and flexibility of the drivers. In the medium term, plug-in hybrid electric vehicles (PHEV) can lead to significant reductions in transportation emissions. These vehicles are equipped with a larger battery than regular hybrid electric vehicles which can be recharged from the grid. For short trips, the PHEV can depend solely on the electric engine while for longer journeys the alternative fuel can assist the electric engine to achieve extended ranges. This is beneficial when the use pattern is mixed such that and short long distances needs to be covered. The plug-in hybrid electric vehicles are well-suited for logistics since they can avoid the possible disruption caused by charge depletion in case of all-electric vehicles with tight time schedules. The use of electricity and fuel gives rise to a new variant of the classical vehicle routing with time windows which we call the plug-in hybrid electric vehicle routing problem with time windows (PHEVRPTW). The objective of the PHEVRPTW is to minimize the routing costs of a fleet of PHEVs by minimizing the time they run on gasoline while meeting the demand during the available time windows. As a result, the driver of the PHEV has two decisions to make at each node: (1) recharge the vehicle battery to achieve a longer range using electricity, or (2) continue to the next open time window with the option of using the alternative fuel. In this thesis, we present a mathematical formulation for the plug-in hybrid-electric vehicle routing problem with time windows. We solve this problem using a Lagrangian relaxation and we propose a new tabu search algorithm. We also present the first results for the full adapted Solomon instances.

[1]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[2]  Roberto Roberti,et al.  An exact solution framework for a broad class of vehicle routing problems , 2010, Comput. Manag. Sci..

[3]  Sam R. Thangiah,et al.  Chapter 9 A Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Heuristic for Vehicle Routing Problems with Time Windows , 1999 .

[4]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[5]  Isa Bar-On,et al.  Technical cost analysis for PEM fuel cells , 2002 .

[6]  Philip Kilby,et al.  Vehicle Routing Problem with Time Windows , 2004 .

[7]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[8]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[9]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[10]  Giampaolo Manzolini,et al.  Energy analysis of electric vehicles using batteries or fuel cells through well-to-wheel driving cycle simulations , 2009 .

[11]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[12]  B. Steele,et al.  Materials for fuel-cell technologies , 2001, Nature.

[13]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[14]  Marius Mihai Solomon,et al.  VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOW CONSTRAINTS: MODELS AND ALGORITHMS (HEURISTICS) , 1984 .

[15]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[16]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

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

[18]  K. W. Knight,et al.  Vehicle Scheduling with Timed and Connected Calls: A Case Study , 1968 .

[19]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[20]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[21]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[22]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[23]  Ramesh Sharda,et al.  Metaheuristic Optimization via Memory and Evolution , 2005 .

[24]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[25]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[26]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[27]  J. Desrosiers,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .

[28]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[29]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[30]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[31]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[32]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[33]  Aie World Energy Outlook 2000 , 2000 .

[34]  Jürgen Schulze,et al.  A parallel algorithm for the vehicle routing problem with time window constraints , 1999, Ann. Oper. Res..

[35]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[36]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[37]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[38]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[39]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[40]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

[41]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

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

[43]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[44]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[45]  Jeffrey L. Rummel,et al.  A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .

[46]  Jörg Homberger,et al.  A parallel two-phase metaheuristic for routing problems with time windows , 2001 .

[47]  Alberto Bellini,et al.  Battery choice and management for new-generation electric vehicles , 2005, IEEE Transactions on Industrial Electronics.

[48]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

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

[50]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[51]  Marvin D. Nelson,et al.  Implementation techniques for the vehicle routing problem , 1985, Comput. Oper. Res..

[52]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[53]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[54]  Paul M. Grant,et al.  Hydrogen lifts off — with a heavy load , 2003, Nature.

[55]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[56]  R. M. Dell,et al.  Hydrogen Energy: Challenges and Prospects , 2008 .

[57]  D. P. Bakker,et al.  Battery Electric Vehicles , 2010 .

[58]  H. G. M. Pullen,et al.  A computer application to a transport scheduling problem , 1967, Comput. J..

[59]  Bengt Klefsjö,et al.  The machine that changed the world , 2008 .

[60]  Gérard P. Cachon,et al.  Supply Chain Design and the Cost of Greenhouse Gas Emissions , 2012 .

[61]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[62]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

[63]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[64]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[65]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[66]  M. Thring World Energy Outlook , 1977 .

[67]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[68]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[69]  Jacinto F. Fabiosa,et al.  Use of U.S. Croplands for Biofuels Increases Greenhouse Gases Through Emissions from Land-Use Change , 2008, Science.

[70]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[71]  Nigel P. Brandon,et al.  Hydrogen and fuel cells: Towards a sustainable energy future , 2008 .

[72]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[73]  Ayhan Demirbas,et al.  Biofuels sources, biofuel policy, biofuel economy and global biofuel projections , 2008 .

[74]  A. Demirbas,et al.  Importance of biodiesel as transportation fuel , 2007 .

[75]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[76]  David Burwell Sustainable Automobile Transport: Shaping Climate Change Policy , 2008 .

[77]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[78]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[79]  Fred Glover New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[80]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[81]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[82]  Mark S. Daskin,et al.  Carbon Footprint and the Management of Supply Chains: Insights From Simple Models , 2013, IEEE Transactions on Automation Science and Engineering.

[83]  Saïd Salhi,et al.  Inventory routing problems: a logistical overview , 2007, J. Oper. Res. Soc..

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

[85]  Zuo-Jun Max Shen,et al.  Infrastructure Planning for Electric Vehicles with Battery Swapping , 2012, Manag. Sci..

[86]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[87]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[88]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[89]  A. Schäfer,et al.  Transportation in a Climate-Constrained World , 2009 .

[90]  Ibrahim H. Osman,et al.  Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows , 1997 .

[91]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[92]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[93]  John H. Holland,et al.  Cognitive systems based on adaptive algorithms , 1977, SGAR.

[94]  Pierre Desprairies,et al.  World Energy Outlook , 1977 .

[95]  Matthew M. Mench,et al.  Fuel Cell Engines , 2008 .

[96]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[97]  Sandra L. Rothenberg,et al.  Is lean green? : the relationship between manufacturing processes and environmental performance within different regulatory contexts , 1999 .

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

[99]  F.-H. Liu,et al.  The fleet size and mix vehicle routing problem with time windows , 1999, J. Oper. Res. Soc..

[100]  J. Tester,et al.  Sustainable Energy: Choosing Among Options , 2005 .

[101]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[102]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[103]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[104]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[105]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[106]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[107]  Brian Kallehauge,et al.  Lagrangian duality applied to the vehicle routing problem with time windows , 2006, Comput. Oper. Res..

[108]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[109]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[110]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[111]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[112]  Ramteen Sioshansi,et al.  OR Forum - Modeling the Impacts of Electricity Tariffs on Plug-In Hybrid Electric Vehicle Charging, Costs, and Emissions , 2012, Oper. Res..

[113]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..