{"title":"用于大数据优化的具有二元分层结构和树状拓扑的多目标非洲秃鹫优化算法。","authors":"Bo Liu, Yongquan Zhou, Yuanfei Wei, Qifang Luo","doi":"10.1016/j.jare.2024.09.019","DOIUrl":null,"url":null,"abstract":"<p><strong>Introduction: </strong>Big data optimization (Big-Opt) problems present unique challenges in effectively managing and optimizing the analytical properties inherent in large-scale datasets. The complexity and size of these problems render traditional data processing methods insufficient.</p><p><strong>Objectives: </strong>In this study, we propose a new multi-objective optimization algorithm called the multi-objective African vulture optimization algorithm with binary hierarchical structure and tree topology (MO_Tree_BHSAVOA) to solve Big-Opt problem.</p><p><strong>Methods: </strong>In MO_Tree_BHSAVOA, a binary hierarchical structure (BHS) is incorporated to effectively balance exploration and exploitation capabilities within the algorithm; shift density estimation is introduced as a mechanism for providing selection pressure for population evolution; and a tree topology is employed to reinforce the algorithm's ability to escape local optima and preserve optimal non-dominated solutions. The performance of the proposed algorithm is evaluated using CEC 2020 multi-modal multi-objective benchmark functions and CEC 2021 real-world constrained multi-objective optimization problems and is applied to Big-Opt problems.</p><p><strong>Results: </strong>The performance is analyzed by comparing the results obtained with other multi-objective optimization algorithms and using Friedman's statistical test. The results show that the proposed MO_Tree_BHSAVOA not only provides very competitive results, but also outperforms other algorithms.</p><p><strong>Conclusion: </strong>These findings validate the effectiveness and potential applicability of MO_Tree_BHSAVOA in addressing the optimization challenges associated with big data.</p>","PeriodicalId":94063,"journal":{"name":"Journal of advanced research","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-objective African vultures optimization algorithm with binary hierarchical structure and tree topology for big data optimization.\",\"authors\":\"Bo Liu, Yongquan Zhou, Yuanfei Wei, Qifang Luo\",\"doi\":\"10.1016/j.jare.2024.09.019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Introduction: </strong>Big data optimization (Big-Opt) problems present unique challenges in effectively managing and optimizing the analytical properties inherent in large-scale datasets. The complexity and size of these problems render traditional data processing methods insufficient.</p><p><strong>Objectives: </strong>In this study, we propose a new multi-objective optimization algorithm called the multi-objective African vulture optimization algorithm with binary hierarchical structure and tree topology (MO_Tree_BHSAVOA) to solve Big-Opt problem.</p><p><strong>Methods: </strong>In MO_Tree_BHSAVOA, a binary hierarchical structure (BHS) is incorporated to effectively balance exploration and exploitation capabilities within the algorithm; shift density estimation is introduced as a mechanism for providing selection pressure for population evolution; and a tree topology is employed to reinforce the algorithm's ability to escape local optima and preserve optimal non-dominated solutions. The performance of the proposed algorithm is evaluated using CEC 2020 multi-modal multi-objective benchmark functions and CEC 2021 real-world constrained multi-objective optimization problems and is applied to Big-Opt problems.</p><p><strong>Results: </strong>The performance is analyzed by comparing the results obtained with other multi-objective optimization algorithms and using Friedman's statistical test. The results show that the proposed MO_Tree_BHSAVOA not only provides very competitive results, but also outperforms other algorithms.</p><p><strong>Conclusion: </strong>These findings validate the effectiveness and potential applicability of MO_Tree_BHSAVOA in addressing the optimization challenges associated with big data.</p>\",\"PeriodicalId\":94063,\"journal\":{\"name\":\"Journal of advanced research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of advanced research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.jare.2024.09.019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of advanced research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.jare.2024.09.019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A multi-objective African vultures optimization algorithm with binary hierarchical structure and tree topology for big data optimization.
Introduction: Big data optimization (Big-Opt) problems present unique challenges in effectively managing and optimizing the analytical properties inherent in large-scale datasets. The complexity and size of these problems render traditional data processing methods insufficient.
Objectives: In this study, we propose a new multi-objective optimization algorithm called the multi-objective African vulture optimization algorithm with binary hierarchical structure and tree topology (MO_Tree_BHSAVOA) to solve Big-Opt problem.
Methods: In MO_Tree_BHSAVOA, a binary hierarchical structure (BHS) is incorporated to effectively balance exploration and exploitation capabilities within the algorithm; shift density estimation is introduced as a mechanism for providing selection pressure for population evolution; and a tree topology is employed to reinforce the algorithm's ability to escape local optima and preserve optimal non-dominated solutions. The performance of the proposed algorithm is evaluated using CEC 2020 multi-modal multi-objective benchmark functions and CEC 2021 real-world constrained multi-objective optimization problems and is applied to Big-Opt problems.
Results: The performance is analyzed by comparing the results obtained with other multi-objective optimization algorithms and using Friedman's statistical test. The results show that the proposed MO_Tree_BHSAVOA not only provides very competitive results, but also outperforms other algorithms.
Conclusion: These findings validate the effectiveness and potential applicability of MO_Tree_BHSAVOA in addressing the optimization challenges associated with big data.