Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems

In this paper, we propose a set of Modified Binary Firefly Algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Methods in order to solve the binary representation of SCP. The results obtained show that our algorithms are a good and cheap alternative to solve the problem at hand.

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

[2]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[3]  Broderick Crawford,et al.  A new Artificial Bee Colony algorithm for Set Covering Problems , 2014 .

[4]  Toshihide Ibaraki,et al.  Logical analysis of numerical data , 1997, Math. Program..

[5]  Broderick Crawford,et al.  Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem , 2014, HCI.

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

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

[8]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[9]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[10]  Broderick Crawford,et al.  An Artificial Bee Colony Algorithm for the Set Covering Problem , 2014, CSOC.

[11]  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..

[12]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[13]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[14]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

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

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

[17]  Broderick Crawford,et al.  A Hybrid Soft Computing Approach for Subset Problems , 2013 .

[18]  Moshe B. Rosenwein,et al.  An interactive optimization system for bulk-cargo ship scheduling , 1989 .

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

[20]  Paolo Toth,et al.  An electromagnetism metaheuristic for the unicost set covering problem , 2010, Eur. J. Oper. Res..

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

[22]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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

[24]  Francis J. Vasko,et al.  A set covering approach to metallurgical grade assignment , 1989 .

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

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

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

[28]  Seyedeh Zahra Mirjalili,et al.  A Study of Different Transfer Functions for Binary Version of Particle Swarm Optimization , 2011 .

[29]  S. Balachandar,et al.  A Meta-Heuristic Algorithm for Vertex Covering Problem Based on Gravity , 2010 .

[30]  Barbara M. Smith,et al.  Impacs - A bus crew scheduling system using integer programming , 1988, Math. Program..