Scholars Central

Research articlePublished 16 Jul 2015

A Novel Approach To Solve Tsp Using Ant Colony Optimization

Authors: Jyoti Garg, Renu Singla

Ask about this article

Abstract

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

Travelling salesman problem (TSP) is a routing problem, which is a sub-problem of many application domains such as transportation, network communication. In this paper, we propose a novel methodology which solves the problem ACO algorithm has defined with well distribution strategy in which total search space area is partition into P numbers of hyper-cubic quadrants where P is the dimension of total search space is updating ant colony optimization heuristic parameter that improve the performance When solving TSP. From experimental Results, we can see that proposed algorithm is giving better showing than other standard algorithms.

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 “Jyoti Garg”
  • BylineArticles whose byline prints “Renu Singla”

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