A dynamic convexized method for the TSP

  title={A dynamic convexized method for the TSP},
  author={Miaoling Wu and Wenxing Zhu},
  journal={2010 IEEE International Conference on Intelligent Computing and Intelligent Systems},
This paper describes a dynamic convexized method for solving the symmetric traveling salesman problem (TSP). We construct an auxiliary function and design an algorithm based on this function. The possibility of sinking into a previous local minimizer can be reduced by adjusting the value of the parameter in the auxiliary function. We have verified the correctness of this approach both in theory and experiment. Computational tests show that the algorithm is effective. 


Publications citing this paper.


Publications referenced by this paper.
Showing 1-6 of 6 references

The travelling salesman problem: a case study in local optimization, Local Search in Combinatorial OptimizationIn (E

  • D. S. Johnson, L. A. McGeoch
  • Aarts and J. K
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…