Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 578541, 8 pages
http://dx.doi.org/10.1155/2015/578541
Research Article

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

1Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad San Sebastián, 8420524 Santiago, Chile
3Universidad Central de Chile, 8370178 Santiago, Chile
4Universidad Autónoma de Chile, 7500138 Santiago, Chile
5Universidad Cientifica del Sur, Lima 18 Lima, Peru
6Universidad de Playa Ancha, 2360003 Valparaíso, Chile
7Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile
8Universidad Técnica Federico Santa María, 2390123 Valparaíso, Chile
9Facultad de Ingeniería, Universidad Santo Tomás, 2561694 Viña del Mar, Chile

Received 27 February 2015; Revised 27 May 2015; Accepted 22 June 2015

Academic Editor: Filippo Ubertini

Copyright © 2015 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. B. Crawford, R. Soto, and E. Monfroy, “Cultural algorithms for the set covering problem,” in Advances in Swarm Intelligence: Proceedings of the 4th International Conference, ICSI 2013, Harbin, China, June 12–15, 2013, Part II, Y. Tan, Y. Shi, and H. Mo, Eds., vol. 7929 of Lecture Notes in Computer Science, pp. 27–34, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  2. B. Crawford, R. Soto, R. Cuesta, and F. Paredes, “Application of the artificial bee colony algorithm for solving the set covering problem,” The Scientific World Journal, vol. 2014, Article ID 189164, 8 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Gouwanda and S. Ponnambalam, “Evolutionary search techniques to solve set covering problems,” World Academy of Science, Engineering and Technology, vol. 39, pp. 20–25, 2008. View at Google Scholar
  4. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, London, UK, 3rd edition, 1996.
  5. L. Han, G. Kendall, and P. Cowling, “An adaptive length chromosome hyper-heuristic genetic algorithm for a trainer scheduling problem,” in Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 267–271, 2002.
  6. D. E. Goldberg, “Real-coded genetic algorithms, virtual alphabets, and blocking,” Complex Systems, vol. 5, no. 2, pp. 139–167, 1990. View at Google Scholar · View at MathSciNet
  7. 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
  8. F. Amini and P. Ghaderi, “Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers,” Applied Soft Computing, vol. 13, no. 5, pp. 2272–2280, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. 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
  10. B. Crawford, R. Soto, E. Monfroy, W. Palma, C. Castro, and F. Paredes, “Parameter tuning of a choice-a function based hyperheuristic using particle swarm optimization,” Expert Systems with Applications, vol. 40, no. 5, pp. 1690–1695, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. Shi and R. C. Eberhart, “Empirical study of particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '99), pp. 1945–1950, IEEE, Washington, DC, USA, July 1999. View at Publisher · View at Google Scholar · View at Scopus
  12. R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS '95), pp. 39–43, IEEE, Nagoya, Japan, October 1995. View at Publisher · View at Google Scholar
  13. P. Angeline, “Evolutionary optimization versus particle swarm optimization: philosophy and performance differences,” in Evolutionary Programming VII, V. W. Porto, N. Saravanan, D. Waagen, and A. E. Eiben, Eds., Lecture Notes in Computer Science, pp. 601–610, Springer, 1998. View at Google Scholar
  14. Y. Sharafi, M. A. Khanesar, and M. Teshnehlab, “Discrete binary cat swarm optimization algorithm,” in Proceedings of the 3rd IEEE International Conference on Computer, Control and Communication (IC4 '13), pp. 1–6, September 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. S.-C. Chu, P.-W. Tsai, and J.-S. Pan, “Cat swarm optimization,” in PRICAI 2006: Trends in Artificial Intelligence, vol. 4099 of Lecture Notes in Computer Science, pp. 854–858, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  16. A. Caprara, M. Fischetti, and P. Toth, “Algorithms for the set covering problem,” Annals of Operations Research, vol. 98, pp. 353–371, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. 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 Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. L. Lessing, I. Dumitrescu, and T. Stutzle, “A comparison between ACO algorithms for the set covering problem,” in Ant Colony Optimization and Swarm Intelligence, vol. 3172 of Lecture Notes in Computer Science, pp. 1–12, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  19. A. I. Ali and H. Thiagarajan, “A network relaxation based enumeration algorithm for set partitioning,” European Journal of Operational Research, vol. 38, no. 1, pp. 76–85, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  20. I. Bartholdi, “A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering,” Operations Research, vol. 29, no. 3, pp. 501–510, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  21. M. Desrochers and F. Soumis, “A column generation approach to the urban transit crew scheduling problem,” Transportation Science, vol. 23, no. 1, pp. 1–13, 1989. View at Publisher · View at Google Scholar
  22. W. Walker, “Using the set-covering problem to assign fire companies to fire houses,” Operations Research, vol. 22, no. 2, pp. 275–277, 1974. View at Publisher · View at Google Scholar
  23. F. J. Vasko and G. R. Wilson, “Using a facility location algorithm to solve large set covering problems,” Operations Research Letters, vol. 3, no. 2, pp. 85–90, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. F. J. Vasko, F. E. Wolf, and K. L. Stott, “Optimal selection of ingot sizes via set covering,” Operations Research, vol. 35, no. 3, pp. 346–353, 1987. View at Publisher · View at Google Scholar · View at Scopus
  25. F. J. Vasko, F. E. Wolf, and J. Stott, “A set covering approach to metallurgical grade assignment,” European Journal of Operational Research, vol. 38, no. 1, pp. 27–34, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. F. J. Vasko, F. E. Wolf, K. L. Stott, and J. W. Scheirer, “Selecting optimal ingot sizes for bethlehem steel,” Interfaces, vol. 19, no. 1, pp. 68–84, 1989. View at Publisher · View at Google Scholar
  27. M. L. Balinski and R. E. Quandt, “On an integer program for a delivery problem,” Operations Research, vol. 12, no. 2, pp. 300–304, 1964. View at Publisher · View at Google Scholar
  28. B. A. Foster and D. M. Ryan, “An integer programming approach to the vehicle scheduling problem,” Operational Research Quarterly, vol. 27, no. 2, pp. 367–384, 1976. View at Google Scholar · View at MathSciNet · View at Scopus
  29. M. L. Fisher and M. B. Rosenwein, “An interactive optimization system for bulk-cargo ship scheduling,” Naval Research Logistics, vol. 36, no. 1, pp. 27–42, 1989. View at Publisher · View at Google Scholar
  30. M. Bellmore, H. J. Geenberg, and J. J. Jarvis, “Multi-commodity disconnecting sets,” Management Science, vol. 16, no. 6, pp. B-427–B-433, 1970. View at Publisher · View at Google Scholar
  31. M. Bellmore and H. D. Ratliff, “Optimal defense of multi-commodity networks,” Management Science, vol. 18, pp. B174–B185, 1971. View at Google Scholar · View at MathSciNet
  32. B. A. Freeman and J. V. Jucker, “The line balancing problem,” Journal of Industrial Engineering, vol. 18, pp. 361–364, 1967. View at Google Scholar
  33. M. E. Salveson, “The assembly line balancing problem,” Journal of Industrial Engineering, vol. 6, pp. 18–25, 1955. View at Google Scholar
  34. C. C. Ribeiro, M. Minoux, and M. C. Penna, “An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment,” European Journal of Operational Research, vol. 41, no. 2, pp. 232–239, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. S. Ceria, P. Nobili, and A. Sassano, “A Lagrangian-based heuristic for large-scale set covering problems,” Mathematical Programming, vol. 81, no. 2, pp. 215–228, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  36. M. A. Breuer, “Simplification of the covering problem with application to Boolean expressions,” Journal of the Association for Computing Machinery, vol. 17, pp. 166–181, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  37. N. Christofides, “Zero-one programming using non-binary tree-search,” The Computer Journal, vol. 14, pp. 418–421, 1971. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  38. R. H. Day, “Letter to the editor—on optimal extracting from a multiple file data storage system: an application of integer programming,” Operations Research, vol. 13, no. 3, pp. 482–494, 1965. View at Publisher · View at Google Scholar
  39. R. S. Garfinkel and G. L. Nemhauser, “Optimal political districting by implicit enumeration techniques,” Management Science, vol. 16, no. 8, pp. B-495–B-508, 1970. View at Publisher · View at Google Scholar
  40. E. Housos and T. Elmroth, “Automatic optimization of subproblems in scheduling airline crews,” Interfaces, vol. 27, no. 5, pp. 68–77, 1997. View at Publisher · View at Google Scholar · View at Scopus
  41. V. Aspinall, Complete Textbook of Veterinary Nursing, Butterworth-Heinemann, Oxford, UK, 2006.
  42. B. Pallaud, “Hypotheses on mechanisms underlying observational learning in animals,” Behavioural Processes, vol. 9, no. 4, pp. 381–394, 1984. View at Publisher · View at Google Scholar · View at Scopus
  43. J. Dards, “Feral cat behaviour and ecology,” Bulletin of the Feline Advisory Bureau, vol. 15, no. 3, 1976. View at Google Scholar
  44. A. Yamane, T. Doi, and Y. Ono, “Mating behaviors, courtship rank and mating success of male feral cat (felis catus),” Journal of Ethology, vol. 14, no. 1, pp. 35–44, 1996. View at Publisher · View at Google Scholar · View at Scopus
  45. S. L. Crowell-Davis, “Cat behaviour: social organization, communication and development,” in The Welfare of Cats, I. Rochlitz, Ed., vol. 3 of Animal Welfare, pp. 1–22, Springer, Dordrecht, The Netherlands, 2007. View at Publisher · View at Google Scholar
  46. W. Sung, Effect of gender on initiation of proximity in free ranging domestic cats (Felis catus) [M.S. thesis], University of Georgia, 1998.
  47. R. C. Wolfe, The social organization of the free ranging domestic cat (Felis catus) [PhD dissertation], University of Georgia, 2001.
  48. R. E. Adamec, “The interaction of hunger and preying in the domestic cat (Felis catus): an adaptive hierarchy?” Behavioral Biology, vol. 18, no. 2, pp. 263–272, 1976. View at Publisher · View at Google Scholar · View at Scopus
  49. H. Adler, “Some factors of observational learning in cats,” The Journal of Genetic Psychology, vol. 86, no. 1, pp. 159–177, 1995. View at Google Scholar
  50. B. Santosa and M. K. Ningrum, “Cat swarm optimization for clustering,” in Proceedings of the International Conference on Soft Computing and Pattern Recognition (SoCPaR '09), pp. 54–59, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  51. S.-C. Chu and P.-W. Tsai, “Computational intelligence based on the behavior of cats,” International Journal of Innovative Computing, Information and Control, vol. 3, no. 1, pp. 163–173, 2007. View at Google Scholar · View at Scopus
  52. P.-W. Tsai, J.-S. Pan, S.-M. Chen, and B.-Y. Liao, “Enhanced parallel cat swarm optimization based on the Taguchi method,” Expert Systems with Applications, vol. 39, no. 7, pp. 6309–6319, 2012. View at Publisher · View at Google Scholar · View at Scopus
  53. J. E. Beasley, “A Lagrangian heuristic for set-covering problems,” Naval Research Logistics, vol. 37, no. 1, pp. 151–164, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  54. S. Sundar and A. Singh, “A hybrid heuristic for the set covering problem,” Operational Research, vol. 12, no. 3, pp. 345–365, 2012. View at Publisher · View at Google Scholar · View at Scopus