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 条
  • [21] Binary Firefly Algorithm for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olivares Suarez, Miguel
    Paredes, Fernando
    Johnson, Franklin
    [J]. PROCEEDINGS OF THE 2014 9TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI 2014), 2014,
  • [22] A Binary Firefly Algorithm for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olivares-Suarez, Miguel
    Paredes, Fernando
    [J]. MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 65 - 73
  • [23] A Hybrid Genetic Algorithm for Minimum Weight Dominating Set Problem
    Ugurlu, O.
    Tanir, D.
    [J]. RECENT DEVELOPMENTS AND THE NEW DIRECTION IN SOFT-COMPUTING FOUNDATIONS AND APPLICATIONS, 2018, 361 : 137 - 148
  • [24] A NEW HYBRID GENETIC ALGORITHM FOR MAXIMUM INDEPENDENT SET PROBLEM
    Mehrabi, Saeed
    Mehrabi, Abbas
    Mehrabi, Ali D.
    [J]. ICSOFT 2009: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATA TECHNOLOGIES, VOL 2, 2009, : 314 - +
  • [25] An indirect genetic algorithm for set covering problems
    Aickelin, U
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (10) : 1118 - 1126
  • [26] An algorithm for approximating the Pareto set of the multiobjective set covering problem
    Weerasena, Lakmali
    Wiecek, Margaret M.
    Soylu, Banu
    [J]. ANNALS OF OPERATIONS RESEARCH, 2017, 248 (1-2) : 493 - 514
  • [27] An algorithm for approximating the Pareto set of the multiobjective set covering problem
    Lakmali Weerasena
    Margaret M. Wiecek
    Banu Soylu
    [J]. Annals of Operations Research, 2017, 248 : 493 - 514
  • [28] Solving Knights Covering Problem by a Hybrid Algorithm
    Guldal, Serkan
    Tanik, Murat M.
    Lipscomb, Michael Mcfall
    [J]. 2019 IEEE SOUTHEASTCON, 2019,
  • [29] AN ANALYSIS OF THE GREEDY ALGORITHM FOR THE SUBMODULAR SET COVERING PROBLEM
    WOLSEY, LA
    [J]. COMBINATORICA, 1982, 2 (04) : 385 - 393
  • [30] An Artificial Bee Colony Algorithm for the Set Covering Problem
    Cuesta, Rodrigo
    Crawford, Broderick
    Soto, Ricardo
    Paredes, Fernando
    [J]. MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 53 - 63
12345