Scholars Central

Research articlePublished Mar 2013

Open Loop Travelling Salesman Problem using Genetic Algorithm

Authors: AKSHATHA .P.S, VASUDHA VASHISHT, TANUPRIYA CHOUDHURY

Ask about this article

Abstract

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

Genetic algorithm is an optimization technique based on crossover and mutation operators using a survival of the fittest idea. They have been used successfully in a variety of different problems. Travelling salesman problem is one of the commonly studied optimization problem. In the travelling salesman problem we wish to find a tour of all nodes in a weighted graph so that the total weight is minimized. In this paper a single salesman travels to each of the cities but does not close the loop by returning to the city he started from and each city is visited by the salesman exactly once.

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 Computer and Communication Engineering.

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 Computer and Communication Engineering
  • SubjectComputer Science & IT
  • SubjectEngineering
  • SubjectSocial Sciences & Humanities
  • BylineArticles whose byline prints “AKSHATHA .P.S”
  • BylineArticles whose byline prints “VASUDHA VASHISHT”
  • BylineArticles whose byline prints “TANUPRIYA CHOUDHURY”

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