Abstract
In this paper we propose two multi-agent systems gathering several metaheuristics for the K-Graph Partitioning Problem(K-GPP). In the first model COSATS, two metaheuristic agents, namely Tabu Search and Simulated Annealing run simultaneously to solve the K-GPP. These agents are mutually guided during their search process by means of a new mechanism of information exchange based on statistical analysis of search space. In the second model X-COSATS, a crossover agent is added to the model in order to make a crossover between the local optima found by simulated annealing and tabu agents. COSATS and X-COSATS are tested on several large graph benchmarks. The experiments demonstrated that our models achieve partitions with significantly higher quality than those generated by simulated annealing and tabu search operating separately.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alaya, I., Sammoud, O., Hammami, M., Ghedira, K.: Ant Colony Optimization for the k-Graph Partitioning Problem. In: 4th Tunisia-Japan Symposium on Science and Technology TJASST 2003, Tunisia (2003)
Briot, J.-P.: Actalk: a tested for Classifying and Designing Actor Languages in Smalltalk-80 environment. In: European Conference on Object-Oriented Programming (1989)
Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. In: 19th IEEE Design Automation Conference, pp. 175–181 (1982)
Galinier, F., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of combinatorial optimization 3(4), 379–397 (1999)
Ghedira, K., Mourali, H.: Une Approche Multi-Agents Recuit SimuIé pour le Problème de Partitionnement de Graphes. In: FRANCORO II, Sousse (2000)
Hammami, M., Ghedira, K.: Tabu Search for the k-Graph Partitioning Problem. In: ACS/IEEE Int. Conference on Computer Systems and Applications, Tunisia (2003)
Hammami, M., Ghedira, K.: A comparative Analysis of genetic algorithms for the k-graph partitioning problem. In: Third International NAISO Symposium on Engineering Of Intelligent Systems, Malaga (2002)
Karypis, G., Kuma, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing 20(1), 359–392 (1998)
Korsec, P., Jurij, S., Borut, R.: Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel computing 30, 785–801 (2004)
Weinberg, B., Talbi, E.G.: Break the search space symmetry in partitioning problems, an application to graph coloring. Kluwer Academic Publishers, Dordrecht (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hammami, M., Ghédira, K. (2005). COSATS, X-COSATS: Two Multi-agent Systems Cooperating Simulated Annealing, Tabu Search and X-Over Operator for the K-Graph Partitioning Problem. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554028_90
Download citation
DOI: https://doi.org/10.1007/11554028_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28897-8
Online ISBN: 978-3-540-31997-9
eBook Packages: Computer ScienceComputer Science (R0)