TSP的一种动态凸化方法

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems Pub Date : 2010-12-06 DOI:10.1109/ICICISYS.2010.5658682

Miaoling Wu, Wen-xing Zhu

{"title":"TSP的一种动态凸化方法","authors":"Miaoling Wu, Wen-xing Zhu","doi":"10.1109/ICICISYS.2010.5658682","DOIUrl":null,"url":null,"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.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"180 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A dynamic convexized method for the TSP\",\"authors\":\"Miaoling Wu, Wen-xing Zhu\",\"doi\":\"10.1109/ICICISYS.2010.5658682\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":339711,\"journal\":{\"name\":\"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"volume\":\"180 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICISYS.2010.5658682\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2010.5658682","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文给出了一种求解对称旅行商问题的动态凸化方法。我们构造了一个辅助函数，并在此基础上设计了一个算法。通过调整辅助函数中参数的值，可以减少陷入先前局部最小值的可能性。我们已经从理论上和实验上验证了这种方法的正确性。计算试验表明，该算法是有效的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Intelligent Computing and Intelligent Systems

自引率

0.00%

发文量