The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
Top Cited Papers
- 1 November 2014
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 48 (4), 500-520
- https://doi.org/10.1287/trsc.2013.0490
Abstract
Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of these vehicles necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning to avoid inefficient vehicle routes with long detours. We introduce the electric vehicle-routing problem with time windows and recharging stations (E-VRPTW), which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme. Furthermore, we consider limited vehicle freight capacities as well as customer time windows, which are the most important constraints in real-world logistics applications. As a solution method, we present a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic. Tests performed on newly designed instances for the E-VRPTW as well as on benchmark instances of related problems demonstrate the high performance of the heuristic proposed as well as the positive effect of the hybridization.Keywords
This publication has 63 references indexed in Scilit:
- Municipal Solid Waste Collection and Management Problems: A Literature ReviewTransportation Science, 2014
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraintsEuropean Journal of Operational Research, 2012
- The Pollution-Routing ProblemTransportation Research Part B: Methodological, 2011
- The Shortest Path Problem Revisited: Optimal Routing for Electric VehiclesLecture Notes in Computer Science, 2010
- Optimal Location of Compressed Natural Gas (CNG) Refueling Station Using the Arc Demand Coverage ModelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Transit network design with allocation of green vehicles: A genetic algorithm approachTransportation Research Part C: Emerging Technologies, 2009
- The multi-depot vehicle routing problem with inter-depot routesEuropean Journal of Operational Research, 2007
- Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search AlgorithmsTransportation Science, 2005
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time WindowsINFORMS Journal on Computing, 2003
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001