Scholars Central

Case reportPublished 2015

Solving Traveling Salesmen Problem using Ant Colony Optimization Algorithm

Authors: Raghavendra BV

Journal of Applied & Computational Mathematics

Volume 4 · Issue 6 · Pages 1–8

Ask about this article

Abstract

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

Ant Colony Optimization is a new meta-heuristic technique used for solving different combinatorial optimization problems. ACO is based on the behaviors of ant colony and this method has strong robustness as well as good distributed calculative mechanism. ACO has very good search capability for optimization problems. Travelling salesman problem is one of the most famous combinatorial optimization problems. In this paper we applied the ant colony optimization technique for symmetric travelling salesperson problem. Analysis are shown that the ant select the rich pheromone distribution edge for finding out the best path.

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 Journal of Applied & Computational Mathematics.

All its articles

Follow

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

  • JournalJournal of Applied & Computational Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Raghavendra BV”

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