A dynamic convexized method for the TSP

摘要：

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.

关键词： TSP Auxiliary function Convexized method LKH

作者: Miaoling Wu Wenxing Zhu

作者单位: Research supported by the National Natural Science Foundation of China under Grant 60773126 Discrete Mathematics and Theoretical Computer Science,Fuzhou University,Fuzhou,350002,China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 307-311

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）