An Binary Black Hole Algorithm to Solve Set Covering Problem.
Álvaro Gómez RubioBroderick CrawfordRicardo SotoAdrián JaramilloSebastián Mansilla VillablancaJuan SalasEduardo OlguínPublished in: IEA/AIE (2016)
Keyphrases
- set covering problem
- set covering
- dynamic programming
- optimal solution
- np hard
- simulated annealing
- optimization algorithm
- computational complexity
- search space
- objective function
- cost function
- benchmark problems
- worst case
- np complete
- reinforcement learning
- knapsack problem
- ant colony optimization
- intelligent agents
- genetic algorithm
- evolutionary algorithm
- cooperative