| 1,749 | 83 | 812 |
| 下载次数 | 被引频次 | 阅读次数 |
为了解决电动汽车使用过程中行驶里程短、充电难的问题,本文构建了带有时间窗、资源约束且允许部分充电的混合整数规划模型。考虑不同车型载重量、固定成本、可变成本、续航里程和充电速率的异质性,模型以多车型配送的单位里程可变成本和车辆使用的固定成本加和为目标函数,设计局部搜索增强的自适应大规模邻域搜索算法进行求解,算法中引入了充电站位置优化方法,通过摧毁算子和重建算子构建配送路径搜索解空间,并使用多种路径内和路径间优化算子进一步寻优。在多组不同规模算例上验证了算法的有效性和收敛性。数值实验结果表明,部分充电策略相较于完全充电策略在顾客规模为50时平均节约成本11.05%,节约成本随算例规模的增加而增加。但是部分充电策略算法收敛速度慢于完全充电策略。在满足约束的情况下,部分充电策略通过延长电动汽车的行驶距离,减少电动汽车使用的数量,可以有效的降低配送成本,在合理的时间内得到较好的求解方案。本研究可为物流企业推广纯电动物流车的实际工作提供指导。
Abstract:In order to deal with the problem of limited battery capacity,we establish a mixed integer programming model considering partial charging strategy(PCS) with time window and resource constrains. It aims to minimize the fixed and variable costs caused by heterogeneous vehicles. The load capacity,fixed cost,variable cost,battery capacity,and charging rate vary for different types of vehicles. Adaptive large neighborhood search algorithm with an enhanced local search(ALNS-LS) is designed to solve the problem. Power station optimization,multiple intra-route and inter-route operators are applied to facilitate the process. Numerical experiments with different scales are conducted to verify the model and examine the effectiveness of the PCS. The results show that,compared with the full charging strategy(FCS),the averages cost of PCS is 11.05% lower than FCS for 50 customers. In addition,the higher the number of customers,the better the PCS performance. However,the FCS is more efficient than the PCS. The PCS is able to decrease the charging time and can achieve the optimal electric vehicle routing solution within reasonable time. Our study attempts to provide operational level strategies for logistics companies.
[1]徐君翔,郭静妮.基于大数据平台下的物流配送车辆路径问题研究[J].交通运输系统工程与信息,2018,18(S1):86-93.
[2]牟能冶,贾程方,康秋萍,等.基于蚁群算法的共享快递盒配送回收网络优化研究[J].交通运输工程与信息学报,2021,19(1):33-42.
[3]赵红霞,刘高森,李愈.基于随机游走的分类垃圾回收最优路径规划[J].交通运输工程与信息学报,2018,16(3):103-108.
[4] SCHNEIDER M,STENGER A,GOEKE D. The electric vehicle-routing problem with time windows and recharging stations[J]. Transportation Science,2014,48(4):500-520.
[5] DESAULNIERS G,ERRICO F,IRNICH S,et al. Exact algorithms for electric vehicle—routing problems with time windows[J]. Operations Research,2016,64(6):1388-1405.
[6] MACRINA G,LAPORTE G,GUERRIERO F,et al. An energy-efficient green-vehicle routing problem with mixed vehicle fleet,partial battery recharging and time windows[J]. European Journal of Operational Research,2019,276(3):971-982.
[7] PENNA P H V,AFSAR H M,PRINS C,et al. A hybrid iterative local search algorithm for the electric fleet size and mix vehicle routing problem with time windows and recharging stations[J]. IfacPapersonline,2016,49(12):955-960.
[8] MONTOYA A,GUERET C,MENDOZA J E,et al. The electric vehicle routing problem with nonlinear charging function[J]. Transportation Research Part B:Methodological,2017,103:87-110.
[9]杨珺,冯鹏祥,孙昊,等.电动汽车物流配送系统的换电站选址与路径优化问题研究[J].中国管理科学,2015,23(9):87-96.
[10]揭婉晨,杨玵,杨超.多车型电动汽车车辆路径问题的分支定价算法研究[J]系统工程理论与实践2016,36(7):1795-1805.
[11]何东东,李引珍.多车型绿色车辆路径问题优化研究[J].计算机应用2018,38(12):3618-3624,3637
[12]郭放,杨珺,杨超.考虑差异化服务时间的多车型电动汽车路径优化与充电策略研究[J].中国管理科学,2019,27(8):118-128.
[13]杨森炎,宁连举,商攀.基于时空状态网络的电动汽车辆路径优化方法[J].交通运输系统工程与信息,2021,21(2):196-204.
[14] ROPKE S,PISINGER D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows[J]. Transportation Science,2006,40(4):455-472.
[15] SOLOMON M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J].operations research,1987,35(2):254-265.
基本信息:
DOI:10.19961/j.cnki.1672-4747.2021.08.010
中图分类号:U492.22
引用信息:
[1]程坦,陈鹏,张国伟,等.部分充电策略下的多车型电动汽车车辆路径优化问题研究[J],2022,20(02):105-114.DOI:10.19961/j.cnki.1672-4747.2021.08.010.
基金信息:
国家自然科学基金项目(71971154)