Abstract
This paper introduces the ant colonies approach for the maximum weighted satisfiability problem, namely MAX-W-SAT. We describe an ant colonies algorithm for MAX-W-SAT called AC-SAT and provide an overview of the results of the empirical tests performed on the hard Johnson benchmark. A comparative study of the algorithm with well known procedures for MAX-W-SAT is done and shows that AC-SAT outperforms the other evolutionary meta-heuristics especially the scatter search, which has been developed recently.
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
Bullnheimer, B., Hartl, R.F., Strauss, C: Applying the ant system to the vehicle routing problem, in 2nd Metaheuristics Int Conf, MIC 97, Sophia-Antipolis, France, (July 1997)
Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant Algorithms for discrete optimization, Tech Rep iridia/98-10, Université libre de Bruxelles, 1998
Colorni, A., Dorigo, M, Maniezzo, V., Trubian, M: Ant system for Job-Shop Scheduling, Jorbel, 34(1), 39–53, (1994)
Dorigo, M., Gambardella, L.M.: Ant Algorithms for the Traveling Salesman Problem, Biosystems, 43, 73–81, (1997)
Dorigo, M., Caro, G.D.: Ant Colony Optimization: A New meta heuristic, IEEE, (1999).
Drias, H.,, ‘Scatter search with random walk strategy for solving hard MAX-W-SAT problems’, in proc of IEA-AIE’2001, LNAI 2070, Springer, Budapest, 3544, (2001).
Drias, H., ‘Genetic Algorithm versus Scatter search and solving hard MAX-W-SAT problems’, in proc of IWANN’2001, LNCS 2084, (2001) Granada, vol 1 586–593
Gambardella, L.M., Taillard, E., Dorigo, M.: Ant Algorithms for the QAP, Technical Report 974, IDSIA, Lugano, Switzerland, (1997)
Glover, F., Laguna M., Marti, R.: scatter search, internet document, (2000).
Hansen P., Jaumard, B.: Algorithms for the Max-SAT, comp 44, 279–303, (1990).
Resende, M.G., Pitsoulis L.S., Pardalos, P.M.: Approximate Solution of Weighted MAX-SAT Problems using GRASP, in Dimacs series on DM and TCS vol 35, 393405, (1997).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drias, H., Taibi, A., Zckour, S. (2003). Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem. In: Mira, J., Álvarez, J.R. (eds) Computational Methods in Neural Modeling. IWANN 2003. Lecture Notes in Computer Science, vol 2686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44868-3_57
Download citation
DOI: https://doi.org/10.1007/3-540-44868-3_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40210-7
Online ISBN: 978-3-540-44868-6
eBook Packages: Springer Book Archive