FUZZY BASED COMBINATORIAL OPTIMIZATION OF TRAVELLING SALESMAN PROBLEM USING TWO OPTIMAL METHOD
Jay Chandra Yadav · Global and Stochastic Analysis · 2025
In Operations Research field, Travelling Salesman problem (TSP) is one of an important technique and considered as one of the classical NPcomplete graph search problems.Traditional TSP solutions are depending on the premise that transit periods within nodes determines their relationship by distance only.In fact, however, this is not the case because road and traffic network circumstances influence the time it takes to travel within nodes.Fuzzy based TSP solution has been used because distance and intensity of road traffic circumstances are inherently ambiguous.The result obtained using conventional type solution method for the shortest path travel is 192 minutes as an average time, while the solution using fuzzy based TSP is 177 minutes and using two optimal methods, we get 167 minutes.The potential of the proposed method based on Fuzzy TSP is better than the conventional type of solution method.The present work can be further extended for the large networks in business and industries.