Title :
Hybrid Niche Genetic Algorithm for Set Covering Problem
Author :
Zheng, You-Lian ; Lei, De-Ming
Author_Institution :
Hubei Univ, Wuhan
Abstract :
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.
Keywords :
combinatorial mathematics; genetic algorithms; matrix algebra; combinatorial optimization problem; hybrid niche genetic algorithm; search space compression; set covering problem; Algorithm design and analysis; Computer science; Cybernetics; Genetic algorithms; Job shop scheduling; Lagrangian functions; Machine learning; Mathematics; Organisms; Space technology; Genetic algorithm; Niche; Non-binary encoding; Set covering problem;
Conference_Titel :
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-0973-0
Electronic_ISBN :
978-1-4244-0973-0
DOI :
10.1109/ICMLC.2007.4370290
