Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
复制标题
DOI：
10.1016/j.disopt.2016.12.001
复制
发表时间：
2015-04
期刊：
影响因子：
--
通讯作者：
M. Bruglieri;F. Pezzella;O. Pisacane
中科院分区：
文献类型：
--
作者：
M. Bruglieri;F. Pezzella;O. Pisacane
本文研究了单向汽车共享系统中的电动汽车重新定位问题（E-VReP），基于运营商使用折叠自行车来促进车辆重新定位。为了计算这种搬迁方法的经济可持续性，引入了与满足的每个搬迁请求相关联的收入和与使用的每个运营商相关联的成本。新的优化目标是总利润最大化。为了克服E-VReP的混合线性规划公式所需的高CPU时间的缺点，两个启发式算法，可行解的一般性质的基础上，设计。他们的有效性进行了测试，在两组现实的情况下。在第一种情况下，所有的请求具有相同的收入，而在第二种情况下，每个请求的收入具有与用户的租用时间相关的可变部分和与客户满意度相关的固定部分。最后，对请求数量和固定收入部分进行了敏感性分析。
This paper addresses an Electric Vehicle Relocation Problem (E-VReP), in one-way carsharing systems, based on operators who use folding bicycles to facilitate vehicle relocation. In order to calculate the economic sustainability of this relocation approach, a revenue associated with each relocation request satisfied and a cost associated with each operator used are introduced. The new optimization objective maximizes the total profit. To overcome the drawback of the high CPU time required by the Mixed Integer Linear Programming formulation of the E-VReP, two heuristic algorithms, based on the general properties of the feasible solutions, are designed. Their effectiveness is tested on two sets of realistic instances. In the first, all the requests have the same revenue, while, in the second, the revenue of each request has a variable component related to the user’s rent-time and a fixed part related to customer satisfaction. Finally, a sensitivity analysis is carried out on both the number of requests and the fixed revenue component.