%0 Journal Article
%T Hybrid optimization algorithm for solving maximum independent set problems<br>基于混合优化算法的最大独立集问题求解
%A PENG Zhen-yu
%A GE Hong-wei
%A <br>彭震宇
%A 葛洪伟
%J 计算机应用
%D 2007
%I 
%X 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.
%K maximum independent set
%K Ant Colony Optimization(ACO)
%K Tabu Search(TS)<br>最大独立集
%K 蚁群优化算法
%K 禁忌搜索算法
%K 混合
%K 蚁群优化算法
%K 最大独立集问题
%K 问题求解
%K problems
%K independent
%K set
%K maximum
%K optimization
%K algorithm
%K 计算效率
%K 显示
%K 标准
%K 实验
%K 算法组合
%K 优化性能
%K 禁忌搜索算法
%K 最优
%K 的选择
%K 挥发系数
%K 程度
%K 全局优化性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=D4E24360344F32D52F6A610C7264BFA2&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=94C357A881DFC066&sid=1805714CB338690A&eid=D7FC8AF637611368&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=7