ScholarLens Back to search
2023•Unpublished venueRequires access

Traveling Salesman Problem with Ant Colony Optimization

V. Murugananthan, Mahmoud Yehia Emam Selim Rehan, R. Srinivasan, M. Kavitha, R. Kavitha

Open publisher page 14 citations

Abstract

An application of Ant Colony Optimization (ACO) to the Travelling Salesman Problem (TSP) is presented in this research study. Ant Colony Optimization (ACO) is a novel technique for combinatorial optimization practitioners. Because ACO is based on the behavior of ant colonies, it has a significant advantage and a widely dispersed calculation mechanism. Finding optimization problems is rather easy using ACO. The “problem of the travelling salesman” is one of the most popular illustrations of combinatorial optimization. This study has used the Ant Colony Optimization (ACO) Algorithm to the Travelling Salesman Problem (TSP) in this work. This study also discusses about the most important modifications that might be made to the Ant Colony algorithm to improve its suitability for resolving the Travelling Salesman Problem (TSP) and ensuring the best results.

About this research paper

What this paper is about

An application of Ant Colony Optimization (ACO) to the Travelling Salesman Problem (TSP) is presented in this research study. Ant Colony Optimization (ACO) is a novel technique for combinatorial optimization practitioners. Because ACO is based on the behavior of ant colonies, it has a significant advantage and a widely dispersed calculation mechanism. Finding optimization problems is rather easy using ACO. The “problem of the travelling salesman” is one of the most popular illustrations of combinatorial optimization. This study has used the Ant Colony Optimization (ACO) Algorithm to the Travelling Salesman Problem (TSP) in this work. This study also discusses about the most important modifications that might be made to the Ant Colony algorithm to improve its suitability for resolving the Travelling Salesman Problem (TSP) and ensuring the best results.

Why it matters

OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

An application of Ant Colony Optimization (ACO) to the Travelling Salesman Problem (TSP) is presented in this research study. Ant Colony Optimization (ACO) is a novel technique for combinatorial optimization practitioners. Because ACO is based on the behavior of ant colonies, it has a significant advantage and a widely dispersed calculation mechanism. Finding optimization problems is rather easy using ACO. The “problem of the travelling salesman” is one of the most popular illustrations of combinatorial optimization. This study has used the Ant Colony Optimization (ACO) Algorithm to the Travelling Salesman Problem (TSP) in this work. This study also discusses about the most important modifications that might be made to the Ant Colony algorithm to improve its suitability for resolving the Travelling Salesman Problem (TSP) and ensuring the best results.

Key concepts: Travelling salesman problem, Ant colony optimization algorithms, Computer science, ANT, Extremal optimization, Mathematical optimization, Ant colony, Metaheuristic

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Traveling Salesman Problem with Ant Colony Optimization — Research Paper | ScholarLens