An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem

This paper addresses the Electric Vehicle Scheduling Problem (E-VSP), in which a set of timetabled bus trips, each starting from and ending at specific locations and at specific times, should be carried out by a set of electric buses or vehicles based at a number of depots with limited driving ranges. The electric vehicles are allowed to be recharged fully or partially at any of the given recharging stations. The objective is to firstly minimize the number of vehicles needed to cover all the timetabled trips, and secondly to minimize the total traveling distance, which is equivalent to minimizing the total deadheading distance. A mixed integer programming formulation as well as an Adaptive Large Neighborhood Search (ALNS) heuristic for the E-VSP are presented. ALNS is tested on newly generated E-VSP benchmark instances. Result shows that the proposed heuristic can provide good solutions to large E-VSP instances and optimal or near-optimal solutions to small E-VSP instances. HighlightsThe electric vehicle scheduling with partial charging is addressed.A mixed integer programming model based on a directed acyclic graph is presented.An adaptive large neighborhood search heuristic is developed and tested on generated data.The model can solve instances with up to 30 trips and the heuristic up to 500 trips.

[1]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[2]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

[3]  Richard Freling,et al.  Vehicle Scheduling with Time Constraint , 1995 .

[4]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[5]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[6]  Lawrence Bodin,et al.  UCOST: A MICRO APPROACH TO A TRANSPORTATION PLANNING PROBLEM , 1978 .

[7]  Stefan Irnich,et al.  Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows , 2014, Oper. Res..

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

[9]  Mohamadreza Banihashemi,et al.  HEURISTIC APPROACHES FOR SOLVING LARGE-SCALE BUS TRANSIT VEHICLE SCHEDULING PROBLEM WITH ROUTE TIME CONSTRAINTS , 2002 .

[10]  Richard F. Hartl,et al.  The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations , 2013, Eur. J. Oper. Res..

[11]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

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

[14]  Dennis Huisman,et al.  A comparison of five heuristics for the multiple depot vehicle scheduling problem , 2009, J. Sched..

[15]  Leena Suhl,et al.  Line Change Considerations Within a Time-Space Network Based Multi-Depot Bus Scheduling Model , 2008 .

[16]  Dominik Goeke,et al.  Routing a mixed fleet of electric and conventional vehicles , 2015, Eur. J. Oper. Res..

[17]  Jonathan David Adler.  Routing and Scheduling of Electric and Alternative-Fuel Vehicles , 2014 .

[18]  Natalia Kliewer,et al.  An overview on vehicle scheduling models , 2009, Public Transp..

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

[20]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

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