{"title":"用调整因子改进 TSP 游程长度的解析近似值","authors":"Youngmin Choi, Bruce L. Golden, Paul M. Schonfeld","doi":"10.1080/23249935.2024.2346631","DOIUrl":null,"url":null,"abstract":"Optimizing Traveling Salesman Problem (TSP) tours requires substantial computational effort, leading researchers to develop approximations relating tour length to the number of visited points, n. E...","PeriodicalId":48871,"journal":{"name":"Transportmetrica A-Transport Science","volume":"42 1","pages":""},"PeriodicalIF":3.6000,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving analytic approximations of TSP tour lengths with adjustment factors\",\"authors\":\"Youngmin Choi, Bruce L. Golden, Paul M. Schonfeld\",\"doi\":\"10.1080/23249935.2024.2346631\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimizing Traveling Salesman Problem (TSP) tours requires substantial computational effort, leading researchers to develop approximations relating tour length to the number of visited points, n. E...\",\"PeriodicalId\":48871,\"journal\":{\"name\":\"Transportmetrica A-Transport Science\",\"volume\":\"42 1\",\"pages\":\"\"},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2024-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportmetrica A-Transport Science\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/23249935.2024.2346631\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TRANSPORTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportmetrica A-Transport Science","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/23249935.2024.2346631","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0
摘要
优化旅行推销员问题（TSP）的游程需要大量的计算工作，因此研究人员开发了游程长度与访问点数 n 有关的近似值。
Improving analytic approximations of TSP tour lengths with adjustment factors
Optimizing Traveling Salesman Problem (TSP) tours requires substantial computational effort, leading researchers to develop approximations relating tour length to the number of visited points, n. E...
期刊介绍：
Transportmetrica A provides a forum for original discourse in transport science. The international journal''s focus is on the scientific approach to transport research methodology and empirical analysis of moving people and goods. Papers related to all aspects of transportation are welcome. A rigorous peer review that involves editor screening and anonymous refereeing for submitted articles facilitates quality output.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
