Solving the Set Covering Problem with a Shuffled Frog Leaping Algorithm

被引：0
|
作者：
Crawford, Broderick [1 ,2 ,3 ]
Soto, Ricardo [1 ,4 ,5 ]
Pena, Cristian [1 ]
Palma, Wenceslao [1 ]
Johnson, Franklin [1 ,6 ]
Paredes, Fernando [7 ]
机构：
[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile
[2] Univ Finis Terrae, Providencia, Chile
[3] Univ San Sebastian, Santiago, Chile
[4] Univ Autonoma Chile, Santiago, Chile
[5] Univ Cent Chile, Santiago, Chile
[6] Univ Playa Ancha, Valparaiso, Chile
[7] Univ Diego Portales, Escuela Ingn Ind, Santiago, Chile
来源：
INTELLIGENT INFORMATION AND DATABASE SYSTEMS, PT II | 2015年 / 9012卷
关键词：
Shuffled frog leaping algorithm; Set covering problem; Metaheuristics; Artificial and computational intelligence; GENETIC ALGORITHM; OPTIMIZATION;
D O I：
10.1007/978-3-319-15705-4_5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we design and evaluate a shuffled frog leaping algorithm that solves the set covering problem. The shuffled frog leaping algorithm is a novel metaheuristic inspired by natural memetics. It consists of an individual memetic evolution and a global memetic information exchange between a population of virtual frogs representing possible solutions of a problem at hand. The experimental results show the effectiveness of our approach which produces competitive results solving a portfolio of set covering problems from the OR-Library.
引用
收藏
页码：41 / 50
页数：10
相关论文
共 50 条
  • [1] Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Pena, Cristian
    Riquelme-Leiva, Marco
    Torres-Rojas, Claudio
    Johnson, Franklin
    Paredes, Fernando
    2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [2] Solving unit commitment problem by a binary shuffled frog leaping algorithm
    Barati, Mohammad
    Farsangi, Malihe M.
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2014, 8 (06) : 1050 - 1060
  • [3] Improved shuffled frog leaping algorithm for solving TSP
    Luo, Jian-Ping
    Li, Xia
    Shenzhen Daxue Xuebao (Ligong Ban)/Journal of Shenzhen University Science and Engineering, 2010, 27 (02): : 173 - 179
  • [4] Solving TSP with Shuffled Frog-Leaping Algorithm
    Luo Xue-hui
    Yang Ye
    Li Xia
    ISDA 2008: EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 3, PROCEEDINGS, 2008, : 228 - 232
  • [5] Binarization Methods for Shuffled Frog Leaping Algorithms That Solve Set Covering Problems
    Crawford, Broderick
    Soto, Ricardo
    Pena, Cristian
    Riquelme-Leiva, Marco
    Torres-Rojas, Claudio
    Johnson, Franklin
    Paredes, Fernando
    SOFTWARE ENGINEERING IN INTELLIGENT SYSTEMS (CSOC2015), VOL 3, 2015, 349 : 317 - 326
  • [6] Application of Shuffled Frog Leaping Algorithm to an Uncapacitated SLLS Problem
    Zhao Liping
    Wang Weiwei
    Han Yi
    Xu Yefeng
    Chen Yixian
    AASRI CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND BIOINFORMATICS, 2012, 1 : 226 - 231
  • [7] Improved Shuffled Frog Leaping Algorithm for Continuous Optimization Problem
    Zhen, Ziyang
    Wang, Daobo
    Liu, Yuanyuan
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 2992 - +
  • [8] An Effective Shuffled Frog Leaping Algorithm for Solving Hybrid Flow-Shop Scheduling Problem
    Xu, Ye
    Wang, Ling
    Zhou, Gang
    Wang, Shengyao
    ADVANCED INTELLIGENT COMPUTING, 2011, 6838 : 560 - 567
  • [9] An Improved Shuffled Frog-Leaping Algorithm to Solving 0-1 Knapsack Problem
    Zhang, Jianhao
    Jiang, Wei
    Zhao, Kang
    IEEE ACCESS, 2024, 12 : 148155 - 148166
  • [10] Hybrid shuffled frog leaping algorithm for solving vehicle-drone cooperative delivery problem
    Duan, Haohao
    Li, Xiaoling
    Lu, Qingchang
    Lin, Shan
    Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2024, 58 (11): : 2258 - 2269
12345