车辆路径问题研究进展
Research Progress of Vehicle Routing Problem
查看参考文献67篇
|
文摘
|
车辆路径作为经典的组合优化问题一直是研究的热点与难点,无论是在应急管理工作还是物流配送中,对它的合理规划都至关重要.为了今后更好地开展相关工作,本文回顾了精确算法、启发式算法和机器学习算法在车辆路径优化问题中的研究进展,并基于Solomon标准数据集对六种经典算法的求解性能进行了比较分析;分别从局部最优和收敛速度间的平衡关系、个体评价函数、动态车辆路径问题以及机器学习算法在车辆路径问题中的应用等四个方面对其发展趋势进行了展望. |
|
其他语种文摘
|
As a classical combinatorial optimization problem, vehicle routing has always been a hot and difficult research topic. It is very important to make reasonable planning for it in both emergency management and logistics distribution. In order to better carry out related work in the future, this paper reviewed the research progress of exact algorithm, heuristic algorithm, and machine learning algorithm in vehicle routing optimization problem. Then the comparisons of the performance of six classical algorithms were conducted based on Solomon standard data set. The development trend was prospected from the aspects of balance relationship between the local optimum and the convergence speed, individual evaluation function, dynamic vehicle routing problem, and the application of machine learning algorithms in the vehicle routing problem. |
|
来源
|
电子学报
,2022,50(2):480-492 【核心库】
|
|
DOI
|
10.12263/DZXB.20201154
|
|
关键词
|
车辆路径优化
;
启发式算法
;
精确算法
;
机器学习
|
|
地址
|
1.
河南工业大学, 粮食信息处理与控制教育部重点实验室, 河南, 郑州, 450001
2.
河南工业大学信息科学与工程学院, 河南, 郑州, 450001
|
|
语种
|
中文 |
|
文献类型
|
综述型 |
|
ISSN
|
0372-2112 |
|
学科
|
自动化技术、计算机技术 |
|
基金
|
河南省自然科学基金
|
|
文献收藏号
|
CSCD:7195161
|
参考文献 共
67
共4页
|
|
1.
Dantzig G B. The truck dispatching problem.
Management Science,1959,6(1):80-91
|
CSCD被引
342
次
|
|
|
|
|
2.
Dorling K. Vehicle routing problems for drone delivery.
IEEE Transactions on Systems, Man, and Cybernetics: Systems,2017,47(1):70-85
|
CSCD被引
35
次
|
|
|
|
|
3.
戚远航. 带时间窗的车辆路径问题的离散蝙蝠算法.
电子学报,2018,46(3):672-679
|
CSCD被引
13
次
|
|
|
|
|
4.
Lau H C W. Application of genetic algorithms to solve the multidepot vehicle routing problem.
IEEE Transactions on Automation Science & Engineering,2010,7(2):383-392
|
CSCD被引
9
次
|
|
|
|
|
5.
易云飞. 求解带用户满意度的多目标实时车辆路径问题的改进伊藤算法.
电子学报,2015,43(10):2053-2061
|
CSCD被引
12
次
|
|
|
|
|
6.
Kim G. Solving the dynamic vehicle routing problem under traffic congestion.
IEEE Transactions on Intelligent Transportation Systems,2016,17(8):2367-2380
|
CSCD被引
8
次
|
|
|
|
|
7.
王江晴. 求解动态最优路径的混合优化算法.
通信学报,2008,29(7):135-140
|
CSCD被引
2
次
|
|
|
|
|
8.
涂伟. 一种大规模车辆路径问题的启发式算法.
武汉大学学报(信息科学版),2013,38(3):307-310,338
|
CSCD被引
7
次
|
|
|
|
|
9.
黄戈文. 自适应遗传灰狼优化算法求解带容量约束的车辆路径问题.
电子学报,2019,47(12):2602-2610
|
CSCD被引
13
次
|
|
|
|
|
10.
Lawler E L. Branch-and-bound methods: A survey.
Operations Research,1966,14(4):699-719
|
CSCD被引
27
次
|
|
|
|
|
11.
Pecin D. New enhancements for the exact solution of the vehicle routing problem with time windows.
Informs Journal on Computing,2017,29(3):489-502
|
CSCD被引
2
次
|
|
|
|
|
12.
Ceselli A. Vehicle routing problems with different service constraints: A branch-andcut-and-price algorithm.
Networks,2014,64(4):282-291
|
CSCD被引
2
次
|
|
|
|
|
13.
Santos F A. A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem.
Transportation Science,2013,49(2):355-368
|
CSCD被引
4
次
|
|
|
|
|
14.
Dantzig G B. Decomposition principle for linear programs.
Operations Research,1960,8(1):101-111
|
CSCD被引
31
次
|
|
|
|
|
15.
Chabrier A. Vehicle routing problem with elementary shortest path based column generation.
Computers & Operations Research,2006,33(10):2972-2990
|
CSCD被引
5
次
|
|
|
|
|
16.
Hernandez F. Branch-and-price algorithms for the solution of the multitrip vehicle routing problem with time windows.
European Journal of Operational Research,2016,249(2):551-559
|
CSCD被引
6
次
|
|
|
|
|
17.
Pecin D. Improved branch-cut-and-price for capacitated vehicle routing.
Integer Programming and Combinatorial Optimization,2014:393-403
|
CSCD被引
1
次
|
|
|
|
|
18.
Fukasawa R. Robust branch-and-but-and-price for the capacitated vehicle routing problem.
Math-ematical Programming,2006,106(3):491-511
|
CSCD被引
9
次
|
|
|
|
|
19.
Bellman R. Dynamic programming.
Science,1966,153(3731):34-37
|
CSCD被引
60
次
|
|
|
|
|
20.
Soysal M. A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem.
Computers & Operations Research,2017,88(12):297-305
|
CSCD被引
5
次
|
|
|
|
|
了解气象卫星更多信息，请访问