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

Mohamed Amine Masmoudi; Manar Hosny; Emrah Demir; Konstantinos N. Genikomsakis; Naoufel Cheikhrouhou

doi:10.1016/j.tre.2018.08.005

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

Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir, Konstantinos N. Genikomsakis, Naoufel Cheikhrouhou

Management Science & Engineering

Research output: Contribution to journal › Article › peer-review

129 Scopus citations

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.

Original language	British English
Pages (from-to)	392-420
Number of pages	29
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	118
DOIs	https://doi.org/10.1016/j.tre.2018.08.005
State	Published - Oct 2018

Keywords

Battery swapping
Dial-a-ride problem
Electric vehicle
Evolutionary variable neighborhood search metaheuristic algorithm

Access to Document

10.1016/j.tre.2018.08.005

Cite this

@article{3c42875784d7448aa824a5947ccfed96,

title = "The dial-a-ride problem with electric vehicles and battery swapping stations",

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.",

keywords = "Battery swapping, Dial-a-ride problem, Electric vehicle, Evolutionary variable neighborhood search metaheuristic algorithm",

author = "Masmoudi, \{Mohamed Amine\} and Manar Hosny and Emrah Demir and Genikomsakis, \{Konstantinos N.\} and Naoufel Cheikhrouhou",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Ltd",

year = "2018",

month = oct,

doi = "10.1016/j.tre.2018.08.005",

language = "British English",

volume = "118",

pages = "392--420",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd",

}

TY - JOUR

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

AU - Masmoudi, Mohamed Amine

AU - Hosny, Manar

AU - Demir, Emrah

AU - Genikomsakis, Konstantinos N.

AU - Cheikhrouhou, Naoufel

PY - 2018/10

Y1 - 2018/10

N2 - 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.

AB - 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.

KW - Battery swapping

KW - Dial-a-ride problem

KW - Electric vehicle

KW - Evolutionary variable neighborhood search metaheuristic algorithm

UR - https://www.scopus.com/pages/publications/85052900065

U2 - 10.1016/j.tre.2018.08.005

DO - 10.1016/j.tre.2018.08.005

M3 - Article

AN - SCOPUS:85052900065

SN - 1366-5545

VL - 118

SP - 392

EP - 420

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this