A new algorithm to solve the symmetric iterative Marketer problem

The traveling salesman is one of the NP-Complete problems that many researchers have worked on so that they can either solve this problem in general or take it a few steps further. In this article, we also present a new solution. In order to be able to solve this problem close to a complete solution, and in our new solution, it identifies and solves the three main problems facing the traveling salesman route, namely deadlock, intersection and critical routes, and finally the route for The vendor offers a path that is free of the above three problems, and the simulation results of the new solution also show that our solution has been able to be superior to previous solutions, all of which are the advantages of our new solution.

کلیدواژه ها:

Dead end ، intersection ، critical path ، NP-Complete ، traveling salesman