开发粒子碰撞算法 (PCA) 的改进版，为旅行推销员问题提供近似解决方案

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS Pub Date : 2024-04-02 DOI:10.3103/S0005105524010047

D. Yu. Syedin

{"title":"开发粒子碰撞算法 (PCA) 的改进版，为旅行推销员问题提供近似解决方案","authors":"D. Yu. Syedin","doi":"10.3103/S0005105524010047","DOIUrl":null,"url":null,"abstract":"<p>This work is devoted to the development of a modification of the particle collision algorithm (PCA), which provides an approximate solution to the traveling salesman problem. The resulting modification was tested on a number of well-known tasks and demonstrated greater accuracy and efficiency than its analogues.</p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Development of a Modification of the Particle Collision Algorithm (PCA), Providing an Approximate Solution to the Traveling Salesman Problem\",\"authors\":\"D. Yu. Syedin\",\"doi\":\"10.3103/S0005105524010047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This work is devoted to the development of a modification of the particle collision algorithm (PCA), which provides an approximate solution to the traveling salesman problem. The resulting modification was tested on a number of well-known tasks and demonstrated greater accuracy and efficiency than its analogues.</p>\",\"PeriodicalId\":42995,\"journal\":{\"name\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0005105524010047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105524010047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

摘要-- 本研究致力于开发粒子碰撞算法（PCA）的一种改进方法，它为旅行推销员问题提供了一种近似解。我们在一些著名的任务上对改进算法进行了测试，结果表明其准确性和效率均高于同类算法。

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

Development of a Modification of the Particle Collision Algorithm (PCA), Providing an Approximate Solution to the Traveling Salesman Problem

查看原文本刊更多论文

Development of a Modification of the Particle Collision Algorithm (PCA), Providing an Approximate Solution to the Traveling Salesman Problem

This work is devoted to the development of a modification of the particle collision algorithm (PCA), which provides an approximate solution to the traveling salesman problem. The resulting modification was tested on a number of well-known tasks and demonstrated greater accuracy and efficiency than its analogues.

求助全文

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

来源期刊

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS COMPUTER SCIENCE, INFORMATION SYSTEMS-

自引率

40.00%

发文量

期刊介绍： Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.