A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem

The Set Covering Problem SCP is a well known $$\mathcal {N} \mathcal {P}$$NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms bFFOA were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.

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

[2]  Shengyao Wang,et al.  A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem , 2013, Knowl. Based Syst..

[3]  Marco Caserta,et al.  Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems , 2007, Metaheuristics.

[4]  Wen-Tsao Pan,et al.  A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example , 2012, Knowl. Based Syst..

[5]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Sen Guo,et al.  A hybrid annual power load forecasting model based on generalized regression neural network with fruit fly optimization algorithm , 2013, Knowl. Based Syst..

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

[8]  J. Beasley.  An algorithm for set covering problem , 1987 .

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

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Graham Kendall,et al.  An adaptive Length chromosome Hyper-Heuristic Genetic Algorithm for a Trainer Scheduling Problem , 2002, SEAL.

[12]  Broderick Crawford,et al.  Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization , 2013, Expert Syst. Appl..

[13]  Michael J. Brusco,et al.  A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems , 1999, Ann. Oper. Res..

[14]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[15]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[16]  Zhi-Gang Ren,et al.  New ideas for applying ant colony optimization to the set covering problem , 2010, Comput. Ind. Eng..

[17]  Pedram Ghaderi,et al.  Hybridization of Harmony Search and Ant Colony Optimization for optimal locating of structural dampers , 2013, Appl. Soft Comput..

[18]  Su-Mei Lin,et al.  Analysis of service satisfaction in web auction logistics service using a combination of Fruit fly optimization algorithm and general regression neural network , 2011, Neural Computing and Applications.

[19]  David E. Goldberg,et al.  Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking , 1991, Complex Syst..

[20]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[21]  Andrew Lewis,et al.  S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization , 2013, Swarm Evol. Comput..