| 改进变邻域搜索算法求解动态车辆路径问题 |
| |
| 引用本文： | 王仁民,闭应洲,刘阿宁,李杰.改进变邻域搜索算法求解动态车辆路径问题[J].计算机工程与应用,2014(2):237-241. |
| |
| 作者姓名： | 王仁民 闭应洲 刘阿宁 李杰 |
| |
| 作者单位： | [1]广西师范学院计算机与信息工程学院,南宁530004 [2]武汉大学软件工程国家重点实验室,武汉430072 |
| |
| 基金项目： | 广西科技开发计划项目（No.桂科攻11107006.7）;广西教育厅重点资助项目（No.201102ZD020）;2012研究生教育创新计划项目（No.20121106030703M03）. |
| |
| 摘 要： | 针对动态车辆路径问题DVRP(Dynamic Vehicle Routing Problem)的优化问题,提出一种改进算法。该算法在分析路径寻优问题的局部特性的基础上,利用变邻域搜索算法VNS(Variable Neighbourhood Search)对路径空间进行"局部探索",结合变异机制对路径空间进行"全局开采",最后根据近邻优先原则将动态路径片段安插到适宜的路径中。实验结果验证了算法的有效性。
|
| 关 键 词： | 动态车辆路径问题 变邻域搜索算法 变异机制 近邻优先原则 |
Improved variable neighbourhood search algorithm for DVRP. |
| |
| WANG Renmin,BI Yingzhou,LIU Aning＇,LI Jie.Improved variable neighbourhood search algorithm for DVRP.[J].Computer Engineering and Applications,2014(2):237-241. |
| |
| Authors: | WANG Renmin BI Yingzhou LIU Aning＇ LI Jie |
| |
| Affiliation: | 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 |
| |
| 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. |
| |
| Keywords: | Dynamic Vehicle Routing Problem （DVRP） variable neighbourhood search heuristics mutation mecha-nism neighbor priority principle |
| 本文献已被 CNKI 维普 等数据库收录！ |
