An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 38, Issue 3, 2008, Pages 645-666

  Guturu, Parthasarathy ^a   Dantu, Ram ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Clique finding; Evolutionary algorithms (EAs); NP hard problems in set and graph theory

Indexed keywords

COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; GRAPH THEORY; HEURISTIC METHODS; SET THEORY; TABU SEARCH;

CLIQUE FINDING; COMBINATORIAL COMPLEXITY; INDEPENDENT SET; SET COVER; SET PACKING; SET PARTITIONING; SUBGRAPH ISOMORPHISM; VERTEX COVER;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; EVOLUTION; STATISTICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; EVOLUTION; MODELS, STATISTICAL;

EID: 44849137201     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.915645     Document Type: Article

References (41)

1. N. Deo, Graph Theory, With Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 2000.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
3. H. D. Nguyen, I. Yoshihara, K. Yamamori, and M. Yasunaga, "Implementation of an effective hybrid GA for large-scale traveling salesman problems," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 1, pp. 92-99, Feb. 2007.
4. Special issue on memetic algorithms, IEEE Trans. Syst., Man, Cybern. B, Cybern., Y. S. Ong, N. Krasnogor, and H. Ishibuchi, (Eds.), vol. 37, no. 1, pp. 2-5, Feb. 2007.
5. S. Khuri and T. Bäck, "An evolutionary heuristic for the minimum vertex cover problem," in Genetic Algorithms Within the Framework of Evolutionary Computation, J. Hopf, Ed. Saarbrücken, Germany: Max Planck Inst. für Inf., 1994, pp. 86-90.
6. T. Bäck and S. Khuri, "An evolutionary heuristic for the maximum independent set problem," in Proc. 1st IEEE Conf. Evol. Comput., Z. Michalewicz, J. D. Schaer, H.-P. Schwefel, D. B. Fogel and H. Kitano, Eds., Piscataway, NJ, 1994, pp. 531-535.
7. M. Hifi, "A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems," J. Oper. Res. Soc., vol. 48, no. 6, pp. 612-622, Jun. 1997.
8. C. R. Reeves, "Hybrid genetic algorithms for bin-packing and related problems," Ann. Oper. Res., vol. 63, no. 1, pp. 371-396, 1996.
9. E. Marchiori and A. Steenbeek, "An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling," in Real World Applications of Evolutionary Computing vol. 1083. New York: Springer-Verlag, 2000, pp. 367-381.
10. V. V. Kureichik and V. M. Kureichik, "Evolution simulation system for graphs isomorphism discernment," in Proc. IEEE ICAIS, 2002, pp. 317-321.
11. G. B. Alvarenga and G. R. Mateus, "A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows," in Proc. 4th Int. Conf. HIS, 2004, pp. 428-433.
12. 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.
13. 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, Jul. 1995, pp. 478-484.
14. 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.
15. E. Marchiori, "A simple heuristic based genetic algorithm for the maximum clique problem," in Proc. ACM SAC, 1998, pp. 366-373.
16. E. Marchiori, "Genetic, iterated and multistart local search for the maximum clique problem," in Applications of Evolutionary Computing vol. 2279. Berlin, Germany: Springer-Verlag, 2002, pp. 112-121.
17. Q. Zhang, J. Sun, and E. Tsang, "An evolutionary algorithm with guided mutation for the maximum clique problem," IEEE Trans. Evol. Comput. vol. 9, no. 2, pp. 192-200, Apr. 2005.
18. A. Singh and A. K. Gupta, "A hybrid heuristic for the maximum clique problem," J. Heuristics, vol. 12, no. 1/2, pp. 5-22, 2006.
19. R. Carraghan and P. M. Pardalos, "An exact algorithm for the maximum clique problem," Oper. Res. Lett., vol. 9, pp. 375-382, 1990.
20. R. Battiti and M. Protasi, "Reactive local search for the maximum clique problem," Algorithmica, vol. 29, no. 4, pp. 610-637, 2001.
21. F. Glover, "Tabu search - Part I," ORSA J. Comput., vol. 1, no. 3, pp. 190-260, 1989.
22. P. Hansen and B. Jaumard, "Algorithms for the maximum satisfiability problem," Computing, vol. 44, no. 4, pp. 279-303, Apr. 1990.
23. A. Gendreau, L. Salvail, and P. Soriano, "Solving the maximum clique problem using a tabu search approach," Ann. Oper. Res., vol. 41, no. 1-4, pp. 385-403, 1993.
24. P. Hansen, N. Mladenovic, and D. Urosevic, "Variable neighborhood search for the maximum clique," Discrete Appl. Math., vol. 145, no. 1, pp. 117-125, 2004.
25. K. Katayama, A. Hamamoto, and H. Narihisa, "An effective local search for the maximum clique problem," Inf. Process. Lett., vol. 95, no. 5, pp. 503-511, 2005.
26. W. Pullan and H. H. Hoos, "Dynamic local search for the maximum clique problem," J. Artif. Intell. Res., vol. 25, pp. 159-185, 2006.
27. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.
28. S. Kirkpatrick, D. C. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
29. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Michigan Press, 1975, pp. 102-106.
30. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
31. J. H. Holland, Adaptation in Natural and Artificial Systems. Cambridge, MA: MIT Press, 1993.
32. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning," School Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-94-163, 1994.
33. F. Glover and M. Laguna, Tabu Search. Norwell, MA: Kluwer, 1998.
34. K. Fukunaga, Introduction to Statistical Pattern Recognition. New York: Academic, 1990.
35. D. O. Loftsgaarden and C. P. Quesenberry, "A nonparametric estimate of a multivariate density function," Ann. Math. Stat., vol. 36, no. 3, pp. 1049-1051, Jun. 1965.
36. D. Johnson and M. Trick, Eds., "Cliques, coloring, and satisfiability," in Second DIMACS Implementation Challenge, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 25. Providence, RI: AMS, 1996
37. K. Xu, BHOSLIB: Benchmarks With Hidden Optimum Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover and Vertex Coloring) Hiding Exact Solutions in Random Graphs. [Online]. Available: http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/ graph-benchmarks.htm
38. K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, "A simple model to generate hard satisfiable instances," in Proc. 19th IJCAI, 2005, pp. 337-342.
39. S. Gilmour and M. Dras, "Kernelization as heuristic structure for the vertex cover problem," in Proc. 3rd Workshop ANTS, Brussels, Belgium, 2006, pp. 452-459.
40. S. Richter, M. Helmert, and C. Gretton, "A stochastic local search approach to vertex cover," in Proc. 30th German Conf. KI, 2007, pp. 412-426.
41. D. H. Ballard and C. M. Brown, Computer Vision. Englewood Cliffs, NJ: Prentice-Hall, 1982, pp. 365-369.