A Comparative Analysis of Bioinspired Algorithms for Solving the Problem of Optimization of Circulant and Hypercirculant Networks

O. Monakhov, E. Monakhova
{"title":"A Comparative Analysis of Bioinspired Algorithms for Solving the Problem of Optimization of Circulant and Hypercirculant Networks","authors":"O. Monakhov, E. Monakhova","doi":"10.1109/OPCS.2019.8880247","DOIUrl":null,"url":null,"abstract":"The solution of the optimization problem of constructing regular networks (graphs) that are optimal over the average diameter is investigated. Two classes of parametrically described regular networks are investigated - circulant and hypercirculant networks. An approach using bioinspired algorithms for the automatic synthesis of parametric descriptions of optimal circulant and hypercirculant networks has been developed. A comparative analysis of five different bioinspired algorithms (genetic algorithm, differential evolution, particle swarm optimization, algorithm of artificial bee colony and firefly algorithm) was carried out using them to solve this optimization problem. For the found optimal networks structural characteristics such as diameter, average diameter, bandwidth, reliability were obtained, and these networks were compared according to these characteristics.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The solution of the optimization problem of constructing regular networks (graphs) that are optimal over the average diameter is investigated. Two classes of parametrically described regular networks are investigated - circulant and hypercirculant networks. An approach using bioinspired algorithms for the automatic synthesis of parametric descriptions of optimal circulant and hypercirculant networks has been developed. A comparative analysis of five different bioinspired algorithms (genetic algorithm, differential evolution, particle swarm optimization, algorithm of artificial bee colony and firefly algorithm) was carried out using them to solve this optimization problem. For the found optimal networks structural characteristics such as diameter, average diameter, bandwidth, reliability were obtained, and these networks were compared according to these characteristics.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
解决循环和超循环网络优化问题的生物启发算法的比较分析
研究了构造在平均直径上最优的正则网络(图)的优化问题的解。研究了两类参数描述正则网络——循环网络和超循环网络。提出了一种利用生物启发算法自动合成最优循环和超循环网络参数描述的方法。利用遗传算法、差分进化算法、粒子群算法、人工蜂群算法和萤火虫算法等5种不同的仿生算法对该优化问题进行了比较分析。对得到的最优网络进行了直径、平均直径、带宽、可靠性等结构特征的比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Integrated Computational Environment for Optimization of Complex Systems Approaches to Recognize Cavity Inclusions in Elastic Media in Problem of Monitoring Test Sites Formation of Optimal Communication Service Portfolio for Corporate Clients Numerical Solution of the Coefficient Inverse Problem for a Production-Destruction Model with Various Adjoint Ensemble Designs On Models of Economic Development, Taking Into Account Lending
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1