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 条
  • [21] Solving Biobjective Set Covering Problem Using Binary Cat Swarm Optimization Algorithm
    Crawford, Broderick
    Soto, Ricardo
    Caballero, Hugo
    Olguin, Eduardo
    Misra, Sanjay
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT I, 2016, 9786 : 220 - 231
  • [22] A Binary Firefly Algorithm for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olivares-Suarez, Miguel
    Paredes, Fernando
    MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 65 - 73
  • [23] A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
    Haouari, M
    Chaouachi, JS
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (07) : 792 - 799
  • [24] A New Hybrid Evolutionary Algorithm for solving Multi Objective Cell Formation Problem
    Haleh, H.
    Iranmanesh, H.
    Kor, H.
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 612 - +
  • [25] On a linearization technique for solving the quadratic set covering problem and variations
    Pandey, Pooja
    Punnen, Abraham P.
    OPTIMIZATION LETTERS, 2017, 11 (07) : 1357 - 1370
  • [26] On a linearization technique for solving the quadratic set covering problem and variations
    Pooja Pandey
    Abraham P. Punnen
    Optimization Letters, 2017, 11 : 1357 - 1370
  • [27] ENUMERATION TECHNIQUE FOR SOLVING THE MULTIOBJECTIVE LINEAR SET COVERING PROBLEM
    SAXENA, RR
    ARORA, SR
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1995, 12 (01) : 87 - 97
  • [28] The Set Covering Problem solved by The Black Hole Algorithm
    Soto, Ricardo
    Crawford, Broderick
    Figueroa, Ignacio
    Olivares, Rodrigo
    Olguin, Eduardo
    2016 11TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2016,
  • [29] An Artificial Bee Colony Algorithm for the Set Covering Problem
    Cuesta, Rodrigo
    Crawford, Broderick
    Soto, Ricardo
    Paredes, Fernando
    MODERN TRENDS AND TECHNIQUES IN COMPUTER SCIENCE (CSOC 2014), 2014, 285 : 53 - 63
  • [30] An implementation of harmony search algorithm to the set covering problem
    Lin, Geng
    2015 11TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2015, : 200 - 204
12345