Skip to main content
Journal Article

A 2-level approach for the set covering problem: Parameter tuning of artificial bee colony algorithm by using genetic algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8794 189-196
DOI: 10.1007/978-3-319-11857-4_22
5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel application of the Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. We present a 2-level metaheuristic approach where an Artificial Bee Colony Algorithm acts as a low-level metaheuristic and its paremeters are set by a higher level Genetic Algorithm.3

Author supplied keywords

Cite

CITATION STYLE

APA

Crawford, B., Soto, R., Palma, W., Johnson, F., Paredes, F., & Olguín, E. (2014). A 2-level approach for the set covering problem: Parameter tuning of artificial bee colony algorithm by using genetic algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8794, 189–196. https://doi.org/10.1007/978-3-319-11857-4_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free