旅行推销员问题的伪几何版本:量子物理模型中的应用和点放置的启发式变体

Q3 Physics and Astronomy
Boris Melnikov, Y. Terentyeva, D. Chaikovskii
{"title":"旅行推销员问题的伪几何版本:量子物理模型中的应用和点放置的启发式变体","authors":"Boris Melnikov, Y. Terentyeva, D. Chaikovskii","doi":"10.35470/2226-4116-2023-12-3-194-200","DOIUrl":null,"url":null,"abstract":"The geometric version of the traveling salesman problem (TSP) has been extensively studied, leading to the development of various approaches for solving its special cases. However, these algorithms often fall short when applied to problems beyond the geometric TSP. In this paper, we explore the pseudo-geometric TSP version, a generalization of the geometric TSP, and propose an adapted geometric algorithm for solving its specific instances. We leverage the knowledge of error bounds to estimate the reconstruction error of the TSP solution even when using geometric approaches for the pseudogeometric TSP. This allows us to achieve reliable results despite uncertainties or noise in the data. We provide a concise description of our algorithmic adaptation and present the results of computational experiments to demonstrate its effectiveness.","PeriodicalId":37674,"journal":{"name":"Cybernetics and Physics","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Pseudogeometric version of the traveling salesman problem: application in quantum physics models and a heuristic variant of point placement\",\"authors\":\"Boris Melnikov, Y. Terentyeva, D. Chaikovskii\",\"doi\":\"10.35470/2226-4116-2023-12-3-194-200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The geometric version of the traveling salesman problem (TSP) has been extensively studied, leading to the development of various approaches for solving its special cases. However, these algorithms often fall short when applied to problems beyond the geometric TSP. In this paper, we explore the pseudo-geometric TSP version, a generalization of the geometric TSP, and propose an adapted geometric algorithm for solving its specific instances. We leverage the knowledge of error bounds to estimate the reconstruction error of the TSP solution even when using geometric approaches for the pseudogeometric TSP. This allows us to achieve reliable results despite uncertainties or noise in the data. We provide a concise description of our algorithmic adaptation and present the results of computational experiments to demonstrate its effectiveness.\",\"PeriodicalId\":37674,\"journal\":{\"name\":\"Cybernetics and Physics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cybernetics and Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.35470/2226-4116-2023-12-3-194-200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Physics and Astronomy\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybernetics and Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35470/2226-4116-2023-12-3-194-200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Physics and Astronomy","Score":null,"Total":0}
引用次数: 0

摘要

人们对几何版的旅行推销员问题(TSP)进行了广泛的研究,从而开发出了各种解决其特殊情况的方法。然而,当这些算法应用于几何 TSP 以外的问题时,往往会出现问题。在本文中,我们探讨了伪几何 TSP 版本(几何 TSP 的一种概括),并提出了一种适用于解决其特殊情况的几何算法。即使在使用几何方法求解伪几何 TSP 时,我们也能利用误差边界知识来估计 TSP 解的重构误差。这样,尽管数据中存在不确定性或噪声,我们仍能获得可靠的结果。我们简要介绍了我们的算法调整,并展示了计算实验结果,以证明其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pseudogeometric version of the traveling salesman problem: application in quantum physics models and a heuristic variant of point placement
The geometric version of the traveling salesman problem (TSP) has been extensively studied, leading to the development of various approaches for solving its special cases. However, these algorithms often fall short when applied to problems beyond the geometric TSP. In this paper, we explore the pseudo-geometric TSP version, a generalization of the geometric TSP, and propose an adapted geometric algorithm for solving its specific instances. We leverage the knowledge of error bounds to estimate the reconstruction error of the TSP solution even when using geometric approaches for the pseudogeometric TSP. This allows us to achieve reliable results despite uncertainties or noise in the data. We provide a concise description of our algorithmic adaptation and present the results of computational experiments to demonstrate its effectiveness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Cybernetics and Physics
Cybernetics and Physics Chemical Engineering-Fluid Flow and Transfer Processes
CiteScore
1.70
自引率
0.00%
发文量
17
审稿时长
10 weeks
期刊介绍: The scope of the journal includes: -Nonlinear dynamics and control -Complexity and self-organization -Control of oscillations -Control of chaos and bifurcations -Control in thermodynamics -Control of flows and turbulence -Information Physics -Cyber-physical systems -Modeling and identification of physical systems -Quantum information and control -Analysis and control of complex networks -Synchronization of systems and networks -Control of mechanical and micromechanical systems -Dynamics and control of plasma, beams, lasers, nanostructures -Applications of cybernetic methods in chemistry, biology, other natural sciences The papers in cybernetics with physical flavor as well as the papers in physics with cybernetic flavor are welcome. Cybernetics is assumed to include, in addition to control, such areas as estimation, filtering, optimization, identification, information theory, pattern recognition and other related areas.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信