首页 | 本学科首页   官方微博 | 高级检索  
     

一种求解多旅行商问题双层降解混合算法*
引用本文:林冬梅,王东,李娅b.一种求解多旅行商问题双层降解混合算法*[J].计算机应用研究,2011,28(8):2876-2879.
作者姓名:林冬梅  王东  李娅b
作者单位:1. 佛山科学技术学院 信息与教育技术中心,广东佛山,528000
2. 佛山科学技术学院 计算机科学与技术系,广东佛山,528000
基金项目:广东省自然科学基金资助项目(10152800001000029,10252800001000001)
摘    要:为了能快速近似求解多旅行商问题,提出了双层降解混合算法。首层降解根据问题空间展布特性,利用聚类技术将问题分解为若干子类问题,底层降解将子类问题转换为经典的旅行商问题,通过缩减子类问题初始状态下的边数量,使得子类问题求解难度得到再度降低,最终利用精确算法进行求解能够得到高质量优化解。对比实验表明双层降解混合算法具有计算时间短和求解质量高的优势,说明了新算法的有效性和高效性。

关 键 词:多旅行商问题    双层降解    混合算法    聚类    化简

Two-level degradation hybrid algorithm for multiple traveling salesman problem
LIN Dong-mei,WANG Dong,LI Yab.Two-level degradation hybrid algorithm for multiple traveling salesman problem[J].Application Research of Computers,2011,28(8):2876-2879.
Authors:LIN Dong-mei  WANG Dong  LI Yab
Affiliation:(a. Center of Information & Education Technology, b.Dept. of Computer Science & Technology, Foshan University, Foshan Guangdong 528000, China)
Abstract:This paper put forward a new two-level degradation hybrid algorithm for quickly solving the multiple traveling salesman problems. Top-level degradation divided the original problem into some sub-class problems according to the distribution property of the problem space. Low-level degradation converted these sub-class problems to some corresponding classical traveling salesman problems. The difficulty solving these sub-class problems would be cut down while decreasing the initial edge number of these problems. Finally, could solve high-quality solutions by exact algorithm. The contrast experiments with the same type algorithms show that the computation time of the new algorithm is shorter and the solving quality of the new algorithm is higher. This shows that the new algorithm is effective and efficient.
Keywords:multiple traveling salesman  two-level degradation  hybrid algorithm  clustering  simplification
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号