基于分支定价算法的电动车与燃油车混合车辆路径问题研究
A branch-and-price algorithm for electric vehicle routing problem with time windows and mixed fleet
查看参考文献25篇
|
文摘
|
随着电动物流车的日渐普及,越来越多物流企业的配送业务由传统燃油车和电动物流车共同完成.针对燃油车与电动车混用的情形,综合考虑两者在最大载重、最大行驶里程、运营成本的差异,以及电动车的充电行为,研究了带时间窗的电动车与燃油车混合车辆路径问题.构建了该问题的整数规划模型,并基于Dantzig-Wolfe分解原理将所建模型重构为主问题和子问题模型.就问题较小规模和较大规模两种情形分别设计了能快速获得初始解的启发式规则和遗传算法.以此为基础,设计分支定价算法获取最优解,并通过与CPLEX的对比,验证模型和算法的正确性.最后,就车型配比、载重、电池容量、充电率等因素对配送系统总成本的影响进行了灵敏度分析,并提出了相应的管理建议. |
|
其他语种文摘
|
As electric vehicles are becoming increasingly popular,more and more logistics companies deliver products by both conventional fuel vehicles and electric vehicles.Based on the difference between maximum capacity,maximum travel distance and operating cost of conventional vehicles and electric vehicles,and the charging behavior of electric vehicles,electric vehicle routing problem with time window and mixed fleet is examined.An integer programming model is presented and it is decomposed into the main problem and the sub-problem based on the Dantzig-Wolfe decomposition principle.A heuristic rule and genetic algorithm are proposed to generate the initial solution quickly for both small-scale instances and large-scale instances respectively.The branch and price algorithm is developed to obtain the optimal solution.The performances of proposed model and algorithm are validated by comparison with CPLEX.Finally,sensitivity analyses of the influence of number of electric vehicle,vehicle capacity,battery capacity,charging rate on the total cost are performed,and managerial insights are obtained. |
|
来源
|
系统工程理论与实践
,2021,41(4):995-1009 【核心库】
|
|
DOI
|
10.12011/SETP2019-1371
|
|
关键词
|
电动车车辆路径问题
;
混合车队
;
分支定价
;
动态规划
;
遗传算法
|
|
地址
|
西南交通大学经济管理学院, 成都, 610031
|
|
语种
|
中文 |
|
文献类型
|
研究性论文 |
|
ISSN
|
1000-6788 |
|
学科
|
综合运输 |
|
基金
|
国家重点研发计划
;
国家自然科学基金
|
|
文献收藏号
|
CSCD:6950517
|
参考文献 共
25
共2页
|
|
1.
国务院. 物流业发展中长期规划(2014-2020年).
综合运输,2014(10):33-40
|
CSCD被引
2
次
|
|
|
|
|
2.
交通运输部. 交通运输部关于加快推进新能源汽车在交通运输行业推广应用的实施意见.
中国道路运输,2015(4):33-35
|
CSCD被引
1
次
|
|
|
|
|
3.
Erdogan S. A green vehicle routing problem.
Transportation Research Part E,2011,48(1):100-114
|
CSCD被引
3
次
|
|
|
|
|
4.
Montoya A. A multi-space sampling heuristic for the green vehicle routing problem.
Transportation Research Part C: Emerging Technologies,2016,70:113-128
|
CSCD被引
1
次
|
|
|
|
|
5.
Conrad R G. The recharging vehicle routing problem.
Proceedings of the 2011 Industrial Engineering Research Conference,2011:1-8
|
CSCD被引
3
次
|
|
|
|
|
6.
Schneider M. The electric vehicle-routing problem with time windows and recharging stations.
Transportation Science,2014,48(4):500-520
|
CSCD被引
64
次
|
|
|
|
|
7.
Desaulniers G. Exact algorithms for electric vehicle-routing problems with time windows.
Operations Research,2016,64(6):1388-1405
|
CSCD被引
23
次
|
|
|
|
|
8.
Golden B. The fleet size and mix vehicle routing problem.
Computers & Operations Research,1984,11(1):49-66
|
CSCD被引
14
次
|
|
|
|
|
9.
Hiermann G. The electric fleet size and mix vehicle routing problem with time windows and recharging stations.
European Journal of Operational Research,2016,252(3):995-1018
|
CSCD被引
36
次
|
|
|
|
|
10.
揭婉晨. 多车型电动汽车车辆路径问题的分支定价算法研究.
系统工程理论与实践,2016,36(7):1795-1805
|
CSCD被引
28
次
|
|
|
|
|
11.
Goeke D. Routing a mixed fleet of electric and conventional vehicles.
European Journal of Operational Research,2015,245(1):81-99
|
CSCD被引
28
次
|
|
|
|
|
12.
Sassi O. Iterated tabu search for the mix fleet vehicle routing problem with heterogenous electric vehicles.
Modelling, Computation and Optimization in Information Systems and Management Sciences,2015:57-68
|
CSCD被引
2
次
|
|
|
|
|
13.
Sassi O. Multi-start iterated local search for the mixed fleet vehicle routing problem with heterogenous electric vehicles.
European Conference on Evolutionary Computation in Combinatorial Optimization,2015:138-149
|
CSCD被引
1
次
|
|
|
|
|
14.
Philippe L. Conventional, hybrid, or electric vehicles: Which technology for an urban distribution centre?.
The Scientific World Journal,2015,2015:1-11
|
CSCD被引
3
次
|
|
|
|
|
15.
Dantzig G B. Decomposition principle for linear programs.
Operations Research,1960,8(1):101-111
|
CSCD被引
31
次
|
|
|
|
|
16.
Barnhart C. Branch-and-price: Column generation for solving huge integer programs.
Operations Research,1998,46(3):316-329
|
CSCD被引
34
次
|
|
|
|
|
17.
Desrosiers J. Routing with time windows by column generation.
Networks,1984,14(4):545-565
|
CSCD被引
7
次
|
|
|
|
|
18.
Gilmore P C. A linear programming approach to the cutting-stock problem.
Operations Research,1961,9(6):849-859
|
CSCD被引
25
次
|
|
|
|
|
19.
Desaulniers G.
Column generation,2005
|
CSCD被引
7
次
|
|
|
|
|
20.
王沛.
基于分支定价的多星多站集成调度方法研究,2011
|
CSCD被引
3
次
|
|
|
|
|
了解气象卫星更多信息，请访问