New ideas for applying ant colony optimization to the set covering problem
Authors:
- Zhi-Gang RenZRZhi-Gang Ren
- Zu-Ren FengZFZu-Ren Feng
- Liang-Jun KeLKLiang-Jun Ke
- Zhao-Jun ZhangZZZhao-Jun Zhang
- 1 May 2010
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 58 (4) , 774-784
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering ProblemComputers & Industrial Engineering, 2006
- A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problemComputers & Operations Research, 2006
- A study of ACO capabilities for solving the maximum clique problemJournal of Heuristics, 2006
- On the Finite-Time Dynamics of Ant Colony OptimizationMethodology and Computing in Applied Probability, 2006
- – Ant SystemFuture Generation Computer Systems, 2000
- A Lagrangian-based heuristic for large-scale set covering problemsMathematical Programming, 1998
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- A genetic algorithm for the set covering problemEuropean Journal of Operational Research, 1996
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Using a facility location algorithm to solve large set covering problemsOperations Research Letters, 1984