首页 | 官方网站   微博 | 高级检索  
     

基于混合优化算法的最大独立集问题求解
引用本文:彭震宇,葛洪伟.基于混合优化算法的最大独立集问题求解[J].计算机应用,2007,27(5):1194-1196.
作者姓名:彭震宇  葛洪伟
作者单位:江南大学,信息工程学院,江苏,无锡,214122
摘    要:蚁群优化算法(ACO)的正反馈机制使其具有强大的局部搜索性能,但其全局优化性的优劣在很大程度上与挥发系数的选择有关,如选择得不合适则易将使算法陷入局部最优,而禁忌搜索算法(TS)则具有强大的全局优化性能。为了弥补单一ACO算法的局限性,将ACO算法与TS算法组合起来,提出了基于TS和ACO算法的混合优化算法HTSACO,并将该混合优化算法用于求解最大独立集问题。实验表明:与标准蚁群优化算法相比,该算法显示出了很高的全局优化性和计算效率。

关 键 词:最大独立集  蚁群优化算法  禁忌搜索算法
文章编号:1001-9081(2007)05-1194-03
收稿时间:2006-11-14
修稿时间:2006-11-14

Hybrid optimization algorithm for solving maximum independent set problems
PENG Zhen-yu,GE Hong-wei.Hybrid optimization algorithm for solving maximum independent set problems[J].journal of Computer Applications,2007,27(5):1194-1196.
Authors:PENG Zhen-yu  GE Hong-wei
Affiliation:College of Information Engineering, Southern Yangtze University, Wuxi Jiangsu, 214122, China
Abstract:Ant Colony Optimization(ACO) behaves well in finding local optimum,whereas its global search depends on selection of the evaporation coefficient.An unsuitable evaporation coefficient may result in local optimum of final solution.Tabu Search(TS) behaves well in finding global optimum of combined optimization problems.To compensate for the limitations of the single algorithms,the authors integrated the two algorithms together and put forward Tabu Search and Ant Colony Optimization based Hybrid Optimization Algorithm HTSACO to solve maximum independent set.As compared with the standard ant colony optimization,the proposed algorithm demonstrates quite high global optimization capability and computing efficiency.
Keywords:maximum independent set  Ant Colony Optimization(ACO)  Tabu Search(TS)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号