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.

Citations to this Article [32 citations]

The following is the list of published articles that have cited the current article.

  • Broderick Crawford, Ricardo Soto, Natalia Berrios, Franklin Johnson, and Fernando Paredes, “Binary cat swarm optimization for the set covering problem,” 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1–4, . View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Marco Riquelme-Leiva, Cristian Pena, Claudio Torres-Rojas, Franklin Johnson, and Fernando Paredes, “Set covering problem solved by new binary firefly algorithm,” 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1–4, . View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Cristian Pena, Marco Riquelme-Leiva, Claudio Torres-Rojas, Franklin Johnson, and Fernando Paredes, “Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem,” 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1–4, . View at Publisher · View at Google Scholar
  • Fang Xu, and Jinlong Li, “A hybrid encoded memetic algorithm for set covering problem,” 2018 Tenth International Conference on Advanced Computational Intelligence (ICACI), pp. 552–557, . View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Claudio Torres-Rojas, Cristian Peña, Marco Riquelme-Leiva, Franklin Johnson, and Fernando Paredes, “Using binary fruit fly algorithm for solving the set covering problem,” 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Natalia Berríos, Franklin Johnson, Fernando Paredes, Carlos Castro, and Enrique Norero, “A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem,” Mathematical Problems in Engineering, vol. 2015, pp. 1–8, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Marco Riquelme-Leiva, Cristian Pena, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes, Broderick Crawford, Ricardo Soto, Marco Riquelme-Leiva, Cristian Pena, Claudio Torres-Rojas, Franklin Johnson, and Fernando Paredes, “Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems,” Software Engineering In Intelligent Systems (Csoc2015), Vol 3, vol. 349, pp. 307–315, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Cristian Pena, Marco Riquelme-Leiva, Claudio Torres-Rojas, Franklin Johnson, Fernando Paredes, Broderick Crawford, Ricardo Soto, Cristian Pena, Marco Riquelme-Leiva, Claudio Torres-Rojas, Franklin Johnson, and Fernando Paredes, “Binarization Methods for Shuffled Frog Leaping Algorithms That Solve Set Covering Problems,” Software Engineering In Intelligent Systems (Csoc2015), Vol 3, vol. 349, pp. 317–326, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Natalia BerrÍos, Franklin Johnson, and Fernando Paredes, “Solving the set covering problem with binary cat swarm optimization,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9140, pp. 41–48, 2015. View at Publisher · View at Google Scholar
  • Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Cristian Galleguillos, Kathleen Crawford, Franklin Johnson, Fernando Paredes, Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Cristian Galleguillos, Kathleen Crawford, Franklin Johnson, and Fernando Paredes, “The Complexity of Designing and Implementing Metaheuristics,” Hci International 2015 - Posters' Extended Abstracts, Pt I, vol. 528, pp. 593–597, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Néstor Guzmán, Franklin Johnson, Fernando Paredes, Broderick Crawford, Ricardo Soto, Nestor Guzman, Franklin Johnson, and Fernando Paredes, “Recent harmony search algorithms for 0–1 optimization problems,” Communications in Computer and Information Science, vol. 528, pp. 567–572, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Claudio Torres-Rojas, Cristian Pena, Marco Riquelme-Leiva, Sanjay Misra, Franklin Johnson, Fernando Paredes, Broderick Crawford, Ricardo Soto, Claudio Torres-Rojas, Cristian Pena, Marco Riquelme-Leiva, Sanjay Misra, Franklin Johnson, and Fernando Paredes, “A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem,” Computational Science And Its Applications - Iccsa 2015, Pt Iv, vol. 9158, pp. 411–420, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Felipe Aballay, Sanjay Misra, Franklin Johnson, Fernando Paredes, Broderick Crawford, Ricardo Soto, Felipe Aballay, Sanjay Misra, Franklin Johnson, and Fernando Paredes, “A Teaching-Learning-Based Optimization Algorithm for Solving Set Covering Problems,” Computational Science And Its Applications - Iccsa 2015, Pt Iv, vol. 9158, pp. 421–430, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Cristian Pena, Marco Riquelme-Leiva, Claudio Torres-Rojas, Sanjay Misra, Franklin Johnson, Fernando Paredes, Broderick Crawford, Ricardo Soto, Cristian Pena, Marco Riquelme-Leiva, Claudio Torres-Rojas, Sanjay Misra, Franklin Johnson, and Fernando Paredes, “A Comparison of Three Recent Nature-Inspired Metaheuristics for the Set Covering Problem,” Computational Science And Its Applications - Iccsa 2015, Pt Iv, vol. 9158, pp. 431–443, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Claudio Torres-Rojas, Cristian Peña, Marco Riquelme-Leiva, Sanjay Misra, Franklin Johnson, and Fernando Paredes, “A binary fruit fly optimization algorithm to solve the set covering problem,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9158, pp. 411–420, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Felipe Aballay, Sanjay Misra, Franklin Johnson, and Fernando Paredes, “A teaching-learning-based optimization algorithm for solving set covering problems,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9158, pp. 421–430, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Cristian Peña, Marco Riquelme-Leiva, Claudio Torres-Rojas, Sanjay Misra, Franklin Johnson, and Fernando Paredes, “A comparison of three recent nature-inspired metaheuristics for the set covering problem,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9158, pp. 431–443, 2015. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Ismael Fuenzalida Legüe, Sanjay Misra, and Eduardo Olguín, “A Weed Colonization Inspired Algorithm for the Weighted Set Cover Problem,” Computational Science and Its Applications – ICCSA 2016, vol. 9790, pp. 129–138, 2016. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguín, and Sanjay Misra, “Cat Swarm Optimization with Different Transfer Functions for Solving Set Covering Problems,” Computational Science and Its Applications – ICCSA 2016, vol. 9790, pp. 228–240, 2016. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Eduardo Olguín, Sebastián Mansilla Villablanca, Álvaro Gómez Rubio, Adrián Jaramillo, and Juan Salas, “An Artificial Fish Swarm Optimization Algorithm to Solve Set Covering Problem,” Trends in Applied Knowledge-Based Systems and Data Science, vol. 9799, pp. 892–903, 2016. View at Publisher · View at Google Scholar
  • Ricardo Soto, Eduardo Olguin, Broderick Crawford, and Luis Riquelme, “Biogeography-based optimization algorithm for the Set Covering Problem,” Iberian Conference on Information Systems and Technologies, CISTI, vol. 2016-, 2016. View at Publisher · View at Google Scholar
  • Ricardo Soto, Eduardo Olguin, Broderick Crawford, and Ismael Fuenzalida Legue, “A discrete invasive weed optimization algorithm for the set covering problem,” Iberian Conference on Information Systems and Technologies, CISTI, vol. 2016-, 2016. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Luis Riquelme, Eduardo Olguín, and Sanjay Misra, “Set Covering Problem Resolution by Biogeography-Based Optimization Algorithm,” Computational Science and Its Applications – ICCSA 2016, vol. 9786, pp. 153–165, 2016. View at Publisher · View at Google Scholar
  • Broderick Crawford, Eduardo Olguín, Álvaro Gómez Rubio, Juan Salas, Ricardo Soto, Sanjay Misra, Sebastián Mansilla Villablanca, and Adrián Jaramillo, “Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9786, pp. 166–181, 2016. View at Publisher · View at Google Scholar
  • Ricardo Soto, Eduardo Olguín, Broderick Crawford, and Luis Riquelme, “Biogeography-Based Optimization Algorithm for solving the set covering problem,” Advances in Intelligent Systems and Computing, vol. 464, pp. 273–283, 2016. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ismael Fuenzalida Legüe, Ricardo Soto, and Eduardo Olguín, “A binary invasiveweed optimization algorithm for the set covering problem,” Advances in Intelligent Systems and Computing, vol. 464, pp. 459–468, 2016. View at Publisher · View at Google Scholar
  • Broderick Crawford, Ricardo Soto, Eric Monfroy, Gino Astorga, José García, and Enrique Cortes, “A Meta-Optimization Approach for Covering Problems in Facility Location,” Applied Computer Sciences in Engineering, vol. 742, pp. 565–578, 2017. View at Publisher · View at Google Scholar
  • Jose M. Lanza-Gutierrez, Broderick Crawford, Ricardo Soto, Natalia Berrios, Juan A. Gomez-Pulido, and Fernando Paredes, “Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization,” Expert Systems with Applications, vol. 70, pp. 67–82, 2017. View at Publisher · View at Google Scholar
  • Yiyuan Wang, Dantong Ouyang, Liming Zhang, and Minghao Yin, “A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity,” Science China Information Sciences, vol. 60, no. 6, 2017. View at Publisher · View at Google Scholar
  • Edgar Alfredo Portilla-Flores, Alvaro Sanchez-Marquez, Leticia Flores-Pulido, Eduardo Vega-Alvarado, Maria Barbara Calva Yanez, Jorge Alexander Aponte-Rodriguez, and Paola Andrea Nino-Suarez, “Enhancing the Harmony Search Algorithm Performance on Constrained Numerical Optimization,” IEEE Access, vol. 5, pp. 25759–25780, 2017. View at Publisher · View at Google Scholar
  • Aman Bansal, Apoorv Gupta, Deepak Kr. Sharma, and Varshika Gambhir, “IICAR-Inheritance Inspired Context Aware Routing Protocol for opportunistic networks,” Journal of Ambient Intelligence and Humanized Computing, 2018. View at Publisher · View at Google Scholar
  • Javad Tayyebi, and Abumoslem Mohammadi, “Efficient network algorithms for two special cases of the weighted set cover problem,” International Journal of Management Science and Engineering Management, pp. 1–6, 2018. View at Publisher · View at Google Scholar