The special subcase of the travelling salesman problem is an Euclidean TSP which is considered as a NP-complete. The TSP is usually solved using various heuristics approaches. Among the most popular heuristics are greedy and nearestneighbor algorithms. This paper aims to explore the impact of different values on the overall performance of the improved Nearest-Neighbor (IorNN) approach for solving the travelling salesman problem. The computational results show that the IorNN has a better performance when the value of is 0.5 of the problem size followed by 0.75 and 0.25 with percentage error value is between 1.65% and 22.43%.
展开▼
