Application of hybrid evolutionary algorithm for solving the Set Covering Problem

被引：0
|
作者：
Lin, Geng [1 ]
机构：
[1] Minjiang Univ, Dept Math, Fuzhou 350108, Peoples R China
来源：
MODERN COMPUTER SCIENCE AND APPLICATIONS II (MCSA 2017) | 2017年
关键词：
set covering problem; evolutionary algorithm; simulated annealing; MEMETIC ALGORITHM;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The set covering problem is an important NP-hard combinatorial optimization problem with a wide range of applications. In this paper, we develop a hybrid evolutionary algorithm to solve the set covering problem. Firstly, a constructive procedure is designed to generate initial solutions. Secondly, we employ a simulated annealing based local search procedure to intensify the search. Finally, a filter mechanism is used to reduce the solution time. The simulation on a set of 25 instances indicates the proposed algorithm is effective.
引用
收藏
页码：46 / 52
页数：7
相关论文
共 50 条
  • [41] A variable neighborhood search algorithm for the multimode set covering problem
    Colombo, Fabio
    Cordone, Roberto
    Lulli, Guglielmo
    JOURNAL OF GLOBAL OPTIMIZATION, 2015, 63 (03) : 461 - 480
  • [42] Biogeography-based Optimization Algorithm for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Riquelme, Luis
    Olguin, Eduardo
    2016 11TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2016,
  • [43] A Binary Coded Firefly Algorithm that Solves the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olivares-Suarez, Miguel
    Palma, Wenceslao
    Paredes, Fernando
    Olguin, Eduardo
    Norero, Enrique
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2014, 17 (03): : 252 - 264
  • [44] An Binary Black Hole Algorithm To Solve The Set Covering Problem
    Gomez, Alvaro
    Crawford, Broderick
    Soto, Ricardo
    Jaramillo, Adrian
    Mansilla, Sebastian
    Salas, Juan
    Olguin, Eduardo
    2016 11TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2016,
  • [45] A Binary Invasive Weed Optimization Algorithm for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Fuenzalida Legue, Ismael
    Olguin, Eduardo
    ARTIFICIAL INTELLIGENCE PERSPECTIVES IN INTELLIGENT SYSTEMS, VOL 1, 2016, 464 : 459 - 468
  • [46] A parallel genetic algorithm to solve the set-covering problem
    Solar, M
    Parada, V
    Urrutia, R
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (09) : 1221 - 1235
  • [47] Set Covering Problem solved by new Binary Firefly Algorithm
    Crawford, Broderick
    Soto, Ricardo
    Riquelme-Leiva, Marco
    Pena, Cristian
    Torres-Rojas, Claudio
    Johnson, Franklin
    Paredes, Fernando
    2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [48] An Binary Black Hole Algorithm to Solve Set Covering Problem
    Gomez Rubio, Alvaro
    Crawford, Broderick
    Soto, Ricardo
    Jaramillo, Adrian
    Mansilla Villablanca, Sebastian
    Salas, Juan
    Olguin, Eduardo
    TRENDS IN APPLIED KNOWLEDGE-BASED SYSTEMS AND DATA SCIENCE, 2016, 9799 : 873 - 883
  • [49] Evolutionary Algorithm for Solving Congestion Problem in Computer Networks
    Ohia, Dawid
    Koszalka, Leszek
    Kasprzak, Andrzej
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT I, PROCEEDINGS, 2009, 5711 : 112 - 121
  • [50] A hybrid evolutionary algorithm for solving function optimization problems
    Gu, Fahui
    Li, Kangshun
    Liu, Yue
    PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2016, : 526 - 529
12345