A Survey Report on “Optimization of different variants of Travelling Salesman Problem”

A Survey Report on “Optimization of different variants of Travelling Salesman Problem”
Author(s):
Dipanwita Saha
Keywords:
Travelling Salesman Problem, Multi-objective, Genetic Algorithm, Ant Colony Optimization.
Abstract
We have covered a few optimizations of various Traveling Salesman Problem (TSP) variations in this paper, along with Ant Colony Optimization (ACO)-based methods for TSP. Techniques for ant colony optimization were created for static optimization issues, where the input data is predetermined and does not change over time. Among the significant suggestions of this kind are various modifications to the ACO algorithm to improve information reuse and a population-based ACO algorithm created especially for dynamic combinatorial optimization problems. We cover the ACO algorithm for a time-dependent traveling salesman problem, hybrid ACO for a solid multiple traveling salesman problem, and ACO for a multi-conveyance TSP with a cost and time limit among these. An extensive survey of ACO-based solutions for TSP issues is presented in this paper. The experimental section presents computational results using various input data sets.
Article Details
Unique Paper ID: 162229 Publication Volume & Issue: Volume 10, Issue 8 Page(s): 423 - 432
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org