首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A Genetic Algorithm for the Set Covering Problem
Authors:K S Al-Sultan  M F Hussain  J S Nizami
Institution:1.Systems Engineering Department,;2.Data Processing Center,;3.Mechanical Engineering Department,King Fahd University of Petroleum and Minerals,
Abstract:In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on the genetic technique. This algorithm has been implemented and tested on various standard and randomly generated test problems. Preliminary results are encouraging, and are better than the existing heuristics for the problem.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号