当前位置: X-MOL 学术Transp. Res. Part E Logist. Transp. Rev. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Exact approaches for routing capacitated electric vehicles
Transportation Research Part E: Logistics and Transportation Review ( IF 10.6 ) Pub Date : 2020-11-16 , DOI: 10.1016/j.tre.2020.102126
Hesamoddin Tahami , Ghaith Rabadi , Mohamed Haouari

We investigate a variant of the standard Capacitated Vehicle Routing Problem (CVRP), where each vehicle is powered exclusively by electricity stored in its rechargeable battery. Consequently, each vehicle should visit not only customer nodes but also (possibly) some charging stations before the battery got depleted. The importance of this problem stems from the fact that logistics companies are increasingly relying on electric vehicles in urban distribution. We propose three exact approaches. The first one requires solving a compact polynomial-sized formulation. The second approach is a branch-and-cut algorithm. An original feature of this algorithm is that it embeds the first exact separation of the well-known rounded capacity constraints. Finally, the third approach is a hybrid algorithm that requires solving an augmented variant of the compact formulation. We report the results of a computational study that was carried out on a set of 125 instances, providing evidence that the polynomial-sized formulation can consistently solve instances having up to 30 customer nodes and 21 charging stations, and that the hybrid algorithm solves some instances having up to 100 customer nodes and 21 charging stations while requiring moderate CPU times. Furthermore, the proposed approach was shown to exhibit limitations in solving some large-scale tightly-constrained instances.



中文翻译:

路由带电容的电动汽车的精确方法

我们研究了标准容量限制车辆路线问题(CVRP)的一种变体,其中,每辆车仅由存储在其可充电电池中的电力供电。因此,在电池耗尽之前,每辆车不仅应拜访客户节点,而且还应拜访某些充电站。这个问题的重要性源于以下事实:物流公司在城市配送中越来越依赖电动汽车。我们提出了三种确切的方法。第一个要求求解紧凑的多项式大小的公式。第二种方法是分支剪切算法。该算法的原始功能在于它嵌入了众所周知的舍入容量约束的第一个精确分离。最后,第三种方法是一种混合算法,需要求解紧凑型公式的增强型变体。我们报告了对一组125个实例进行的计算研究的结果,提供了证据:多项式大小的公式可以一致地解决具有多达30个客户节点和21个充电站的实例,并且混合算法可以解决一些实例拥有多达100个客户节点和21个充电站,同时需要适度的CPU时间。此外,所提出的方法在解决一些大规模的严格约束实例方面显示出局限性。提供证据表明多项式大小的公式可以一致地解决具有多达30个客户节点和21个充电站的实例,并且混合算法解决了具有多达100个客户节点和21个充电站的某些实例,同时需要适度的CPU时间。此外,所提出的方法在解决一些大规模的严格约束实例方面显示出局限性。提供证据表明多项式大小的公式可以一致地解决具有多达30个客户节点和21个充电站的实例,并且混合算法解决了具有多达100个客户节点和21个充电站的某些实例,同时需要适度的CPU时间。此外,所提出的方法在解决一些大规模的严格约束实例方面显示出局限性。

更新日期:2020-11-16
down
wechat
bug