Title :
A dynamic convexized method for the TSP
Author :
Wu, Miaoling ; Zhu, Wenxing
Author_Institution :
Center for Discrete Math. & Theor. Comput. Sci., Fuzhou Univ., Fuzhou, China
Abstract :
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.
Keywords :
convex programming; travelling salesman problems; TSP; auxiliary design; auxiliary function; dynamic convexized method; symmetric traveling salesman problem; Auxiliary function; Convexized method; LKH; TSP;
Conference_Titel :
Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on
Conference_Location :
Xiamen
Print_ISBN :
978-1-4244-6582-8
DOI :
10.1109/ICICISYS.2010.5658682
