The Dynamic Electric Carsharing Relocation Problem

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics Pub Date : 2021-01-01 DOI:10.1016/j.ejtl.2021.100055

Simen Hellem , Carl Andreas Julsvoll , Magnus Moan , Henrik Andersson , Kjetil Fagerholt , Giovanni Pantuso

{"title":"The Dynamic Electric Carsharing Relocation Problem","authors":"Simen Hellem , Carl Andreas Julsvoll , Magnus Moan , Henrik Andersson , Kjetil Fagerholt , Giovanni Pantuso","doi":"10.1016/j.ejtl.2021.100055","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437621000248/pdfft?md5=a2326fe8316bc17cfb75786a0b30194b&pid=1-s2.0-S2192437621000248-main.pdf","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437621000248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 7

Abstract

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.

查看原文本刊更多论文

动态电动共享汽车搬迁问题

本文解决了现代汽车共享运营商管理电动汽车车队所面临的搬迁和充电问题。当客户使用车队时，电池耗尽，车辆可能被留在低需求的地方。因此，为了更好地满足客户的需求，共享汽车运营商需要安排耗尽电池的充电和位置不佳的车辆的重新安置。这些活动大多需要专门工作人员的干预。本文提供了一个框架，用于计划充电和重新安置活动，该框架基于根据更新的系统信息定期路由和安排许多专用人员。将周期规划问题表述为一个混合整数线性规划，并以滚动水平的方式求解。为了解决这一问题，提出了一种快速自适应大邻域搜索启发式算法。基于奥斯陆市数据的测试表明，启发式方法可以在合理的计算时间内为与现实生活中的规划问题兼容的实例提供高质量的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

EURO Journal on Transportation and Logistics Multiple-

CiteScore

4.60

自引率

0.00%

发文量

审稿时长

129 days

期刊介绍： The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.