Back close

Hungarian algorithm using haar tuples to solve fuzzy travelling salesman problem

Publisher : International Journal of Engineering and Technology(UAE)

Year : 2018

Abstract : pTravelling salesman problem(TSP) deals with visiting all the given cities and return back to the starting city with the minimum travelling distance or minimum travelling cost where each city is visited exactly once. The TSP problem is a special kind of an assignment model that excludes sub tours. In this paper we used Haar Hungarian algorithm approach [13] to solve a Fuzzy Travelling Salesman Problem (FTSP) and Numerical examples are given to validate the proposed algorithm. © 2018 Authors./p

Admissions Apply Now