大规模并行花授粉算法

MultiScience - XXXIII. microCAD International Multidisciplinary Scientific Conference Pub Date : 1900-01-01 DOI:10.26649/musci.2019.048

Szilárd Nagy, K. Jármai

{"title":"大规模并行花授粉算法","authors":"Szilárd Nagy, K. Jármai","doi":"10.26649/musci.2019.048","DOIUrl":null,"url":null,"abstract":"An evolutionary optimization is an efficient tool, but time-consuming for optimizing non-linear and multi-dimensional problems. We propose a SIMD transformation for flower pollination algorithm and function to be optimized. The method was tested with standard test function, and the proportion of runtime in the sequential case and parallel case was examined.","PeriodicalId":340250,"journal":{"name":"MultiScience - XXXIII. microCAD International Multidisciplinary Scientific Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Massively Parallel Flower Pollination Algorithm\",\"authors\":\"Szilárd Nagy, K. Jármai\",\"doi\":\"10.26649/musci.2019.048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An evolutionary optimization is an efficient tool, but time-consuming for optimizing non-linear and multi-dimensional problems. We propose a SIMD transformation for flower pollination algorithm and function to be optimized. The method was tested with standard test function, and the proportion of runtime in the sequential case and parallel case was examined.\",\"PeriodicalId\":340250,\"journal\":{\"name\":\"MultiScience - XXXIII. microCAD International Multidisciplinary Scientific Conference\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MultiScience - XXXIII. microCAD International Multidisciplinary Scientific Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26649/musci.2019.048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MultiScience - XXXIII. microCAD International Multidisciplinary Scientific Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26649/musci.2019.048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

进化优化是优化非线性和多维问题的有效工具，但耗时长。我们提出了一种SIMD变换来优化花授粉算法和函数。用标准测试函数对该方法进行了测试，并考察了顺序工况和并行工况的运行时间比例。

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

查看原文本刊更多论文

Massively Parallel Flower Pollination Algorithm

An evolutionary optimization is an efficient tool, but time-consuming for optimizing non-linear and multi-dimensional problems. We propose a SIMD transformation for flower pollination algorithm and function to be optimized. The method was tested with standard test function, and the proportion of runtime in the sequential case and parallel case was examined.

求助全文

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

来源期刊

MultiScience - XXXIII. microCAD International Multidisciplinary Scientific Conference

自引率

0.00%

发文量