Fast dynamic programming algorithm for the large scale VCVRP problem

被引：0
|
作者：
Zhang P. [1 ]
Xiao K. [2 ]
Fu C. [1 ]
Yang K. [1 ]
机构：
[1] Department of Management Science and Engineering, College of Information System and Management, National University of Defense Technology, Changsha
[2] The Key Laboratory of C4ISR Technology, College of Information System and Management, National University of Defense Technology, Changsha
来源：
| 1600年 / Systems Engineering Society of China卷 / 36期
基金：
中国国家自然科学基金;
关键词：
Combinatorial optimization; Dynamic programming; Fast algorithm; Inspire algorithm; VCVRP problem; Vehicle routing problem;
D O I：
10.12011/1000-6788(2016)03-0694-12
中图分类号：
学科分类号：
摘要：
Vehicle routing problem (VRP) is a kind of typical combination optimization problems. Most of the researches focus on VRP with fixed transportation capacity; however, the capacity of vehicles is varied with the cargo shape and customer requirement. Therefore, we propose a varied capacitated vehicle routing problem (VCVRP) to deal with the practical problems. In this paper, a fast dynamic programming algorithm is proposed for large-scale VCVRP. And it is based on the traditional best fit decreasing (BFD) algorithm and minimum spanning tree (MST) algorithm. A K-backtracking strategy and a principle of short-priority are introduced to the dynamic programming algorithm. In this fast algorithm, the bin packing problem and routing problem are decoupled approximately. Analysis of the upper bound of objective total distance is given theoretically. Finally, experimental results of practical logistics of passenger vehicles are discussed to illustrate the quality and efficiency of the proposed algorithm. © 2016, Editorial Board of Journal of Systems Engineering Society of China. All right reserved.
引用
收藏
页码：694 / 705
页数：11
相关论文
共 17 条
  • [1] Laporte G., Fifty years of vehicle routing, Transport Science, 43, 4, pp. 408-416, (2009)
  • [2] Potvin J.Y., State-of-the art review-evolutionary algorithms for vehicle routing, INFORMS Journal on Computing, 21, 4, pp. 518-548, (2009)
  • [3] Solomon M.M., Algorithms for the vehicle routing and scheduling problem with time windows constraints, Operations Research, 35, 2, pp. 254-265, (1987)
  • [4] Labbe M., Laporte G., Mercure H., Capacitated vehicle routing problems on trees, Operations Research, 39, 4, pp. 616-622, (1991)
  • [5] Gendreau M., Hert Z.A., Laporte G., A tabu search heuristic for the vehicle routing problem, Management Science, 40, 10, pp. 1276-1289, (1994)
  • [6] Fu Z., The capacitated open vehicle routing problem and its tabu search algorithm, Systems Engineering - Theory & Practice, 24, 3, pp. 123-128, (2004)
  • [7] Zhang J., Tang J.F., Pan Z.D., Et al., Scatter search algorithm for solving weighted vehicle routing problem, Journal of Systems Engineering, 25, 1, pp. 91-97, (2010)
  • [8] Zhang Y., Zhou Z.L., Zhai B., Multi-attribute label matching algorithm for vehicle routing problems with time wndows and backhauls, Operations Research & Management Science, 16, 3, pp. 12-19, (2007)
  • [9] Yao F., Xing L.N., Li J.F., Et al., Knowledge-based genetic algorithm to the double layer capacitated arc routing problems, Systems Engineering - Theory & Practice, 34, 1, pp. 237-247, (2014)
  • [10] Zhang J.Y., Zhang J., A hybrid genetic algorithm to the vehicle routing problem with fuzzy traveling time, Journal of Industrial Engineering & Engineering Management, 20, 4, pp. 13-17, (2006)
12