1. A review on the electric vehicle routing problems: Variants and algorithms
- Author
-
Teng Ren, Xinxin Su, Zhixing Luo, and Hu Qin
- Subjects
metaheuristics ,050210 logistics & transportation ,exact algorithms ,021103 operations research ,business.product_category ,Computer science ,Location routing ,05 social sciences ,0211 other engineering and technologies ,Review Article ,02 engineering and technology ,Travelling salesman problem ,routing ,Time windows ,0502 economics and business ,Electric vehicle ,Vehicle routing problem ,Pickup ,Routing (electronic design automation) ,business ,recharging stations ,Algorithm ,Metaheuristic ,electric vehicles - 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.
- Published
- 2021
- Full Text
- View/download PDF