An Adaptive Intelligent Water Drops Algorithm for Set Covering Problem

被引:5
|
作者
Crawford, Broderick [1 ]
Soto, Ricardo [1 ]
Astorga, Gino [2 ]
Lemus-Romani, Jose [1 ]
Misra, Sanjay [3 ]
Rubio, Jose-Miguel [4 ]
机构
[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile
[2] Univ Valparaiso, Valparaiso, Chile
[3] Covenant Univ, Ota, Nigeria
[4] Univ Tecnol Chile INACAP, Santiago, Chile
关键词
Metaheuristics; Autonomous Search; Combinatorial Optimization; OPTIMIZATION; SEARCH;
D O I
10.1109/ICCSA.2019.000-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Today, natural resources are more scarce than ever, so we must make good use of them. To achieve this goal, we can use metaheuristic optimization tools as an alternative to achieve good results in a reasonable amount of time. The present work focuses on the use of adaptive techniques to facilitate the use of this type of tool to obtain good functional parameters. We use a constructive metaheuristic algorithm called Intelligent Water Drops to solve the set covering problem. To demonstrate the efficiency of the proposed method, the obtained results were compared with the standard version using the same initial configuration for both algorithms. Additionally, the Kolmogorov-Smirnov-Lilliefors, Wilcoxon signed-rank and Violin chart tests were applied to statistically validate the results, which showed that metaheuristics with autonomous search have a better behavior than do standard algorithms.
引用
收藏
页码:39 / 45
页数:7
相关论文
共 50 条
  • [31] Hybrid niche genetic algorithm for set covering problem
    Zheng, You-Lian
    Lei, De-Ming
    PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 1009 - +
  • [32] 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,
  • [33] Local search algorithm for unicost set covering problem
    Musliu, Nysret
    ADVANCES IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4031 : 302 - 311
  • [34] A black hole algorithm for solving the set covering problem
    Soto, Ricardo (ricardo.soto@ucv.cl), 1600, Springer Verlag (9799):
  • [35] An implementation of harmony search algorithm to the set covering problem
    Lin, Geng
    2015 11TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2015, : 200 - 204
  • [36] Behavior of the ant colony algorithm for the set covering problem
    Alexandrov, D
    Kochetov, Y
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 255 - 260
  • [37] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING
    BALAS, E
    PADBERG, M
    OPERATIONS RESEARCH, 1975, 23 (01) : 74 - 90
  • [38] A GRASP algorithm to solve the unicost set covering problem
    Bautista, Joaquin
    Pereira, Jordi
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 3162 - 3173
  • [39] A Hybrid Encoded Memetic Algorithm for Set Covering Problem
    Xu, Fang
    Li, Jinlong
    PROCEEDINGS OF 2018 TENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2018, : 552 - 557
  • [40] An approach to continuous optimization by the Intelligent Water Drops algorithm
    Shah-Hosseini, Hamed
    4TH INTERNATIONAL CONFERENCE OF COGNITIVE SCIENCE, 2012, 32 : 224 - 229