HYBRID NICHE GENETIC ALGORITHM FOR SET COVERING PROBLEM

摘要：

Set covering problem (SCP) is a well-know combinatorial optimization problem.This paper presents a hybrid niche genetic algorithm to solve set covering problem.The various genetic representation strategies of SCP are analyzed and an effective non-binary representation method is proposed.The method of search space compression is then presented and the hybrid niche genetic algorithm is designed.Finally, the hybrid algorithm is tested by using some SCP instances and the computational results demonstrate the good performance of hybrid genetic algorithm on SCP.

关键词： Set covering problem Non-binary encoding Niche Genetic algorithm

作者: YOU-LIAN ZHENG DE-MING LEI

作者单位: School of Mathematic and Computer Science, Hubei University School of Automation, Wuhan University of Technology

会议类型: 国际会议

会议名称: 2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

会议地点: 香港

会议语种:英文

页码: 1009-1013

在线出版日期: 2007-08-19（万方平台首次上网日期，不代表论文的发表时间）