Scholars Central

Research articlePublished Dec 2013

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm

Authors: Alireza Rezaee, Azizeh Ajalli

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

In this paper, new genetics and Ant colony optimization algorithm for solving the problem of graph correspondence is presented. When using the genetics technique for the problem of graph correspondence, it is not easy to define the crossover operator. our attempt will be to present a definition holding the integration of the population graph in a one-to-one correspondence. we present new and suitable definitions for the target function and a function giving score to a solution at the end of any cycle. We compare both algorithms and try to find their advantages and their shortcomings.

Subjects

Engineering

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in International Journal of Innovative Research in Science, Engineering and Technology.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Innovative Research in Science, Engineering and Technology
  • SubjectEngineering
  • BylineArticles whose byline prints “Alireza Rezaee”
  • BylineArticles whose byline prints “Azizeh Ajalli”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels