A review on the electric vehicle routing problems: Variants and algorithms
Authors:
Top Cited Papers
Open Access
- 19 May 2021
- journal article
- review article
- Published by Springer Nature in Frontiers of Engineering Management
- Vol. 8 (3) , 370-389
Abstract
Over the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.Keywords
This publication has 113 references indexed in Scilit:
- A memetic algorithm for the multiperiod vehicle routing problem with profitEuropean Journal of Operational Research, 2013
- An efficient GVNS for solving Traveling Salesman Problem with Time WindowsElectronic Notes in Discrete Mathematics, 2012
- A General VNS heuristic for the traveling salesman problem with time windowsDiscrete Optimization, 2010
- Recent results on Arc Routing Problems: An annotated bibliographyNetworks, 2010
- The vehicle routing problem: A taxonomic reviewComputers & Industrial Engineering, 2009
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimizationEngineering Optimization, 2006
- Variable neighborhood searchComputers & Operations Research, 1997
- Route first—Cluster second methods for vehicle routingOmega, 1983