Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 189164, 8 pages
http://dx.doi.org/10.1155/2014/189164
Research Article

Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad Finis Terrae, 7500000 Santiago, Chile
3Universidad Autónoma de Chile, 7500000 Santiago, Chile
4Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370179 Santiago, Chile

Received 20 February 2014; Accepted 30 March 2014; Published 16 April 2014

Academic Editors: S. Balochian and Y. Zhang

Copyright © 2014 Broderick Crawford et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., The IBM Research Symposia Series, pp. 85–103, Plenum Press, New York, NY, USA, 1972. View at Google Scholar
  2. T. A. Feo and M. G. C. Resende, “A probabilistic heuristic for a computationally difficult set covering problem,” Operations Research Letters, vol. 8, no. 2, pp. 67–71, 1989. View at Google Scholar · View at Scopus
  3. M. Mesquita and A. Paias, “Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem,” Computers and Operations Research, vol. 35, no. 5, pp. 1562–1575, 2008. View at Publisher · View at Google Scholar · View at Scopus
  4. E. Balas and M. C. Carrera, “A dynamic subgradient-based branch-and-bound procedure for set covering,” Operations Research, vol. 44, no. 6, pp. 875–890, 1996. View at Google Scholar · View at Scopus
  5. M. L. Fisher and P. Kedia, “Optimal solution of set covering/partitioning problems using dual heuristics,” Management Science, vol. 36, no. 6, pp. 674–688, 1990. View at Google Scholar
  6. J. E. Beasley and K. Jørnsten, “Enhancing an algorithm for set covering problems,” European Journal of Operational Research, vol. 58, no. 2, pp. 293–300, 1992. View at Google Scholar · View at Scopus
  7. A. Caprara, P. Toth, and M. Fischetti, “Algorithms for the set covering problem,” Annals of Operations Research, vol. 98, no. 1-4, pp. 353–371, 2000. View at Google Scholar · View at Scopus
  8. V. Chvatal, “A greedy heuristic for the set-covering problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233–235, 1979. View at Google Scholar
  9. G. Lan and G. W. DePuy, “On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem,” Computers & Industrial Engineering, vol. 51, no. 3, pp. 362–374, 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. S. Ceria, P. Nobili, and A. Sassano, “A Lagrangian-based heuristic for large-scale set covering problems,” Mathematical Programming, Series B, vol. 81, no. 2, pp. 215–228, 1998. View at Google Scholar · View at Scopus
  11. A. Caprara, M. Fischetti, and P. Toth, “Heuristic method for the set covering problem,” Operations Research, vol. 47, no. 5, pp. 730–743, 1999. View at Google Scholar · View at Scopus
  12. U. Aickelin, “An indirect genetic algorithm for set covering problems,” Journal of the Operational Research Society, vol. 53, no. 10, pp. 1118–1126, 2002. View at Publisher · View at Google Scholar · View at Scopus
  13. J. E. Beasley and P. C. Chu, “A genetic algorithm for the set covering problem,” European Journal of Operational Research, vol. 94, no. 2, pp. 392–404, 1996. View at Publisher · View at Google Scholar · View at Scopus
  14. M. J. Brusco, L. W. Jacobs, and G. M. Thompson, “A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems,” Annals of Operations Research, vol. 86, pp. 611–627, 1999. View at Google Scholar · View at Scopus
  15. M. Caserta, “Tabu search-based metaheuristic algorithm for large-scale set covering problems,” in Metaheuristics: Progress in Complex Systems Optimization, K. F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R. F. Hartl, and M. Reimann, Eds., vol. 39 of Operations Research/Computer Science Interfaces Series, pp. 43–63, Springer, 2007. View at Google Scholar
  16. B. Crawford, R. Soto, and E. Monfroy, “Cultural algorithms for the set covering problem,” in Advances in Swarm Intelligence, Y. Tan, Y. Shi, and H. Mo, Eds., vol. 7929 of Lecture Notes in Computer Science, pp. 27–34, Springer, 2013. View at Google Scholar
  17. B. Crawford, C. Lagos, C. Castro, and F. Paredes, “A evolutionary approach to solve set covering,” in Proceedings of the 9th International Conference on Enterprise Information Systems (ICEIS '07), pp. 356–360, June 2007. View at Scopus
  18. B. Crawford, C. Castro, and E. Monfroy, “A new ACO transition rule for set partitioning and covering problems,” in Proceedings of the International Conference on Soft Computing and Pattern Recognition (SoCPaR '09), pp. 426–429, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm,” Journal of Global Optimization, vol. 39, no. 3, pp. 459–471, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. Y. Zhang and L. Wu, “Artificial bee colony for two dimensional protein folding,” Advances in Electrical Engineering Systems, no. 1, pp. 19–23, 2012. View at Google Scholar
  21. Y. Zhang and L. Wu, “Optimal multi-level thresholding based on maximum Tsallis entropy via an artificial bee colony approach,” Entropy, vol. 13, no. 4, pp. 841–859, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Zhang, L. Wu, S. Wang, and Y. Huo, “Chaotic artificial bee colony used for cluster analysis,” in Intelligent Computing and Information Science, R. Chen, Ed., vol. 134 of Communications in Computer and Information Science, pp. 205–211, Springer, Heidelberg, Germany, 2011. View at Google Scholar
  23. Y. Zhang, L. Wu, and S. Wang, “Magnetic resonance brain image classification by an improved artificial bee colony algorithm,” Progress in Electromagnetics Research, vol. 116, pp. 65–79, 2011. View at Google Scholar · View at Scopus
  24. Y. Zhang, L. Wu, and S. Wang, “UCAV path planning based on FSCABC,” Information, vol. 14, no. 3, pp. 687–692, 2011. View at Google Scholar · View at Scopus
  25. B. Akay and D. Karaboga, “Parameter tuning for the artificial bee colony algorithm,” Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems, Springer, Berlin, Germany, vol. 5796, pp. 608–619, 2009. View at Publisher · View at Google Scholar · View at Scopus
  26. D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep. TR06, Computer Engineering Department, Erciyes University, Kayseri, Turkey, 2005. View at Google Scholar
  27. A. Singh, “An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem,” Applied Soft Computing Journal, vol. 9, no. 2, pp. 625–631, 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. B. Crawford, R. Soto, E. Monfroy, C. Castro, W. Palma, and F. Paredes, “A hybrid soft computing approach for subset problems,” Mathematical Problems in Engineering, vol. 2013, Article ID 716069, 12 pages, 2013. View at Publisher · View at Google Scholar
  29. Z.-G. Ren, Z.-R. Feng, L.-J. Ke, and Z.-J. Zhang, “New ideas for applying ant colony optimization to the set covering problem,” Computers & Industrial Engineering, vol. 58, no. 4, pp. 774–784, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. F. Glover and G. A. Kochenberger, Handbook of Metaheuristics, chapter 17, Springer, New York, NY, USA, 2003.
  31. C. Valenzuela, B. Crawford, R. Soto, E. Monfroy, and F. Paredes, “A 2-level metaheuristic for the set covering problem,” International Journal of Computers, Communications & Control, vol. 7, no. 2, pp. 377–387, 2012. View at Google Scholar
  32. B. Crawford, R. Soto, E. Monfroy, W. Palma, C. Castro, and F. Paredes, “Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization,” Expert Systems with Applications, vol. 40, no. 5, pp. 1690–1695, 2013. View at Google Scholar
  33. E. Monfroy, C. Castro, B. Crawford, R. Soto, F. Paredes, and C. Figueroa, “A reactive and hybrid constraint solver,” Journal of Experimental and Theoretical Artificial Intelligence, vol. 25, no. 1, pp. 1–22, 2013. View at Google Scholar
  34. B. Crawford, C. Castro, E. Monfroy, R. Soto, W. Palma, and F. Paredes, “A hyperheuristic approach for guiding enumeration in constraint solving,” in A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II (EVOLVE '12), vol. 175 of Advances in Intelligent Systems and Computing, pp. 171–188, Springer, 2012.
  35. M. V. Krieken, H. Fleuren, and M. Peeters, “Problem reduction in set partitioning problems,” Discussion Paper 2003-80, Center for Economic Research, Tilburg University, 2003. View at Google Scholar