| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11005127 | Transportation Research Part E: Logistics and Transportation Review | 2018 | 29 Pages |
Abstract
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for customers with special needs and/or disabilities. The DARP with Electric Vehicles and battery swapping stations (DARP-EV) concerns scheduling a fleet of EVs to serve a set of pre-specified transport requests during a certain planning horizon. In addition, EVs can be recharged by swapping their batteries with charged ones from any battery-swap stations. We propose three enhanced Evolutionary Variable Neighborhood Search (EVO-VNS) algorithms to solve the DARP-EV. Extensive computational experiments highlight the relevance of the problem and confirm the efficiency of the proposed EVO-VNS algorithms in producing high quality solutions.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir, Konstantinos N. Genikomsakis, Naoufel Cheikhrouhou,