%0 Journal Article
%T Optimization Combination Genetic Algorithm for Graph Coloring Problem
一种求解图着色问题的优化组合遗传算法①
%A SHUAI Xun-Bo
%A YANG Shui-Fa
%A ZHOU Zhao-Hua
%A WANG Jian-Zhong
%A
帅训波
%A 杨遂发
%A 周兆华
%A 王建忠
%J 计算机系统应用
%D 2010
%I
%X Graph coloring is a NP-Complete problem. In this paper, based on the research result of Matrix genetic operator, inverse and dual combination operator, an optimization combination genetic algorithm is constructed through the inverse and dual combination genetic operator combined with matrix genetic operator to solve Graph Coloring problem. A transform coding between integer and binary is introduced to make good use of the combination operators. Fitness function based on constraint of Graph Coloring problem is designed, and the convergence of algorithm is proved. Better efficiency of the optimization combination genetic algorithm for solving Graph Coloring problem is verified compared with current genetic algorithm.
%K graph coloring
%K genetic algorithm
%K inverse and dual combination operator
%K matrix genetic operator
图着色
%K 遗传算法
%K 逆序与对偶组合算子
%K 矩阵遗传算子
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=0ABB53AF992B4A06D35796071E9969F2&yid=140ECF96957D60B2&vid=2A8D03AD8076A2E3&iid=5D311CA918CA9A03&sid=67969BA850333433&eid=E44E40A2398D4F2A&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=11