计算机科学
相互依存
车辆路径问题
RSS
启发式
布线(电子设计自动化)
电池(电)
运筹学
电动汽车
路径(计算)
数学优化
计算机网络
工程类
数学
物理
人工智能
功率(物理)
操作系统
量子力学
法学
政治学
作者
Ramin Raeesi,Konstantinos G. Zografos
标识
DOI:10.1016/j.ejor.2021.09.037
摘要
A primary challenge in goods distribution using Electric Commercial Vehicles (ECVs) pertains to tackling their limited driving range. This paper proposes a multi-faceted approach towards increasing the driving range of ECVs by coordinating the options of: (i) intra-route recharging at an intermediate Recharging Station (RS), with (ii) synchronised en-route battery swapping services performed by Battery Swapping Vans (BSVs) at a pre-planned rendezvous time and space. We introduce and solve a variant corresponding to an Electric Vehicle Routing Problem with Time Windows, RSs and Synchronised Mobile Battery Swapping (EVRPTW-RS-SMBS). In the proposed model, route planning is carried out synchronously for two interdependent fleets, i.e., ECVs and BSVs, which work in tandem to complete the delivery tasks. To address methodological complications arising from the simultaneous consideration of intra-route recharging at RSs and the synchronised battery swapping on-the-fly, the paper develops a pre-optimisation procedure based on a Non-Dominated Path Identification (NDPI) algorithm that is used in deriving a significantly strengthened path-based formulation of the problem, and an efficient dynamic programming based heuristic algorithm. To gain practical insights on the economic and environmental added value and viability of the proposed logistics model, we compare different scenarios for goods distribution using ECVs in urban and regional levels in London and Southeast England, respectively. A set of numerical experiments are further performed to demonstrate the efficiency of the proposed algorithms. Our results indicate significant cost and emissions savings and an opportunity for going beyond last mile local deliveries using ECVs with the proposed logistics model.
科研通智能强力驱动
Strongly Powered by AbleSci AI