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] Using binary Fruit Fly algorithm for solving the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Torres-Rojas, Claudio
    Pena, Cristian
    Riquelme-Leiva, Marco
    Johnson, Franklin
    Paredes, Fernando
    2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [22] A binary monkey search algorithm variation for solving the set covering problem
    Broderick Crawford
    Ricardo Soto
    Rodrigo Olivares
    Gabriel Embry
    Diego Flores
    Wenceslao Palma
    Carlos Castro
    Fernando Paredes
    José-Miguel Rubio
    Natural Computing, 2020, 19 : 825 - 841
  • [23] A hybrid evolutionary algorithm for solving the register allocation problem
    Demiroz, B
    Topcuoglu, H
    Kandemir, M
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3004 : 62 - 71
  • [24] AN ALGORITHM FOR SET COVERING PROBLEM
    BEASLEY, JE
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 31 (01) : 85 - 93
  • [25] An effective hybrid evolutionary algorithm for the set orienteering problem
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    INFORMATION SCIENCES, 2024, 654
  • [26] Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem
    Alizadeh, Roghayyeh
    Nishi, Tatsushi
    APPLIED SCIENCES-BASEL, 2020, 10 (20): : 1 - 23
  • [27] Solving Set Covering Problem with Fireworks Explosion
    Crawford, Broderick
    Soto, Ricardo
    Astudillo, Gonzalo
    Olguin, Eduardo
    Misra, Sanjay
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT I, 2016, 9786 : 273 - 283
  • [28] Solving a fuzzy set-covering problem
    Hwang, MJ
    Chiang, CI
    Liu, YH
    MATHEMATICAL AND COMPUTER MODELLING, 2004, 40 (7-8) : 861 - 865
  • [29] A hybrid heuristic for the set covering problem
    Shyam Sundar
    Alok Singh
    Operational Research, 2012, 12 : 345 - 365
  • [30] A hybrid heuristic for the set covering problem
    Sundar, Shyam
    Singh, Alok
    OPERATIONAL RESEARCH, 2012, 12 (03) : 345 - 365
12345