Abstract
The Set Covering Problem (SCP) represents an important class of NP-hard combinatorial optimization problems. Actually, the exact algorithms, such as branch and bound, don’t find optimal solutions within a reasonable amount of time, except for small problems. Recently, the Ant systems (AS) were proposed for solving several combinatorial optimization problems. This paper presents a hybrid approach based on Ant Systems combined with a local search for solving the SCP. To validate the implemented approach, many tests have been realized on known benchmarks, and, an empirical adjustment of its parameters has been realized. To improve the performance of this algorithm, two parallel implementations are proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Balas & M. C. Carrera. A dynamic subgradient-based branch and bound procédures for Set Covering. Managment Sciences Research Report n° MSSR 568, GSIA, Carnegie-Mellon University, October1991. Revised May 1995, to appear in Operations Research.
J. E. Beasley & P. C. Chu. A genetic algorithm for the Set Covering Problem. European Journal of Operational Research, 95(2): 393–404, 1996.
B. Bullnheimer, G. Kotsis & C Strauss. Parallelization Strategies for the Ant System. High Performance Algorithms and Software in Non Linear Optimization, Applied Optimization Series, Vol. 24, Kluwer Dordrecht, 87–100, 1997.
M. Dorigo, and L. M. Gambardella. A Study of Some Properties of Ant-Q. Proceeding of PPSN IV-Fourth International Conference on Parallel Problem Solving from Nature, H.-M. Voigt, W. Ebeling, I. Rechenberg And H.-S. Schwefel (Eds.), Springer-Verlag, Berlin, pp. 656–665, September 22–27, 1996.
A. V. Eremeev, A. A. Kolokov & L. A. Zaozerskaya. A hybrid algorithm for Set Covering Problem. Proc. of International Workshop “Discrete Optimization Methods in Scheduling & Computers-Aided Design-Minsk”, 123–129, 2000.
M. L. Fisher & P. Kedia. Optimal solution of Set Covering/Partitioning Problems. Mathematical Programming Study, 36: 674–688, 1990.
R. Hadji, M. Rahoual, E-G. Talbi, and V. Bachelet. Ant Colonies for the Set Covering Problem. Abstract Proceeding of ANTS’2000, pp. 63–66, Brussels, September 7–9, 2000.
E. Marchiori & A. Steenbeek. An evolutionary algorithm for large scale Set Covering Problems with application to airline crew scheduling. Real World Applications of Evolutionary Computing, Springer-Verlag, LNCS 1083: 367–381, 2000.
J.E. Beasley. OR-Library: distributing test problems by email. Journal of the Operational Research Society, 41:1069–1072, 1990. http://mscmga.ms.ic.ac.uk/info.html.
E-G. Talbi, O. Roux, C. Fonlupt & D. Robillard. Parallel Ant Colonies Optimization Problems. Biosp3 Workshop on Biologically Inspired Solutions to Parallel Processing Systems, in IEEE Ipps/Spdp’1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rahoual, M., Hadji, R., Bachelet, V. (2002). Parallel Ant System for the Set Covering Problem. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_25
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive