An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illustrated it with analytical examples and by computer programming. The proposed method builds on the initial solution of the traveling salesman problem (TSP) which is very simple, easy to understand and apply.