Dual subpopulation artificial bee colony algorithm based on individual gradation

IF 5 3区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Egyptian Informatics Journal Pub Date : 2024-03-01 DOI:10.1016/j.eij.2024.100452

Zhaolu Guo , Hongjin Li , Kangshun Li

{"title":"Dual subpopulation artificial bee colony algorithm based on individual gradation","authors":"Zhaolu Guo , Hongjin Li , Kangshun Li","doi":"10.1016/j.eij.2024.100452","DOIUrl":null,"url":null,"abstract":"<div><p>To boost the search performance of Artificial Bee Colony (ABC) algorithm for handling some complicated optimization problems, a dual subpopulation ABC based on individual gradation (DPGABC) is presented. In DPGABC, the whole population is segmented into two subpopulations with different gradations. Then, the subpopulations respectively utilize the strategies with different characteristics as the candidate strategies. So the individuals can exploit the benefits of various strategies to optimize the search performance. Meanwhile, the dual subpopulation mechanism can maintain good population diversity while achieving good convergence performance. In addition, a knowledge-driven parameter update mechanism is designed to improve the convergence performance. The CEC2014 test set is applied for relevant experiments to validate the performance of DPGABC. From the results, DPGABC performs well on most functions.</p></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":null,"pages":null},"PeriodicalIF":5.0000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S111086652400015X/pdfft?md5=1d97602897374278d036e61c9da410dc&pid=1-s2.0-S111086652400015X-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S111086652400015X","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 0

Abstract

To boost the search performance of Artificial Bee Colony (ABC) algorithm for handling some complicated optimization problems, a dual subpopulation ABC based on individual gradation (DPGABC) is presented. In DPGABC, the whole population is segmented into two subpopulations with different gradations. Then, the subpopulations respectively utilize the strategies with different characteristics as the candidate strategies. So the individuals can exploit the benefits of various strategies to optimize the search performance. Meanwhile, the dual subpopulation mechanism can maintain good population diversity while achieving good convergence performance. In addition, a knowledge-driven parameter update mechanism is designed to improve the convergence performance. The CEC2014 test set is applied for relevant experiments to validate the performance of DPGABC. From the results, DPGABC performs well on most functions.

查看原文本刊更多论文

基于个体分级的双子群人工蜂群算法

为了提高人工蜂群算法（ABC）的搜索性能，以处理一些复杂的优化问题，本文提出了一种基于个体分级的双子蜂群算法（DPGABC）。在 DPGABC 算法中，整个种群被划分为两个不同等级的子种群。然后，子群分别利用具有不同特征的策略作为候选策略。这样，个体就能利用各种策略的优势来优化搜索性能。同时，双子种群机制既能保持良好的种群多样性，又能实现良好的收敛性能。此外，还设计了知识驱动的参数更新机制，以提高收敛性能。为了验证 DPGABC 的性能，我们应用 CEC2014 测试集进行了相关实验。从结果来看，DPGABC 在大多数函数上都表现良好。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Egyptian Informatics Journal Decision Sciences-Management Science and Operations Research

CiteScore

11.10

自引率

1.90%

发文量

审稿时长

110 days

期刊介绍： The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.