A comparative study of Ant Colony Optimization and Reactive Search for graph matching problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3906 LNCS, Issue , 2006, Pages 234-246

  Sammoud, Olfa ^a,b   Sorlin, Sébastien ^b   Solnon, Christine ^b   Ghédira, Khaled ^a  

^a UNIVERSITY OF TUNIS   (Tunisia)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PATTERN MATCHING;

ANT COLONY OPTIMIZATION; GRAPH MATCHING; GRAPH MATCHING PROBLEMS; REACTIVE SEARCH;

GRAPH THEORY;

EID: 33745783691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_20     Document Type: Conference Paper

References (21)

1. Tatsuya Akutsu. Protein structure alignment using a graph matching technique. Technical report, Bioinformatics Center, Institute for Chemical Research, Kyoto University. Uji, Kyoto 611-0011, Japan, 1995.
2. I. Alaya, C. Solnon, and K. Ghédira. Ant algorithm for the multi-dimensional knapsack problem. International Conference on Bioinspired Optimization Methods and their Applications (BIOMA 2004), pages 63-72, 2004.
3. th IAPR-TC15 Wk on Graph-based Representations in Pattern Recognition, LNCS 2726-Springer:95-106, 2003.
4. R. Battiti and M. Protasi. Reactive local search for the maximum clique problem. In Springer-Verlag, editor, Algorithmica, volume 29, pages 610-637, 2001.
5. M. Boeres, C. Ribeiro, and I. Bloch. A randomized heuristic for scene recognition by graph matching. In Wkshp on Experimental and Efficient Algorithms (WEA 2004), Pages 100-113, 2004.
6. H. Bunke. On a relation between graph edit distance and maximum common subgraph. PRL: Pattern Recognition Letters, 18:689-694, 1997.
7. H. Bunke and X. Jiang. Graph Matching and Similarity, volume Teodorescu, H.-N., Mlynek, D., Kandel, A., Zimmermann, H.-J. (eds.): Intelligent Systems and Interfaces, chapter 1. Kluwer Academic Publishers, 2000.
8. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern recognition letters, 19(3-4):255-259, 1998.
9. E.K Burke, B. MacCarthy, S. Petrovic, and R. Qu. Case based reasoning in course timetabling: An attribute graph approach. Proc. 4th Int. Conf. on Case-Based Reasoning (ICCBR-2001), LNAI 2080-Springer:90-104, 2001.
10. P.-A. Champin and C. Solnon. Measuring the similarity of labeled graphs. In 5th Int. Conf. on Case-Based Reasoning (ICCBR 2003), volume LNAI 2689-Springer, pages 80-95, 2003.
11. D. Conte, P. Foggia, C. Sansone, and M. Vento. 30 years of graph matching in pattern recognition. Int. Jour, of Pattern Recogn. and AI, 18(3):265-298, 2004.
12. M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw Hill, London, UK, pages 11-32, 1999.
13. M. Dorigo and T. Stützle. Ant colony optimization. MIT Press, 2004.
14. F. Glover. Tabu search - part I. Journal on Computing, pages 190-260, 1989.
15. S. Kirkpatrick, S. Gelatt, and M. Vecchi. Optimisation by simulated annealing. In Science, volume 220, pages 671-680, 1983.
16. B.T. Messmer and H.Bunke. Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans. on Knowledge and Data Engineering, 12-2:307-323, 2000.
17. Sanja Petrovic, Graham Kendall, and Yong Yang. A tabu search approach for graph-structured case retrieval. In IOS Press, editor, Proc. of the STarting Artificial Intelligence Researchers Symposium (STAIRS 2002), pages 55-64, 2002.
18. O. Sammoud, C. Solnon, and K. Ghédira. An ant algorithm for the graph matching problem. 5th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005), LNCS 3448 - Springer:213-223, 2005.
19. C. Solnon and S. Fenet. A study of aco capabilities for solving the maximum clique problem. To appear in Journal of Heuristics- Springer, 2006.
20. S. Sorlin and C. Solnon. Reactive tabu search for measuring graph similarity. 5th I APR Workshop on Graph-based Representations in Pattern Recognition (GbR 2005), LNCS 3434 - Springer: 172-182, 2005.
21. T. Stützle and H.H. Hoos. Max-min Ant System. Journal of Future Generation Computer Systems, 16:889-914, 2000.