A Modified Genetic Algorithm for Maximum Independent Set Problems

被引：0
|
作者：
刘兴钊
坂本明雄
岛本隆
机构：
来源：
Journal of Harbin Institute of Technology(New series) | 1999年 / 02期
关键词：
Cenetic algorithm; maximum independent set problem; maximum clique problem; heuristic algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
genetic algorithm is proposed for maximum independent set problems. A specially designed mutation operato is adopted to search the solution space more efficienily, where adjacen relation of a graph is inte-grated. The DIMACS benchmark graphs are used to test our algorithm, and the results show that the algorithm outper-forms our previous version. Moreover two new low bounds are found for graphs in DIMACS.
引用
收藏
页码：5 / 10
页数：6
相关论文
共 50 条
12345