Solving Traveling Salesman Problem by Marker Method
arXiv:1307.5674v1
Originality Synthesis-oriented
AI Analysis
This is an incremental improvement for combinatorial optimization researchers.
The paper tackles the Traveling Salesman Problem by introducing a new mutation operator based on the marker method, which selects the nearest neighbor among near neighbors, but no concrete results or numbers are provided.
In this paper we use marker method and propose a new mutation operator that selects the nearest neighbor among all near neighbors solving Traveling Salesman Problem.