Solving TSP Using Various Meta-Heuristic Algorithms

Abstract

A Hybrid Algorit hm Using a Genet ic Algorit hm and Cuckoo Search Algorit hm t o Solve t he Traveling Sale… Geet a Geet hu A St at ist ical Comparison of Swarm Int elligence Algorit hms Applied t o a NP-Hard Combinat orial Opt imi… Alexandre Wit t wer Download a PDF Pack of t he best relat ed papers  PAPER SOLVING TSP USING VARIOUS META-HEURISTIC ALGORITHMS Solving TSP Using Various Meta-Heuristic Algorithms Abstract-Real world problems like Travelling Salesman Problem (TSP) belong to NP-hard optimization problems which are difficult to solve using classical mathematical methods. Therefore, many alternate solutions have been developed to find the optimal solution in shortest possible time. Nature-inspired algorithms are one of the proposed solutions which are successful in finding the solutions that are very near to the optimal. In this paper, Classical TSP (CTSP) along with its variant Random TSP (RTSP) are solved using various meta-heuristic algorithms and their performance is compared on the basis of tour length. Results show that the Nature-inspired algorithms outperform both Traditional and Evolutionary algorithms and obtain optimal solutions.