Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem

  • Elena Marchiori
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2279)

Abstract

This paper compares experimentally three heuristic algorithms for the maximum clique problem obtained as instances of an evolutionary algorithm scheme. The algorithms use three popular heuristic methods for combinatorial optimization problems, known as genetic, iterated and multistart local search, respectively.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo. The maximum clique problem. Handbook of Combinatorial Optimization, 4, 1999.Google Scholar
  2. 2.
    R.M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85–103. Plenum Press, NY, 1972.Google Scholar
  3. 3.
    U. Feige, S. Goldwasser, S. Safra, L. Lovász, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 32nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), pages 2–12, 1991.Google Scholar
  4. 4.
    J. Hastad. Clique is hard to approximate within n1-ε. In Proc. 37th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), pages 627–636, 1996.Google Scholar
  5. 5.
    R. Battiti and M. Protasi. Reactive local searchfor the maximum clique problem. Algorithmica, 29(4):610–637, 2001.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    D. Johnson and M. Trick (Eds.). Cliques, Coloring, and Satisfiability. AMS, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 26, 1996.Google Scholar
  7. 7.
    B. Carter and K. Park. How good are genetic algorithms at finding large cliques: an experimental study. Technical report, Boston University, Computer Science Department, MA, October 1993.Google Scholar
  8. 8.
    K. Park and B. Carter. On the effectiveness of genetic search in combinatorial optimization. In Proceedings of the 10th ACM Symposium on Applied Computing. ACM Press, 1995.Google Scholar
  9. 9.
    T. Haynes. Clique detection as a royal road function. In Genetic Programming, 1998.Google Scholar
  10. 10.
    T. Soule and J.A. Foster. Genetic algorithm hardness measures applied to the maximum clique problem. In T. Bäck, editor, Seventh International Conference on Genetic Algorithms, pages 81–88. Morgan Kaufmann, 1997.Google Scholar
  11. 11.
    Y. Davidor. Epistasis variance: a viewpoint on GA-hardness. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms, pages 23–35. Morgan Kaufmann, 1991.Google Scholar
  12. 12.
    T.N. Bui and P.H. Eppley. A hybrid genetic algorithm for the maximum clique problem. In L.J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms (ICGA), pages 478–484. Morgan Kaufmann, 1995.Google Scholar
  13. 13.
    C. Fleurent and J.A. Ferland. Object-Oriented imlementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability. AMS, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 26, 1996.Google Scholar
  14. 14.
    J.A. Foster and T. Soule. Using genetic algorithms to find maximum cliques. Technical report, Dept. of Computer Science, Univ. Idaho, 12 1995.Google Scholar
  15. 15.
    A.S. Murthy, G. Parthasarathy, and V.U.K. Sastry. Clique finding-a genetic approach. In Proceedings of the 1st IEEE Conference on Evolutionary Computation, pages 18–21. IEEE Press, 1994.Google Scholar
  16. 16.
    A. Sakamoto, X. Liu, and T. Shimamoto. A genetic approach for maximum independent set problems. IEICE Trans. Fundamentals, E80-A(3):551–556, 1997.Google Scholar
  17. 17.
    E. Marchiori. A simple heuristic based genetic algorithm for the maximum clique problem. In J. Carroll et al., editor, ACM Symposium on Applied Computing, pages 366–373. ACM Press, 1998.Google Scholar
  18. 18.
    P. Merz and B. Freisleben. Genetic local searchfor the TSP: New results. In IEEE International Conference on Evolutionary Computation, pages 159–164. IEEE Press, 1997.Google Scholar
  19. 19.
    D. Thierens and D. Goldberg. Elitist recombination: an integrated selection recombination GA. In Proceedings of the 1st IEEE Conference on Evolutionary Computation, pages 508–518. IEEE Press, 1994.Google Scholar
  20. 20.
    Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1994.MATHGoogle Scholar
  21. 21.
    K.A. De Jong. An analysis of the behaviour of a class of genetic adaptive systems. Doctoral Dissertation, University of Michigan, Dissertation Abstract International 36(10), 5140B, 1975.Google Scholar
  22. 22.
    G. Syswerda. Uniform crossover in genetic algorithms. In J. Schaffer, editor, Third International Conference on Genetic Algorithms, pages 2–9. Morgan Kaufmann, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Elena Marchiori
    • 1
  1. 1.Department of Computer ScienceFree University AmsterdamHV AmsterdamThe Netherlands

Personalised recommendations