改进变邻域搜索算法求解动态车辆路径问题

计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (2): 237-241.

改进变邻域搜索算法求解动态车辆路径问题

王仁民1，闭应洲1，2，刘阿宁1，李杰1

1.广西师范学院计算机与信息工程学院，南宁 530004
2.武汉大学软件工程国家重点实验室，武汉 430072

出版日期:2014-01-15 发布日期:2014-01-26

Improved variable neighbourhood search algorithm for DVRP

WANG Renmin1, BI Yingzhou1，2, LIU Aning1, LI Jie1

1.College of Computer and Information Engineering, Guangxi Teachers Education University, Nanning 530004, China
2.State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China

Online:2014-01-15 Published:2014-01-26

摘要/Abstract

摘要： 针对动态车辆路径问题DVRP（Dynamic Vehicle Routing Problem）的优化问题，提出一种改进算法。该算法在分析路径寻优问题的局部特性的基础上，利用变邻域搜索算法VNS（Variable Neighbourhood Search）对路径空间进行“局部探索”，结合变异机制对路径空间进行“全局开采”，最后根据近邻优先原则将动态路径片段安插到适宜的路径中。实验结果验证了算法的有效性。

关键词: 动态车辆路径问题, 变邻域搜索算法, 变异机制, 近邻优先原则

Abstract: Due to the optimization problem of dynamic vehicle routing problem, an improved algorithm for DVRP（Dynamic Vehicle Routing Problem） is proposed. Based on analyzing local features of routing optimization problem, the method uses variable neighbourhood search heuristics to explore, and combines mutation mechanism to exploit. The dynamic routing blocks are inserted into vehicles according to neighbor priority principle. Experimental results show that the improved algorithm is effective.

Key words: Dynamic Vehicle Routing Problem（DVRP）, variable neighbourhood search heuristics, mutation mechanism, neighbor priority principle

王仁民1，闭应洲1，2，刘阿宁1，李杰1. 改进变邻域搜索算法求解动态车辆路径问题[J]. 计算机工程与应用, 2014, 50(2): 237-241.

WANG Renmin1, BI Yingzhou1，2, LIU Aning1, LI Jie1. Improved variable neighbourhood search algorithm for DVRP[J]. Computer Engineering and Applications, 2014, 50(2): 237-241.

[1]	葛显龙，薛桂琴. 前摄性车辆路径问题及其遗传算法求解[J]. 计算机工程与应用, 2019, 55(12): 237-244.
[2]	马萍1，2，刘思含3，孙根云1，2，张爱竹1，2，郝艳玲1，2. 基于邻域引力学习的生物地理学优化算法[J]. 计算机工程与应用, 2018, 54(22): 35-41.
[3]	陈晶，潘全科. 改进蚁群算法求解同型机任务调度问题[J]. 计算机工程与应用, 2011, 47(6): 44-48.
[4]	管月智，葛洪伟. 一种新的混合粒子群方法[J]. 计算机工程与应用, 2011, 47(23): 45-47.
[5]	石锦风,冯斌,孙俊. 用带变异因子的QPSO算法解决Job-Shop调度问题[J]. 计算机工程与应用, 2008, 44(8): 49-52.