An Objective Efficient Tabu Search Algorithm for Travelling Salesman Problem with Uncertain Parameters

The tabu search is a metaheuristic procedure for global optimization of travelling salesman problem.It is a dynamic neighbourhood search method.It uses flexible memory to restrict the next solution choice to some subset of neighbourhood of current solution. In this manuscript a fuzzy travelling salesman problem with trapezoidal fuzzy number is interpreted with the efficient tabu search algorithm to obtain the efficient routing plan which minimizes the length of the tour.The trapezoidal fuzzy numbers are converted into fuzzy parametric form with specified coding and then with the streamlined fuzzy arithmetic operation defined for the parametric fuzzy numbers, the tabu search iterations are carried on to get the optimal solution for the travelling salesman problem with uncertain parameters.In particular, the problem is solved without converting the fuzzy number into crisp numbers. Further, the methodology is effectively illustrated with a numerical example.