F.R. NURIYEVA
HEURISTIC GRID ALGORITHM FOR TRAVELING SALESMAN PROBLEM
In this paper, a new heuristic grid algorithm is proposed for TSP. In this algorithm, a grid is constructed by selecting specific vertices firstly, then accepting these vertices as starting points, NND algorithm is applied in order to find a tour that includes all of the vertices. Most of the sample problems from TSPLIB Library are solved with NN, NND and the proposed algorithm respectively and their results are comparatively analyzed. Experimental results show that the algorithm proposed in this study could be accepted as an efficient alternative.
Keywords: traveling salesman problem, heuristic algorithms, nearest neighbour algorithm, nearest neighbour algorithm from both end points
HEURISTIC GRID ALGORITHM FOR TRAVELING SALESMAN PROBLEM
In this paper, a new heuristic grid algorithm is proposed for TSP. In this algorithm, a grid is constructed by selecting specific vertices firstly, then accepting these vertices as starting points, NND algorithm is applied in order to find a tour that includes all of the vertices. Most of the sample problems from TSPLIB Library are solved with NN, NND and the proposed algorithm respectively and their results are comparatively analyzed. Experimental results show that the algorithm proposed in this study could be accepted as an efficient alternative.
Keywords: traveling salesman problem, heuristic algorithms, nearest neighbour algorithm, nearest neighbour algorithm from both end points