Clique Partitioning Problem and Genetic Algorithms

  • Dominique Snyers
Conference paper


In this paper we show how critical coding can be for the Clique Partitioning Problem with Genetic Algorithm (GA). Three chromosomic coding techniques are compared. We improve the classical linear coding with a new label renumbering technique and propose a new tree structured coding. We also show the limitation of an hybrid approach that combines GA with dynamic programming. Experimental results are presented for 30 and 150 vertex graphs.


Genetic Algo Dynamic Programming Tabu Search Linear Code Permutation Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S.G. de Amorin, J.-P. Barthélemy, C.C. Ribeiro, “Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches”, Journal of Classification, 9:17–41, 1992.MathSciNetCrossRefGoogle Scholar
  2. [2]
    D. Golberg, Genetic Algorithm in Search, Optimization and Machine Learning, Addinson Wesley, Reading, 1989.Google Scholar
  3. [3]
    L. Hérault, J-J. Niez, “How neural networks can solve hard graph problems: A performance study on the graph K-partitioning”, Neuro-Nimes’ 89 Int. workshop on Neural Networks & their applications, Nimes, France, pp. 237–255, Nov 1989Google Scholar
  4. [4]
    D. Jones, M. Beltramo, “Solving Partitioning Problems with GA”, 4-th conf. on Genetic Algorithms, 1991.Google Scholar
  5. [5]
    J. Koza, Genetic Evolution and Co-Evolution of Computer Programs, Proc. of Artificial Life II, Santa Fee, 1990.Google Scholar
  6. [6]
    Y.-H. Pao, Adaptive Pattern Recognition and Neural Networks, Addison Wesley, Reading, 1989.Google Scholar
  7. [7]
    B. Manderick, M. de Weger and P. Spiessens, “The Genetic Algorithm and the Structure of the Fitness Landscape”, 4-th conf. on Genetic Algorithms, 1991.Google Scholar
  8. [8]
    S. Régnier, “Sur quelques aspects mathématiques des problèmes de classification automatique”, I.C.C Bulletin, 4: 175–191, 1965.Google Scholar
  9. [9]
    R.L. Russo, P.H. Oden, P.K. Wolff, “A heuristic procedure for the partioning and mapping of computer logic graphs”, IEEE Trans on Comp., Vol.C-20, 12: 1455–1462, Dec 1971.CrossRefGoogle Scholar
  10. [10]
    E-G. Talbi, P. Bessiere, “A Parallel Genetic Algorithm for the graph partitioning problem”, ACM Int Conf on Supercomputing, Cologne, Germany, June 1991.Google Scholar
  11. [11]
    E-G. Talbi, T. Muntean, “Static allocation of communicating process on a parallel architecture”, Int Conf. on High Speed Computation II, Montpelier, M. Durand and F. Dabagh (Editors), Elsevier Science Pub, North Holland, pp. 71–82, Oct 1991.Google Scholar
  12. [12]
    Y. Wakabayashi “Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations”, Doctoral Thesis, Universität Augsburg, 1986.MATHGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1993

Authors and Affiliations

  • Dominique Snyers
    • 1
  1. 1.Télécom BretagneBrest CedexFrance

Personalised recommendations