计算机应用研究Issue(1)：98-100,3.DOI:10.3969/j.issn.1001-3695.2016.01.022
基于图染色问题的混合优化算法
Hybrid optimization algorithm based on graph coloring problem
摘要
Abstract
This paper developed a new graph coloring algorithm-a hybrid optimization algorithm(GA-HM),based on the ad-vantages and disadvantages of tabu search algorithm and genetic algorithm.It could improve search ability and convergence speed of a graph coloring algorithm.GA-HMused genetic algorithm to generate better initial solution which assigned the dyeing elements into different color classes at first,then performed alternately search by tabu algorithm for updating the dyeing.Ex-perimental results show that this algorithm has better global optimality and convergence.关键词
组合优化/图染色/禁忌搜索算法/遗传算法/变领域搜索/色集Key words
combinatorial optimization/graph coloring/tabu search algorithm/genetic algorithm/variable neighborhood search/color classes分类
信息技术与安全科学引用本文复制引用
李淑芝,何署芳..基于图染色问题的混合优化算法[J].计算机应用研究,2016,(1):98-100,3.基金项目
江西省教育厅科技项目 （）
