International Journal of
Physical Sciences

  • Abbreviation: Int. J. Phys. Sci.
  • Language: English
  • ISSN: 1992-1950
  • DOI: 10.5897/IJPS
  • Start Year: 2006
  • Published Articles: 2568

Full Length Research Paper

A hybrid Ant algorithm for the set covering problem

Broderick Crawford1,2*, Ricardo Soto1,3, Eric Monfroy2,4, Fernando Paredes5 and Wenceslao Palma1      
1Pontificia Universidad Católica de Valparaíso, Chile. 2Universidad Técnica Federico Santa María, Chile. 3Universidad Autónoma de Chile, Chile. 4CNRS, LINA, Université de Nantes, France. 5Escuela de Ingeniería Industrial, Universidad Diego Portales, Santiago, Chile.  
Email: [email protected]

  •  Accepted: 28 June 2011
  •  Published: 16 September 2011

Abstract

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.

 

Key words: Set covering problem, ant colony optimization, look-ahead techniques.

Copyright © 2024 Author(s) retain the copyright of this article.

This article is published under the terms of the Creative Commons Attribution License 4.0

Back to Vol. 6 No. 19
Back to articles
  • Articles on Google by:
SUBSCRIBE TO RSS
SUBMIT MANUSCRIPT
CONFERENCES