| 变邻域退火算法在CVRPTW中的研究 |
| |
| 引用本文： | 王仁民,闭应洲,刘阿宁,李杰.变邻域退火算法在CVRPTW中的研究[J].广西师范学院学报(自然科学版),2012,29(2):88-93. |
| |
| 作者姓名： | 王仁民 闭应洲 刘阿宁 李杰 |
| |
| 作者单位： | 1. 广西师范学院计算机与信息工程学院,广西南宁,530004
2. 广西师范学院计算机与信息工程学院,广西南宁530004／武汉大学软件工程国家重点实验室,武汉430072 |
| |
| 摘 要： | 针对传统单一启发式方法解决VRP（Vehicle Routing Problem）问题解质量不高的问题,提出一种新的混合算法。该混合算法以随机近邻启发算法作为初始解,结合嵌入＂退火机制＂的变邻域VNS（Variable Neighbour Search）搜索算法解决车辆路径问题。实验结果表明,改进算法收敛速度较快,且解决了变邻域搜索易陷入局部最优的问题。
|
| 关 键 词： | 车辆路径问题 近邻启发式算法 退火机制 变邻域搜索算法 |
VNS- annealing Algorithm for CVRPTW |
| |
| WANG Ren-min,BI Ying-zhou,LIU A-ning,LI Jie.VNS- annealing Algorithm for CVRPTW[J].Journal of Guangxi Teachers Education University:Natural Science Edition,2012,29(2):88-93. |
| |
| Authors: | WANG Ren-min BI Ying-zhou LIU A-ning LI Jie |
| |
| Institution: | 1(1.College of Computer&Information Engineer,Guangxi Teachers Education University,Nanning 530004,China;2.State Key laboratoty of Software Engineering,Wuhan University,Wuhan 430072,China) |
| |
| Abstract: | When VRP(vehicle routing problem) is solved with the traditional single method,the quality of the results is usually low,so this paper presents a novel hybrid-heuristic algorithm.Firstly,the initial solution is generated with the nearest neighbor heuristic algorithm,then it is improved with VNS——Annealing algorithm.Experimental results show that the hybrid algorithm can solve the VRP effectively and efficiently. |
| |
| Keywords: | vehicle routing problem nearest neighbour heuristic annealing machanism variableneighbour search |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
