用模拟退火法积分相对坐标求解旅行商问题

2014 Seventh International Joint Conference on Computational Sciences and Optimization Pub Date : 2014-07-04 DOI:10.1109/CSO.2014.39

Xiaojun Liu, Bin Zhang, Fangying Du

{"title":"用模拟退火法积分相对坐标求解旅行商问题","authors":"Xiaojun Liu, Bin Zhang, Fangying Du","doi":"10.1109/CSO.2014.39","DOIUrl":null,"url":null,"abstract":"Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.","PeriodicalId":174800,"journal":{"name":"2014 Seventh International Joint Conference on Computational Sciences and Optimization","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem\",\"authors\":\"Xiaojun Liu, Bin Zhang, Fangying Du\",\"doi\":\"10.1109/CSO.2014.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.\",\"PeriodicalId\":174800,\"journal\":{\"name\":\"2014 Seventh International Joint Conference on Computational Sciences and Optimization\",\"volume\":\"2014 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Joint Conference on Computational Sciences and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2014.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2014.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

旅行商问题是组合优化中最著名的问题之一。本文以安吉-凯华汽车物流有限公司为例进行了分析。我们将其表述为一个旅行商问题，并以位置的相对坐标作为问题参数，用模拟退火法求解旅行商问题，最终解为一条圆形路径。

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

查看原文本刊更多论文

Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem

Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.

求助全文

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

来源期刊

2014 Seventh International Joint Conference on Computational Sciences and Optimization

自引率

0.00%

发文量