Skip to main content
SpringerLink
Log in

COSATS: A new Cooperation Model between Simulated Annealing and Tabu Search for the K-Graph Partitioning Problem

  • Conference paper
Soft Computing as Transdisciplinary Science and Technology

Part of the book series: Advances in Soft Computing ((AINSC,volume 29))

  • 639 Accesses

Abstract

In our model, two heuristic agents, namely Tabu Search and Simulated Annealing run simultaneously to solve the K-Graph Partitioning Problem (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. COSATS is tested on several large graph benchmarks. The experiments demonstrated that our model achieves 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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alaya I, Sammoud O, Hammami M, Ghedira K (2003) Ant Colony Optimization for the k-Graph Partitioning Problem. In: 4th Tunisia-Japan Symposium on Science and Technology TJASST’03, Tunisia.

    Google Scholar 

  2. Bouhmala N, Ghédira K, Oualibouch S, naegeli H H (1994) A Distributed Approach for the Load Balancing Problem. In: SIPAR-Workshop on Parallel and Ditributed Computing, Switzerland.

    Google Scholar 

  3. Briot J-P (1989) Actalk: a tested for Classifying and Designing Actor Languages in Smalltalk-80 environment. In: European Conference on Object-Oriented Programming ECOOP’89, British Computer Society Workshop Series, Cambridge University Press.

    Google Scholar 

  4. Felten E, Zahorjan W (1991) Issues in the Implementation of a Remote Memory Paging System. univ-of Washington, technical report TP-91-03-09. November.

    Google Scholar 

  5. Ghédira K, Mourali H (2000) Une Approche Multi-Agents_Recuit SimuIé pour le Problème de Partitionnement de Graphes. In: FRANCORO II, Sousse.

    Google Scholar 

  6. Hammami M, Ghédira K (2003) Tabu Search for the k-Graph Partitioning Problem. In: ACS/IEEE International Conference on Computer Systems and Applications AICCSA’03 Tunis.

    Google Scholar 

  7. Hammami M, Ghédira K (2002) A comparative Analysis of genetic algorithms for the k-graph partitioning problem. In: Third International NAISO Symposium on Engineering Of Intelligent Systems, Malaga.

    Google Scholar 

  8. Hendrickson B, Leland R (1995) An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations. SIAM Journal on Scientific Computing 16 pp.452–69.

    Article  MATH  MathSciNet  Google Scholar 

  9. Hennet, J C, Roux W, Tchilingirian P (1996) A Framework for Off-Line and On line Multisite Production Assignment. In: 9th International Working Seminar on Production Economics, Igls-Innsbruck, Autriche, pp.445–452.

    Google Scholar 

  10. Holzrichter M, Oliveira S (1998) New graph partitioning algorithms. TR-120. The University of Iowa.

    Google Scholar 

  11. Karypis G, Kuma V (1998) A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, vol 20 no.1 pp. 359–392.

    Article  MathSciNet  Google Scholar 

  12. Kirkpatick S, Gelatt C D, Vecchi Jr M P (1987) Optimization by simulated annealing. Readings in computer vision: issues, problems, principles, and paradigms, edn Morgan Kaufmann Publishers, pp.606–615.

    Google Scholar 

  13. Korsec P, Jurij S, Borut R (2004) Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel computing 30 pp. 785–801

    Article  Google Scholar 

  14. Marks J, Ruml W, Stuart M, Ngo S, Ngo T (1998) A Seed-Growth Heuristic For Graph Bisection. In Workshop on Algorithms and Experiments ALEX98.

    Google Scholar 

  15. Pedram M, Bhat N, Kuh E (1997) Combining Technology Mapping and Layout. The VLSI Design. An International Journal of Custom-Chip Design, Simulation and Testing, vol. 5, no. 2, pp. 111–124.

    Google Scholar 

  16. Zaki M J (1999) Parallel and Distributed Association Mining: A survey. In: IEEE Concurrency, vol. 7 no.4 pp. 14–25

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Unité de recherche stratégies d’optimisation de l’information et de la connaissance (SOIE), Institut Supérieur de Gestion de Tunis, 41 Rue de la liberté-Cité Bouchoucha, 2000, Le Bardo, Tunisie

    Moez Hammami & Khaled Ghédira

Authors
  1. Moez Hammami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Khaled Ghédira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Oklahoma State University, North Greenwood Avenue 700, 74106, Tulsa, USA

    Ajith Abraham

  2. Dept. of Computer Science and Systems Engineering, Muroran Institute of Technology, Mizumoto-cho 27-1, 050-8585, Muroran, Hokkaido, Japan

    Yasuhiko Dote

  3. Dept. of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, 464-8601, Nagoya, Aichi-ken, Japan

    Takeshi Furuhashi

  4. Institut für Sicherheits-/Prüftechnik, Fraunhofer IPK Berlin, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

  5. Division of Complex Systems Technology Graduate School of Engineering, University of Hokkaido, N-13, W-8 060 KITA-KU, Sapporo, Japan

    Azuma Ohuchi

  6. PRESTO Japan Science & Technology Corp. GSSM, University of Tsukuba, 3-29-1 Otsuka, Bunkyo-ku, 12-0012, Tokyo, Japan

    Yukio Ohsawa

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hammami, M., Ghédira, K. (2005). COSATS: A new Cooperation Model between Simulated Annealing and Tabu Search for the K-Graph Partitioning Problem. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-32391-0_90

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25055-5

  • Online ISBN: 978-3-540-32391-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation