Stud Multi-Verse Algorithm

Mostafa Meshkat, Mohsen Parhizgar
{"title":"Stud Multi-Verse Algorithm","authors":"Mostafa Meshkat, Mohsen Parhizgar","doi":"10.1109/CSIEC.2017.7940155","DOIUrl":null,"url":null,"abstract":"Recently, a novel bio-inspired optimization algorithm known as Multi-Verse Optimizer (MVO) has been proposed for solving optimization problems based on the fundamental multi-verse theory including concepts such as white holes, black holes, and wormholes. The objective of this study was to present an optimization algorithm using MVO as well as the stud selection and crossover (SSC) operator, namely the Stud Multi-Verse Algorithm (Stud MVO), in order to improve the performance of the MVO algorithm. The SCC operator is originated from the Stud Genetic Algorithm (Stud GA), by which the best search agent known as the stud provides optimal information for other search agents in the population using general genetic operators. In order to evaluate the performance of the Stud MVO, twenty-three benchmark functions including unimodal, multimodal and fixed-dimension multimodal benchmark functions were used. The comparison of the results indicated that Stud MVO outperformed the MVO algorithm in twenty benchmark functions.","PeriodicalId":166046,"journal":{"name":"2017 2nd Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 2nd Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIEC.2017.7940155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Recently, a novel bio-inspired optimization algorithm known as Multi-Verse Optimizer (MVO) has been proposed for solving optimization problems based on the fundamental multi-verse theory including concepts such as white holes, black holes, and wormholes. The objective of this study was to present an optimization algorithm using MVO as well as the stud selection and crossover (SSC) operator, namely the Stud Multi-Verse Algorithm (Stud MVO), in order to improve the performance of the MVO algorithm. The SCC operator is originated from the Stud Genetic Algorithm (Stud GA), by which the best search agent known as the stud provides optimal information for other search agents in the population using general genetic operators. In order to evaluate the performance of the Stud MVO, twenty-three benchmark functions including unimodal, multimodal and fixed-dimension multimodal benchmark functions were used. The comparison of the results indicated that Stud MVO outperformed the MVO algorithm in twenty benchmark functions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Stud多重宇宙算法
近年来,人们提出了一种基于多元宇宙理论(包括白洞、黑洞和虫洞等概念)的新型生物优化算法——多重宇宙优化器(Multi-Verse Optimizer, MVO)。本研究的目的是提出一种使用MVO和螺柱选择和交叉(SSC)算子的优化算法,即螺柱多重宇宙算法(stud MVO),以提高MVO算法的性能。SCC算子起源于Stud遗传算法(Stud GA),其中最佳搜索代理(即Stud)使用一般遗传算子为群体中的其他搜索代理提供最优信息。为了评价螺柱MVO的性能,使用了23个基准函数,包括单峰、多峰和固定维多峰基准函数。结果表明,Stud MVO算法在20个基准函数中优于MVO算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
EEG-based multi-class motor imagery classification using variable sized filter bank and enhanced One Versus One classifier MOCSA: A Multi-Objective Crow Search Algorithm for Multi-Objective optimization A genetic approach in procedural content generation for platformer games level creation Using Recurrence quantification analysis and Generalized Hurst Exponents of ECG for human authentication Improved particle swarm optimization through orthogonal experimental design
×
引用
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