Simulators for Solving Traveling Salesman Problem Variations with Various Graph Search Methods

In this work we presented our simulator used for implementing and testing a various graph search methods. Our simulator was created in order to solve the Traveling Salesman Problem (TSP) and its variations. TSP is NP-hard in general. Variations that specializes TSP are even harder. Thus, heuristic algorithm is suitable for solving TSP and similar NP-hard problems. We compared our experimental results with the results gathered from Concorde v1.1, which is a well known simulator, designed for solving the TSP. Brief review of related work is presented, some practical applications are considered and several graphs are searched with comparable results.