The Dynamic Electric Carsharing Relocation Problem
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
The Dynamic Electric Carsharing Relocation Problem. / Hellem, Simen; Julsvoll, Carl Andreas; Moan, Magnus; Andersson, Henrik; Fagerholt, Kjetil; Pantuso, Giovanni.
I: EURO Journal on Transportation and Logistics, Bind 10, 100055, 2021.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - The Dynamic Electric Carsharing Relocation Problem
AU - Hellem, Simen
AU - Julsvoll, Carl Andreas
AU - Moan, Magnus
AU - Andersson, Henrik
AU - Fagerholt, Kjetil
AU - Pantuso, Giovanni
PY - 2021
Y1 - 2021
N2 - This article addresses a relocation and recharging problem faced by modern carsharing operators who manage a fleet of electric vehicles. As customers utilize the fleet, batteries are depleted and vehicles are possibly left in low-demand locations. Consequently, carsharing operators need to arrange the charging of depleted batteries and the relocation of poorly positioned vehicles in order to better meet the demand of the customers. Most of these activities require the intervention of dedicated staff. This article provides a framework for planning recharging and relocation activities based on periodically routing and scheduling a number of dedicated staff as a result of updated system information. The periodic planning problem is formulated as a Mixed Integer Linear Program and solved in a rolling-horizon fashion. For the solution of the problem a fast Adaptive Large Neighborhood Search heuristic is proposed. Tests based on data for the city of Oslo show that the heuristic can deliver, in reasonable computational time, high quality solutions for instances compatible with real-life planning problems.
AB - This article addresses a relocation and recharging problem faced by modern carsharing operators who manage a fleet of electric vehicles. As customers utilize the fleet, batteries are depleted and vehicles are possibly left in low-demand locations. Consequently, carsharing operators need to arrange the charging of depleted batteries and the relocation of poorly positioned vehicles in order to better meet the demand of the customers. Most of these activities require the intervention of dedicated staff. This article provides a framework for planning recharging and relocation activities based on periodically routing and scheduling a number of dedicated staff as a result of updated system information. The periodic planning problem is formulated as a Mixed Integer Linear Program and solved in a rolling-horizon fashion. For the solution of the problem a fast Adaptive Large Neighborhood Search heuristic is proposed. Tests based on data for the city of Oslo show that the heuristic can deliver, in reasonable computational time, high quality solutions for instances compatible with real-life planning problems.
U2 - 10.1016/j.ejtl.2021.100055
DO - 10.1016/j.ejtl.2021.100055
M3 - Journal article
VL - 10
JO - EURO Journal on Transportation and Logistics
JF - EURO Journal on Transportation and Logistics
SN - 2192-4376
M1 - 100055
ER -
ID: 285520383