Reactive Prohibition-based Ant Colony Optimization (RPACO): A new parallel architecture for constrained clique sub-graphs

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 63-70

  Youssef, Sherin M ^a   Elliman, Dave G ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE SUB-GRAPHS; CONSTRAINT SATISFACTION PROBLEM; REACTIVE PROHIBITION BASED ANT COLONY OPTIMIZATION (RPACO); SWARM ALGORITHMS;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

COMPUTATIONAL METHODS;

EID: 16244388569     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. E. Marchiori, "Genetic, Iterated and Multistart Local Search for The Maximum Clique Problem", Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 2279, Springer-Verlag, Berlin Heidelberg New York, 2002, pp. 112-121. In: Proceedings of Evo Workshops 2002, Kinsale, Ireland, 3-4, 2002, pp. 112-121.
2. E. Marchiori, "Genetic, Iterated and Multistart Local Search for The Maximum Clique Problem", Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 2279, Springer-Verlag, Berlin Heidelberg New York, 2002, pp. 112-121. In: Proceedings of Evo Workshops 2002, Kinsale, Ireland, 3-4, 2002, pp. 112-121.
3. E. Balas, C.S. Yu, "Finding a Maximum Clique in An Arbitrary Graph", SIAM Journal of Computing, vol. 15, no. 4, 1986, pp. 1054-1068.
4. E. Balas, W. Niehaus," Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems", Journal of Heuristics, Kluwer, Boston, MA, 4, 1998, pp. 107-122.
5. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, "The Maximum Clique Problem", In: D.-Z Du, P.M. Pardalos (eds.), Handbook of Combinatorial Optimization, vol. 4, Kluwer Academic Publishers, Boston, MA, 1999, pp. 1-74.
6. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
7. R. Battiti, G. Tecchiolli, "Local Search With Memory: Benchmarking RTS", Operations Research Spectrum, vol. 17, no.2/3, 1995, pp. 67-86.
8. R. Battiti, M. Protasi, "Reactive Local Search for the Maximum Clique Problem", Algorithmica, vol. 29, no. 4, 2001, pp. 610-637.
9. M. Dorigo, Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992.
10. M. Dorigo, G. Di Caro, and L. M Gambardella, "Ant Algorithms for Discrete Optimization", Artificial Life, vol. 5, no. 2, 1999, pp. 137-172.
11. T. Stutzle, H.H. Hoos, "MAX-MIN Ant System", Journal. of Future Generation Computer Systems, vol. 16, 2000, pp. 889-914.
12. D. Johnson, , M. Trick, (Eds.), "Cliques, Coloring, and Satisfiability", Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996.