Scholars Central

Research articlePublished 2017

Aco parameters analysis of tsp problem

Authors: Renu Jangra, Dr. Ramesh Kait

Ask about this article

Abstract

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

A recently proposed algorithm named Ant colony optimization algorithm (ACO) is simple to merge with additional methods. The application of Ant Colony Optimization is much wider and it is always the key algorithm. A meta-heuristic algorithm Ant Colony optimization which is applied on the combinatorial optimized problems to get the optimal solution. Among common combinatorial problems one is Travelling-Salesman Problem (TSP). In this paper, we analyze the ACO algorithm with different parameters values using MATLAB tool. The analysis is shown in form of graph showing the optimal solution corresponding to the values set for the parameters

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 Computer Science and Mobile Applications.

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 Computer Science and Mobile Applications
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Renu Jangra”
  • BylineArticles whose byline prints “Dr. Ramesh Kait”

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