Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem

This paper presents metaheuristic Shuffled Frog Leaping Algorithm (SFLA) to solve the Set Covering Problem (SCP), the SFLA is inspired by the social behavior of frogs, and is being applied to solve many optimization problems. The proposed algorithm includes eight binarization functions and discretization method for resolving the binary representation of the SCP. In the 65 instances of SCP we obtains very promising results.

[1]  Alireza Rahimi-Vahed,et al.  Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm , 2008, Soft Comput..

[2]  Xia Li,et al.  Solving TSP with Shuffled Frog-Leaping Algorithm , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[3]  Chen Fang,et al.  An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem , 2011, Inf. Sci..

[4]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[5]  Mohammed Atiquzzaman,et al.  Optimal design of water distribution network using shu2ed complex evolution , 2004 .

[6]  Broderick Crawford,et al.  Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem , 2014, TheScientificWorldJournal.

[7]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[8]  G B Gharehpetian,et al.  Unit Commitment Problem Solution Using Shuffled Frog Leaping Algorithm , 2011, IEEE Transactions on Power Systems.

[9]  Muzaffar Eusuff,et al.  Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization , 2006 .

[10]  Broderick Crawford,et al.  A 2-level Metaheuristic for the Set Covering Problem , 2014, Int. J. Comput. Commun. Control.

[11]  Yang Ye,et al.  Solving TSP with Shuffled Frog-Leaping Algorithm , 2008 .

[12]  Broderick Crawford,et al.  A Binary Firefly Algorithm for the Set Covering Problem , 2014, CSOC.

[13]  Tarek Hegazy,et al.  Comparison of Two Evolutionary Algorithms for Optimization of Bridge Deck Repairs , 2006, Comput. Aided Civ. Infrastructure Eng..

[14]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .