Notice of RetractionA Parallel variable neighborhood search for the Traveling Salesman Problem

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

When trying to find approximate solutions for the Traveling Salesman Problem with heuristic optimization algorithms, the reduction of the computational time or the increase of the exploration in the search space are two important aspects. Used variable neighborhood search to solving the Traveling Salesman Problem, and improved this algorithm in initial solution´s production, neighbor structure and improved shaking step with parallel method, it makes full use of the Variable Neighborhood Search and the parallelism advantages. Test with some instances in TSPLIB, the result shows that the algorithm can achieve satisfied solution with satisfied speed.