Hybrid niche genetic algorithm for set covering problem

被引：0
|
作者：
Zheng, You-Lian [1 ]
Lei, De-Ming [2 ]
机构：
[1] Hubei Univ, Sch Math & Comp Sci, Hubei, Peoples R China
[2] Wuhan Univ Technol, Sch Automat, Wuhan, Peoples R China
来源：
PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2007年
关键词：
set covering problem; non-binary encoding; niche genetic algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：1009 / +
页数：2
相关论文
共 50 条
12345