{"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}
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.
期刊介绍:
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.