Intuitionistic Fuzzy Modeling to Travelling Salesman Problem

This paper presents solution technique for travelling salesman problem (TSP) under intuitionistic fuzzy environment. Travelling salesman problem?is a non-deterministic polynomial-time (NP) hard?problem in?combinatorial optimization,?studied in?graph theory, operations research?and?theoretical computer science. It must be noted that a traveling sales man even face a situation in which he is not able to achieve his objectives completely. There must be a set of alternatives from which he can select one that best meets his aspiration level. For Multi-Objective Symmetric TSP, in fuzzy environment, it is converted into a Linear Program using Fuzzy Multi-Objective Linear Programming technique. A route cannot be simply chosen just as it will most minimize time or it will cover the least possible distance. Examples with requirements to consider the degree of rejection or hesitation (or both) are overflowing in our materialistic world. Here comes the need to consider TSP under intuitionistic fuzzy environment. The degree of rejection as well as the degree of hesitancy must be studied to find the solution in a truly optimum sense! Proposed technique is an extension as well as collaboration of ideas of fuzzy traveling salesperson problem and intuitionistic fuzzy (IF) optimization technique.