An evolutionary algorithm with guided mutation for the maximum clique problem

IEEE Transactions on Evolutionary Computation

Volumn 9, Issue 2, 2005, Pages 192-200

  Zhang, Qingfu ^a   Sun, Jianyong ^a   Tsang, Edward ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Estimation of distribution algorithms; Evolutionary algorithm; Guided mutation; Heuristics; Hybrid genetic algorithm; Maximum clique problem (MCP)

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY; STATISTICAL METHODS;

ESTIMATION-OF-DISTRIBUTION ALGORITHMS; GUIDED MUTATION; HYBRID GENETIC ALGORITHM; MAXIMUM CLIQUE PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 17644405107     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2004.840835     Document Type: Article

References (35)

1. F.Glover, "Heuristics for integer programming using surrogate constraints," Dec. Sci., vol. 8, pp. 156-166, 1977.
2. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning," School of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-94-163, 1994.
3. H. Müehlenbein, "The equation for response to selection and its use for prediction," Evol. Comput., vol. 5, pp. 303-346, 1998.
4. H. Müehlenbein, T. Mahnig, and A. O. Rodriguez, "Schemata, distributions, and graphical models in evolutionary optimization," J. Heuristics, vol. 5, pp. 215-247, 1999.
5. S. Baluja and S. Davies, "Fast probabilistic modeling for combinatorial optimization," in Proc. 15th National/10th Conf. Artif. Intell./ Innov. Appl. Artif. Intell., Madison, WI, 1998, pp. 469-476.
6. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, "BOA: The Bayesian optimization algorithm," in Proc. Genetic Evol. Comput. Conf. (GECCO), W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds., 1999, pp. 525-532.
7. B. T. Zhang, "A bayesian framework for evolutionary computation," in Proc. 1999 Congr. Evol. Comput., 1999, pp. 722-228.
8. P. A. N. Bosman and D. Thierens, "Expanding from discrete to continuous EDAs: The IDEA," in Proc. Parallel Prob. Solving from Natutre (PPSN VI), M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, Eds., Paris, France, pp. 767-776.
9. P. Larrañaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Norwell, MA: Kluwer, 2001.
10. 1-ε," in Proc. 37th Annu. Symp. Found. Comput. Sci.. Burlington, VT, Oct. 14-16, 1996, pp. 627-636.
11. I. M. Bomze, M. Budinich, P. M. Paradalos, and M. Pelillo, "The maximum clique problem," in Handbook of Combinatorial Optimization, D.-Z. Du and P. M. Paradalos, Eds. Norwell, MA: Kluwer, 1999, vol. 4.
12. L. Cavique, C. Rego, and I. Themido, "A scatter search algorithm for the maximum clique problem," Instituto Politecnico de Lisboa, Portugal, Tech. Rep. HCES-01-01, 2001.
13. B. Carter and K. Park, "How good are genetic algorithms at finding large cliques: An experimental study," Comput. Sci. Dept., Boston Univ., Boston, MA, Tech. Rep. BU-CS-93-015, 1993.
14. K. Park and B. Carter, "On the effectiveness of genetic search in combinatorial optimization," Comput. Sci. Dept., Boston Univ., Boston, MA, Tech. Rep. BU-CS-94-010, 1994.
15. J. He and X. Yao, "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 495-511, Oct. 2002.
16. Q. Zhang, "On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm," IEEE Trans. Evol. Comput., vol. 8, no. Feb., pp. 80-93, 2004.
17. J. He and X. Yao, "A study of drift analysis for estimating computation time of evolutionary algorithms," Natural Comput., vol. 3, no. 1, pp. 21-35, 2004.
18. J. He and X. Yao, "Toward an analytic framework for analyzing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, pp. 59-97, 2003.
19. T. Bäck and S. Khuri, "An evolutionary heuristic for the maximum independent set problem," in Proc. 1st IEEE Conf. Evol. Comput., 1994, pp. 531-535.
20. M. Hifi, "A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems," J. Oper. Res. Soc., vol. 48, pp. 612-622, 1997.
21. A. S. Murthy, G. Parthasarathy, and V. U. K. Sastry, "Clique finding - A genetic approach," in Proc. 1st IEEE Conf. Evol. Comput., 1994, pp. 18-21.
22. T. N. Bui and P. H. Eppley, "A hybrid genetic algorithm for the maximum clique problem," in Proc. 6th Int. Conf. Genetic Algorithms, L. J. Eshelman, Ed., Pittsburgh, PA, July 1995, pp. 478-484.
23. C. Fleurent and J. A. Ferland, "Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability," SIAM J. Alg., Discr. Meth., vol. 3, pp. 584-591, 1996.
24. J. A. Foster and T. Soule, "Using genetic algorithms to find maximum cliques," Dept. Comput. Sci., Univ. Idaho, Moscow, ID, Tech. Rep. LAL95-12, 1995.
25. E. Marchiori, "A simple heuristic based genetic algorithm for the maximum clique problem," in Proc. ACM Symp. Appl. Comput., 1998, pp. 366-373.
26. E. Marchiori, "Genetic, iterated and multistart local search for the maximum clique problem," in Applications of Evolutionary Computing Berlin, Germany: Springer-Verlag, 2002, LNCS 2279, pp. 112-121.
27. F. Glover and M. Laguna, Tabu Search. Norwell, MA: Kluwer, 1998.
28. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.
29. G. R. Harik, F. G. Lobo, and D. E. Goldberg, "The compact genetic algorithm," IEEE Trans. Evol. Comput., vol. 3, no. 4, pp. 287-297, Nov. 1999.
30. A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing Berlin, Germany: Springer-Verlag, 2003.
31. J. S. De Bonet, C. L. Isbell, and P. Viola, "MIMIC: Finding optima by estimating probability densities," in Advances in Neural Information Processing Systems, M. C. Mozer, M. I. Jordan, and T. PetscheVol, Eds, MA: The MIT Press, 1997, pp. 424-431.
32. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, "Bayesian optimization algorithm, population sizing, and time to convergence," Illinois Genetic Algorithm Lab., Univ. Illinois Urbana-Champaign, Urbana, IL, Rep. No. 2000 001, Jan. 2000.
33. J. M. Peña. V. Robles, P. Larrañaga, V. Herves, F. Rosales, and M. S. Pérez, "GA-EDA: Hybrid evolutionary algorithm using genetic and estimation of distribution algorithms," in Lecture Notes in Artificial Intelligence, Ottawa, ON, Canada, May 2004, pp. 361-371. Proc. 17th Int. Conf. Ind. Eng. Appl. Artif. Intell. Expert Syst..
34. D. Thierens, "Scalability problem of simple genetic algorithms," Evol. Comput., vol. 7, pp. 331-352, 1999.
35. R. Battiti and M. Protasi, "Reactive local search for the maximum clique problem," Algorithmica, vol. 29, no. 4, pp. 601-637, 2001.