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] Simulation DNA Algorithm of Set Covering Problem
    Zhou, Kang
    Chen, Jin
    APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (01): : 139 - 144
  • [42] An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling
    Marchiori, E
    Steenbeek, A
    REAL-WORLD APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2000, 1803 : 367 - 381
  • [43] Binary Firefly Algorithm for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olivares Suarez, Miguel
    Paredes, Fernando
    Johnson, Franklin
    PROCEEDINGS OF THE 2014 9TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI 2014), 2014,
  • [44] 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
  • [45] 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
  • [46] An algorithm for approximating the Pareto set of the multiobjective set covering problem
    Weerasena, Lakmali
    Wiecek, Margaret M.
    Soylu, Banu
    ANNALS OF OPERATIONS RESEARCH, 2017, 248 (1-2) : 493 - 514
  • [47] An algorithm for approximating the Pareto set of the multiobjective set covering problem
    Lakmali Weerasena
    Margaret M. Wiecek
    Banu Soylu
    Annals of Operations Research, 2017, 248 : 493 - 514
  • [48] A master-apprentice evolutionary algorithm for maximum weighted set K-covering problem
    Yupeng Zhou
    Mingjie Fan
    Xiaofan Liu
    Xin Xu
    Yiyuan Wang
    Minghao Yin
    Applied Intelligence, 2023, 53 : 1912 - 1944
  • [49] A master-apprentice evolutionary algorithm for maximum weighted set K-covering problem
    Zhou, Yupeng
    Fan, Mingjie
    Liu, Xiaofan
    Xu, Xin
    Wang, Yiyuan
    Yin, Minghao
    APPLIED INTELLIGENCE, 2023, 53 (02) : 1912 - 1944
  • [50] A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
    Tan, KC
    Chew, YH
    Lee, LH
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 34 (01) : 115 - 151
12345