Author Login IJIRT Partner Network (IPN) Login

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

  • Unique Paper ID: 162229
  • Volume: 10
  • Issue: 8
  • PageNo: 423-432
  • 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.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 10
  • Issue: 8
  • PageNo: 423-432

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

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry