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 条
  • [31] A genetic algorithm for the set covering problem
    Beasley, JE
    Chu, PC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 392 - 404
  • [32] A genetic algorithm for the set covering problem
    AlSultan, KS
    Hussain, MF
    Nizami, JS
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) : 702 - 709
  • [33] Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem
    Alizadeh, R.
    Nishi, T.
    2019 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2019, : 865 - 869
  • [34] A restart local search algorithm for solving maximum set k-covering problem
    Yiyuan Wang
    Dantong Ouyang
    Minghao Yin
    Liming Zhang
    Yonggang Zhang
    Neural Computing and Applications, 2018, 29 : 755 - 765
  • [35] 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
  • [36] A restart local search algorithm for solving maximum set k-covering problem
    Wang, Yiyuan
    Ouyang, Dantong
    Yin, Minghao
    Zhang, Liming
    Zhang, Yonggang
    NEURAL COMPUTING & APPLICATIONS, 2018, 29 (10): : 755 - 765
  • [37] A progressive hybrid set covering based algorithm for the traffic counting location problem
    Vieira, Bruno S.
    Ferrari, Thayse
    Ribeiro, Glaydston M.
    Bahiense, Laura
    Orrico Filho, Romulo D.
    Abramides, Carlos Alberto
    Rosa Campos Junior, Nilo Flavio, Jr.
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 160
  • [38] Hybrid Imperialist Competitive Evolutionary Algorithm for Solving Biobjective Portfolio Problem
    Liu, Chun'an
    Lei, Qian
    Jia, Huamin
    INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2020, 26 (06): : 1477 - 1492
  • [39] Solving point covering problem by ant algorithm
    Hua, Z
    Fan, H
    Li, JJ
    Da, Y
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3501 - 3504
  • [40] Barrakuda: A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem
    Pinacho-Davidson, Pedro
    Blum, Christian
    MATHEMATICS, 2020, 8 (11) : 1 - 26
12345