CAJ | 학술논문

针对传统单一启发式方法解决VRP（Vehicle Routing Problem）问题解质量不高的问题,提出一种新的混合算法。该混合算法以随机近邻启发算法作为初始解,结合嵌入＂退火机制＂的变邻域VNS（Variable Neighbour Search）搜索算法解决车辆路径问题。实验结果表明,改进算法收敛速度较快,且解决了变邻域搜索易陷入局部最优的问题。
침대전통단일계발식방법해결VRP（Vehicle Routing Problem）문제해질량불고적문제,제출일충신적혼합산법。해혼합산법이수궤근린계발산법작위초시해,결합감입＂퇴화궤제＂적변린역VNS（Variable Neighbour Search）수색산법해결차량로경문제。실험결과표명,개진산법수렴속도교쾌,차해결료변린역수색역함입국부최우적문제。
When VRP （vehicle routing problem） is solved with the traditional single method, the qual- ity 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- -An- nealing algorithm. Experimental results show that the hybrid algorithm can solve the VRP effectively and efficiently.