大学计算机应用答案陆建波,改进变邻域搜索算法求解动态车辆路径问题-计算机工程与应用.pdf...-CSDN博客

改进变邻域搜索算法求解动态车辆路径问题-计算机工程与应用

Computer Engineering and Applications 计算机工程与应用 2014 ，50(2 ) 237

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

1 1，2 1 1

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

1 1，2 1 1

WANG Renmin , BI Yingzhou , LIU Aning , LI Jie

1.广西师范学院计算机与信息工程学院，南宁 530004

2.武汉大学软件工程国家重点实验室，武汉 430072

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

WANG Renmin, BI Yingzhou, LIU Aning, et al. Improved variable neighbourhood search algorithm for DVRP.

Computer Engineering and Applications, 2014, 50 (2 )：237-241.

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 mecha-

nism; neighbor priority principle

摘要：针对动态车辆路径问题DVRP (Dynamic Vehicle Routing Problem )的优化问题，提出一种改进算法。该算

法在分析路径寻优问题的局部特性的基础上，利用变邻域搜索算法VNS (Variable Neighbourhood Search )对路径空

间进行“局部探索”，结合变异机制对路径空间进行“全局开采”，最后根据近邻优先原则将动态路径片段安插到适宜

的路径中。实验结果验证了算法的有效性。

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

文献标志码：A 中图分类号：TP301.6 doi ：10.3778/j.issn. 1002-8331.1203-0055

1 引言部“探索”(exploration )和全局“开采”(exploitation )两个

动态车辆路径问题是指，客户需求不是预先知道，阶段，几乎所有的启发式算法都是在