Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Intelligence Digital Image Watermark Algorithm Based on Artificial Neural Networks Classifier Read chapter Read first chapter

2014 | OriginalPaper | Chapter

An Artificial Bee Colony Algorithm for the Set Covering Problem

Authors : Rodrigo Cuesta, Broderick Crawford, Ricardo Soto, Fernando Paredes

Published in: Modern Trends and Techniques in Computer Science

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the Set Covering Problem problem.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter A New Approach to Solve the Software Project Scheduling Problem Based on Max–Min Ant System
next chapter A Binary Firefly Algorithm for the Set Covering Problem
Literature
1.
Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875890 (1996)CrossRefMathSciNet
2.
Fisher, M.L., Kedia, P.: Optimal solution of set covering/partitioning problems using dual heuristics. Manage. Sci. 36(6), 674688 (1990)CrossRefMathSciNet
3.
4.
Lan, G., DePuy, G.W.: On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput. Ind. Eng. 51(3), 362374 (2006)CrossRef
5.
Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81, 215228 (1998)MathSciNet
6.
Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730743 (1999)CrossRefMathSciNet
7.
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392404 (1996)CrossRef
8.
Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Ann. Oper. Res. 86, 611627 (1999)CrossRefMathSciNet
9.
Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., et al. (eds.) Metaheuristics: Progress in Complex Systems Optimization, pp. 43–63. Springer, New York (2007)CrossRef
10.
11.
Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293–300 (1992)CrossRefMATH
12.
Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 2000 (1998)MathSciNet
13.
Aickelin, U.: An indirect genetic algorithm for set covering problems, CoRR,0803.2965 (2008)
14.
Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. ICSI 2, 27–34 (2013)
15.
Crawford, B., Castro, C., Monfroy, E.: A new ACO transition rule for set partitioning and covering problems, pp. 426–429. In: SoCPaR 2009 (2009)
16.
Crawford, B., Lagos, C., Castro, C., Paredes, F.: A evolutionary approach to solve set covering. ICEIS 2(2007), 356–363 (2007)
17.
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)CrossRefMATHMathSciNet
18.
Karaboga, D.: An idea based on honey bee swarm for numerical optimization, Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey (2005)
19.
Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl. Soft Comput. 9(2), 625–631 (2009)CrossRef
20.
Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, Berlin (2003)MATH
21.
Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690 (2013)CrossRef
22.
Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., Figueroa, C.: A reactive and hybrid constraint solver. J. Exp. Theor. Artif. Intell. 25(1), 1–22 (2013)CrossRef
23.
Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving Advances in Intelligent Systems and Computing, p. 175. Springer, Berlin (2012)
24.
Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Proceedings of the 12th International Conference on Computational Science and Its Applications (ICCSA), p 7335 (2012)
25.
Crawford, B., Soto, R., Castro, C., Monfroy, E.: A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In: Proceedings of the 4th International Work-conference on the Interplay Between Natural and Artificial Computation (IWINAC), p. 668 (2011)
Metadata
Title
An Artificial Bee Colony Algorithm for the Set Covering Problem
Authors
Rodrigo Cuesta
Broderick Crawford
Ricardo Soto
Fernando Paredes
Copyright Year
2014
Book
Modern Trends and Techniques in Computer Science

Print ISBN: 978-3-319-06739-1

Electronic ISBN: 978-3-319-06740-7

Copyright Year: 2014

DOI
https://doi.org/10.1007/978-3-319-06740-7_5

Premium Partner

    Image Credits