The dial-a-ride problem with electric vehicles and battery swapping stations

Masmoudi, Mohamed Amine (Haute école de gestion de Genève, HES-SO // Haute Ecole Spécialisée de Suisse Occidentale) ; Hosny, Manar (King Saud University (KSU), Riyadh, Saudi Arabia) ; Demir, Emrah (Cardiff University, United Kingdom) ; Genikomsakis, Konstantinos N. (University of Mons, Belgium) ; Cheikhrouhou, Naoufel (Haute école de gestion de Genève, HES-SO // Haute Ecole Spécialisée de Suisse Occidentale)

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.


Keywords:
Article Type:
scientifique
Faculty:
Economie et Services
School:
HEG - Genève
Institute:
CRAG - Centre de Recherche Appliquée en Gestion
Subject(s):
Economie/gestion
Date:
2018-10
Pagination:
29 p.
Published in:
Transportation research part E: logistics and transportation review
Numeration (vol. no.):
2018, vol. 118, pp. 392-420
DOI:
Appears in Collection:

Note: The status of this file is: public


 Record created 2018-09-14, last modified 2019-04-11

Fulltext:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)