Abstract
In Balas and Niehaus (1996), we have developed a heuristic for generating large cliques in an arbitrary graph, by repeatedly taking two cliques and finding a maximum clique in the subgraph induced by the union of their vertex sets, an operation executable in polynomial time through bipartite matching in the complement of the subgraph. Aggarwal, Orlin and Tai (1997) recognized that the latter operation can be embedded into the framework of a genetic algorithm as an optimized crossover operation. Inspired by their approach, we examine variations of each element of the genetic algorithm—selection, population replacement and mutation—and develop a steady-state genetic algorithm that performs better than its competitors on most problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, C.C., J.B. Orlin, and R.P. Tai. (1997). “An Optimized Crossover for Maximum Independent Set,” Operations Research 45, 226-234.
Balas, E. and W. Niehaus. (1996). “Finding Large Cliques in Arbitrary Graphs by Bipartite Matching,” In D.S. Johnson and M.A. Trick (eds.), Clique, Coloring and Satisfiability: Second DIMACS Implementation Challenge. AMS, pp. 29-53.
Balas, E. and W. Niehaus. (1995). “A Max-Flow Based Procedure for Finding Heavy Cliques in Vertex-Weighted Graphs,” MSRR No. 612, GSIA, Carnegie-Mellon University.
Balas, E. and J. Xue. (1996). “Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring,” Algorithms 15, 397-412.
Battiti, R. and M. Protasi. (1995). “Reactive Local Search for the Maximum Clique Problem,” International Computer Science Institute, Berkeley, CA, TR-95-052.
Beasley, J. and P. Chu. (1995). “A Genetic Algorithm for the Set Partitioning Problem,” The Management School, Imperial College, Technical Report.
Brockington, M. and J.C. Culberson. (1996). “Camouflaging Independent Sets in Quasi-Random Graphs,” In D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS, pp. 75-89.
Davis, L. (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.
Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading MA: Addison Wesley.
Hasselberg, J., P.M. Pardalos, and G. Vairaktarakis. (1993). “Test Case Generators and Computational Results for the Maximum Clique Problem,” Journal of Global Optimization 3, 463-482.
Johnson, D.S. and M.A. Trick (eds.). (1996). Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS.
Laarias, J.C. and P.W. Shor. (1992). “Keller's Cube-Tiling Conjecture is False in High Dimensions,” Bulletin of the AMS 27, 279-283.
Mannino, C. and A. Sassano. (1996). “Edge Projection and the Maximum Cardinality Stable Set Problem,” In D.S. John and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS, 205-221.
Reeves, C. (1993). Modern Heuristic Techniques for Combinatorial Problems. New York: John Wiley and Sons, Inc.
Sanchis, L. (1993). “Test Case Construction for Vertex Cover Problem,” Paper presented at the Second DIMACS Challenge, Rutgers University.
Soriano, P. and M. Gendreau. (1993). “Solving the Maximum Clique Problem Using a Tabu Search Approach,” Annals of Operations Research 41, 385-403.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Balas, E., Niehaus, W. Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems. Journal of Heuristics 4, 107–122 (1998). https://doi.org/10.1023/A:1009646528813
Issue Date:
DOI: https://doi.org/10.1023/A:1009646528813