粒子群优化的搜索过程可视化

Proceedings of the 11th Annual conference on Genetic and evolutionary computation Pub Date : 2009-07-08 DOI:10.1145/1569901.1569909

Yong-Hyuk Kim, K. Lee, Yourim Yoon

{"title":"粒子群优化的搜索过程可视化","authors":"Yong-Hyuk Kim, K. Lee, Yourim Yoon","doi":"10.1145/1569901.1569909","DOIUrl":null,"url":null,"abstract":"It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it will allow better understanding of how to tune the algorithm. For the investigation, we adopt Sammon's mapping, which is a well-known distance-preserving mapping. We demonstrate the usefulness of the proposed methodology by applying it to some function optimization problems.","PeriodicalId":193093,"journal":{"name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Visualizing the search process of particle swarm optimization\",\"authors\":\"Yong-Hyuk Kim, K. Lee, Yourim Yoon\",\"doi\":\"10.1145/1569901.1569909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it will allow better understanding of how to tune the algorithm. For the investigation, we adopt Sammon's mapping, which is a well-known distance-preserving mapping. We demonstrate the usefulness of the proposed methodology by applying it to some function optimization problems.\",\"PeriodicalId\":193093,\"journal\":{\"name\":\"Proceedings of the 11th Annual conference on Genetic and evolutionary computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th Annual conference on Genetic and evolutionary computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1569901.1569909\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1569901.1569909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

粒子群优化算法在高维域上的搜索过程是一个难以理解的问题。可视化描述了整个搜索过程，然后它将允许更好地理解如何调整算法。在研究中，我们采用了Sammon映射，这是一种著名的距离保持映射。我们通过将所提出的方法应用于一些函数优化问题来证明其有效性。

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

查看原文本刊更多论文

Visualizing the search process of particle swarm optimization

It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it will allow better understanding of how to tune the algorithm. For the investigation, we adopt Sammon's mapping, which is a well-known distance-preserving mapping. We demonstrate the usefulness of the proposed methodology by applying it to some function optimization problems.

求助全文

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

来源期刊

Proceedings of the 11th Annual conference on Genetic and evolutionary computation

自引率

0.00%

发文量