Optimization of dynamic relocation operations for one-way electric carsharing systems

Optimization of dynamic relocation operations for one-way electric carsharing systems
复制标题

DOI:
10.1016/j.trc.2019.01.005
复制
发表时间:
2019-04
期刊:
Transportation Research Part C: Emerging Technologies
影响因子:
--
通讯作者:
Ling Wang;Qi Liu;Wanjing Ma
Ling Wang;Qi Liu;Wanjing Ma
中科院分区:
其他
文献类型:
--
作者:
Ling Wang;Qi Liu;Wanjing Ma

文献摘要

被引文献

相似文献

这项研究为单向电动汽车共享系统在没有提前预订信息的情况下进行搬迁操作开发了一种新的方法。该模型由搬迁需求计算和执行计划生成两部分组成。在第一部分中,提出了搬迁计算的门限和防止站点破产的方法。第二部分建立了搬迁方案优化的整数线性规划模型。车辆搬迁和人员再平衡都在一个统一的框架内进行了优化。此外,为了提高规划的效率,提出了一种将大规模网络划分为不同区域的分区方案。最后,建立了仿真模型,并利用现场数据进行了标定和验证,对所提方法的性能进行了测试。结果表明,该方法大大减少了分配任务的个数和分配距离,在完成任务损失不大的情况下,大大减少了计算时间。
This study developed a new approach for the relocation operations of one-way electric carsharing systems without advanced reservation information. The developed model consists of two parts: relocation needs computation and execution plan generation. In the first part, thresholds and a Station Ruin Prevention Method for relocation computation are proposed. In the second part, an Integer Linear Programming model for relocation plan optimization is formulated. Both Vehicle relocation and the Staff rebalancing are optimized in a unified framework. Furthermore, in order to improve the efficiency of the programming, a zoning scheme was proposed to divide the large-scale network into separate zones. Finally, a simulation model, which was calibrated and validated using the field data, was built to conduct tests on the performance of the proposed method. The results showed that the number of allocation tasks and distance for allocation have been greatly reduced because of the proposed methods, and the computing time can be reduced significantly with a small loss of accomplished tasks under the zoning scheme.