Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.2
3.9
Journals
Biomimetics
Special Issues
Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition
share announcement

Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition

A special issue of Biomimetics (ISSN 2313-7673). This special issue belongs to the section "Biological Optimisation and Management".

Deadline for manuscript submissions: closed (31 October 2025) | Viewed by 22043

Special Issue Editors

Prof. Dr. Heming Jia

E-Mail Website
Guest Editor
School of Information Engineering, Sanming University, Sanming 365000, China
Interests: optimization; remora optimization algorithm (ROA); bio-inspired computing; nature-inspired computing; swarm intelligence; artificial intelligence; meta-heuristic modeling and optimization algorithms; evolutionary computations; multilevel image segmentation; feature selection; combinatorial problems
Special Issues, Collections and Topics in MDPI journals
Prof. Dr. Gang Hu

E-Mail Website
Guest Editor
Department of Applied Mathematics, Xi’an University of Technology, Xi’an, China
Interests: metaheuristic algorithms; computing intelligence; artificial intelligence; complex optimization systems; CAD/CAM; image processing and analysis; path planning; multilevel image segmentation; feature selection; Genghis Khan Shark Optimizer
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

As industrialization continues to progress at an unprecedented pace, engineering applications are proliferating, accompanied by myriad intricate and diverse challenges. To navigate these complex real-world problems, a plethora of optimization algorithms have been devised, with swarm intelligence optimization algorithms (SIOAs) occupying a prominent position. SIOAs, drawing inspiration from the collective behaviors exhibited by swarms of insects, animals, and other organisms, have demonstrated remarkable abilities in solving non-convex, nonlinearly constrained, and high-dimensional optimization tasks. Their inherent capability to swiftly converge towards optimal solutions while effectively escaping local optima has been well documented in numerous studies.

This Special Issue, "Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition", aims to consolidate and showcase the latest breakthroughs and achievements in this burgeoning field. It serves as a platform for interdisciplinary research, fostering collaboration among scholars from diverse backgrounds who are exploring the potential of SIOAs for engineering applications. We invite researchers to submit their original contributions that delve into the theoretical foundations, algorithmic innovations, and practical applications of SIOAs, with a focus on addressing specific challenges and advancing the state of the art of the field.

The scope of this Special Issue encompasses, but is not limited to, the following topics:

  • Novel SIOAs: The development of new swarm intelligence optimization algorithms, including those inspired by unique swarm behaviors or innovative mechanisms for enhancing exploration, exploitation, and convergence.
  • Hybridization and Integration: Studies exploring the integration of SIOAs with other optimization techniques, machine learning algorithms, or heuristic methods to create hybrid optimization frameworks that leverage the strengths of each approach.
  • Theoretical Analysis: In-depth analyses of the mathematical properties, convergence behavior, and complexity of SIOAs, providing insights into their performance and limitations.
  • Parameter Tuning and Adaptation: Research on adaptive parameter control strategies for SIOAs, aimed at enhancing their robustness, versatility, and performance across different problem domains.
  • High-Dimensional and Complex Problems: Applications of SIOAs to tackle high-dimensional, multimodal, dynamic, and noisy optimization problems, demonstrating their effectiveness in real-world contexts.
  • Benchmarking and Comparative Studies: Comparative evaluations of SIOAs using standard and novel benchmark functions, highlighting their strengths and weaknesses relative to other optimization techniques.
  • Engineering Applications: Case studies showcasing the successful application of SIOAs in solving engineering problems, such as design optimization, production scheduling, network routing, and control systems.

By publishing high-quality research on SIOAs and their applications, this Special Issue aims to promote the dissemination of knowledge, facilitate interdisciplinary collaborations, and inspire further advancements in this exciting field. We encourage researchers to submit their original work, addressing both theoretical and applied aspects of SIOAs, to contribute to this important endeavor.

Prof. Dr. Heming Jia
Prof. Dr. Gang Hu
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Biomimetics is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2200 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • swarm intelligence optimization algorithms
  • particle swarm optimization algorithm
  • optimization algorithms
  • meta-heuristics
  • swarm intelligence
  • engineering applications
  • engineering design problems
  • real-world applications
  • constraint handling
  • benchmarks
  • novel approaches
  • complicated optimization problems

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Related Special Issue

Published Papers (17 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

39 pages, 5643 KB  
Article
EODE-PFA: A Multi-Strategy Enhanced Pathfinder Algorithm for Engineering Optimization and Feature Selection
by Meiyan Li, Chuxin Cao and Mingyang Du
Biomimetics 2026, 11(1), 57; https://doi.org/10.3390/biomimetics11010057 - 8 Jan 2026
Viewed by 669
Abstract
The Pathfinder Algorithm (PFA) is a bionic swarm intelligence optimization algorithm inspired by simulating the cooperative movement of animal groups in nature to search for prey. Based on fitness, the algorithm classifies search individuals into leaders and followers. However, PFA fails to effectively [...] Read more.
The Pathfinder Algorithm (PFA) is a bionic swarm intelligence optimization algorithm inspired by simulating the cooperative movement of animal groups in nature to search for prey. Based on fitness, the algorithm classifies search individuals into leaders and followers. However, PFA fails to effectively balance the optimization capabilities of leaders and followers, leading to problems such as insufficient population diversity and slow convergence speed in the original algorithm. To address these issues, this paper proposes an enhanced pathfinder algorithm based on multi-strategy (EODE-PFA). Through the synergistic effects of multiple improved strategies, it effectively solves the balance problem between global exploration and local optimization of the algorithm. To verify the performance of EODE-PFA, this paper applies it to CEC2022 benchmark functions, three types of complex engineering optimization problems, and six sets of feature selection problems, respectively, and compares it with eight mature optimization algorithms. Experimental results show that in three different scenarios, EODE-PFA has significant advantages and competitiveness in both convergence speed and solution accuracy, fully verifying its engineering practicality and scenario universality. To highlight the synergistic effects and overall gains of multiple improved strategies, ablation experiments are conducted on key strategies. To further verify the statistical significance of the experimental results, the Wilcoxon signed-rank test is performed in this study. In addition, for feature selection problems, this study selects UCI real datasets with different real-world scenarios and dimensions, and the results show that the algorithm can still effectively balance exploration and exploitation capabilities in discrete scenarios. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

28 pages, 5335 KB  
Article
An Improved Red-Billed Blue Magpie Optimization Algorithm for 3D UAV Path Planning in Complex Terrain
by Yong Xu, Ning Xue and Yi Zhang
Biomimetics 2026, 11(1), 43; https://doi.org/10.3390/biomimetics11010043 - 6 Jan 2026
Cited by 1 | Viewed by 522
Abstract
This paper presents the Circle-Mapping Transition and Weighted Red-Billed Blue Magpie Optimizer (CTWRBMO), designed to address significant challenges in 3D path planning for drones. Although the original Red-Billed Blue Magpie Optimizer (RBMO) algorithm features a simple structure, few parameters, and strong local search [...] Read more.
This paper presents the Circle-Mapping Transition and Weighted Red-Billed Blue Magpie Optimizer (CTWRBMO), designed to address significant challenges in 3D path planning for drones. Although the original Red-Billed Blue Magpie Optimizer (RBMO) algorithm features a simple structure, few parameters, and strong local search capability, making it well-suited for UAV path optimization, it suffers from insufficient population diversity, limited global search ability, and a tendency to fall into local optima in complex high-dimensional scenarios. To overcome these limitations, four enhancement strategies are introduced. Firstly, the Circle chaotic mapping strategy leverages the randomness and ergodicity of chaotic sequences to generate an initial population that is uniformly distributed. This enhancement improves population diversity from the beginning and provides a solid foundation for global optimization. Secondly, the ε parameter is dynamically adjusted to prioritize local refinement during the early stages of optimization. This adjustment enables rapid convergence toward potentially optimal areas. This parameter increases to enhance global search capabilities as the algorithm progresses, thereby broadening the optimization space and achieving a dynamic equilibrium. Additionally, a nonlinear dynamic weighting factor (wd) is incorporated into the position update formula. The algorithm’s ability to escape local optima is significantly improved by dynamically altering the weight ratio between historical optimal positions and the current position. Furthermore, an elite perturbation mechanism based on individual neighborhoods is implemented to generate candidate solutions using local information. This mechanism enhances the algorithm’s local exploration capabilities and improves the stability of preserving optimal solutions, supported by a greedy criterion for optimal retention. Experimental results show that the CTWRBMO algorithm significantly outperforms comparison algorithms in terms of optimization accuracy and convergence speed, demonstrating exceptional global optimization capabilities. Additional applications in UAV 3D path planning simulations evaluated paths based on length, threat avoidance efficiency, and smoothness. The results indicate that paths planned using CTWRBMO are shorter, safer, and smoother compared to those generated by the Harrier Hawks Optimization (HHO), African Vulture Optimization Algorithm (AVOA), Artificial Bee Colony (ABC) Algorithm, and the traditional Magpie Algorithm, effectively meeting practical engineering requirements for UAV 3D path planning. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

38 pages, 16799 KB  
Article
CQLHBA: Node Coverage Optimization Using Chaotic Quantum-Inspired Leader Honey Badger Algorithm
by Xiaoliu Yang and Mengjian Zhang
Biomimetics 2025, 10(12), 850; https://doi.org/10.3390/biomimetics10120850 - 18 Dec 2025
Viewed by 581
Abstract
A key limitation of existing swarm intelligence (SI) algorithms for Node Coverage Optimization (NCO) is their inadequate solution accuracy. A novel chaotic quantum-inspired leader honey badger algorithm (CQLHBA) is proposed in this study. To enhance the performance of the basic HBA and better [...] Read more.
A key limitation of existing swarm intelligence (SI) algorithms for Node Coverage Optimization (NCO) is their inadequate solution accuracy. A novel chaotic quantum-inspired leader honey badger algorithm (CQLHBA) is proposed in this study. To enhance the performance of the basic HBA and better solve the numerical optimization and NCO problem, an adjustment strategy for parameter α1 to balance the optimization process of the follower position is used to improve the exploration ability. Moreover, the chaotic dynamic strategy, quantum rotation strategy, and Lévy flight strategy are employed to enhance the overall performance of the designed CQLHBA, especially for the exploitation ability of individuals. The performance of the proposed CQLHBA is verified using twenty-one benchmark functions and compared to that of other state-of-the-art (SOTA) SI algorithms, including the Honey Badger Algorithm (HBA), Chaotic Sea-Horse Optimizer (CSHO), Sine–Cosine Quantum Salp Swarm Algorithm (SCQSSA), Golden Jackal Optimization (GJO), Aquila Optimizer (AO), Butterfly Optimization Algorithm (BOA), Salp Swarm Algorithm (SSA), Grey Wolf Optimizer (GWO), and Randomised Particle Swarm Optimizer (RPSO). The experimental results demonstrate that the proposed CQLHBA exhibits superior performance, characterized by enhanced global search capability and robust stability. This advantage is further validated through its application to the NCO problem in wireless sensor networks (WSNs), where it achieves commendable outcomes in terms of both coverage rate and network connectivity, confirming its practical efficacy in real-world deployment scenarios. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

20 pages, 3862 KB  
Article
Hybrid ANFIS–MPA and FFNN–MPA Models for Bitcoin Price Forecasting
by Ceren Baştemur Kaya, Ebubekir Kaya and Eyüp Sıramkaya
Biomimetics 2025, 10(12), 827; https://doi.org/10.3390/biomimetics10120827 - 10 Dec 2025
Viewed by 870
Abstract
This study introduces two hybrid forecasting models that integrate the Marine Predators Algorithm (MPA) with Adaptive Neuro-Fuzzy Inference Systems (ANFIS) and Feed-Forward Neural Networks (FFNN) for short-term Bitcoin price prediction. Daily Bitcoin data from 2022 were converted into supervised time-series structures with multiple [...] Read more.
This study introduces two hybrid forecasting models that integrate the Marine Predators Algorithm (MPA) with Adaptive Neuro-Fuzzy Inference Systems (ANFIS) and Feed-Forward Neural Networks (FFNN) for short-term Bitcoin price prediction. Daily Bitcoin data from 2022 were converted into supervised time-series structures with multiple input configurations. The proposed hybrid models were evaluated against six well-known metaheuristic algorithms commonly used for training intelligent forecasting systems. The results show that MPA consistently yields lower prediction errors, faster convergence, and more stable optimization behavior compared with alternative algorithms. Both ANFIS-MPA and FFNN-MPA maintained their advantage across all tested structures, demonstrating reliable performance under varying model complexities. All experiments were repeated multiple times, and the hybrid approaches exhibited low variance, indicating robust and reproducible behavior. Overall, the findings highlight the effectiveness of MPA as an optimizer for improving the predictive performance of neuro-fuzzy and neural network models in financial time-series forecasting. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

30 pages, 2508 KB  
Article
An Enhanced Randomized Dung Beetle Optimizer for Global Optimization Problems
by Hui Yu, Mengyuan Xie and Zhanxi Zhou
Biomimetics 2025, 10(11), 727; https://doi.org/10.3390/biomimetics10110727 - 1 Nov 2025
Viewed by 951
Abstract
The Dung Beetle Optimizer (DBO) has shown promise in solving complex optimization problems, yet it often suffers from premature convergence and limited accuracy. To overcome these limitations, this paper proposes the Enhanced Reproductive Dung Beetle Optimizer (ERDBO). The ERDBO introduces a three-stage mechanism: [...] Read more.
The Dung Beetle Optimizer (DBO) has shown promise in solving complex optimization problems, yet it often suffers from premature convergence and limited accuracy. To overcome these limitations, this paper proposes the Enhanced Reproductive Dung Beetle Optimizer (ERDBO). The ERDBO introduces a three-stage mechanism: (1) a larval growth phase using experiential learning to enrich population diversity and improve global exploration; (2) a reproduction and nurturing phase that employs parent–offspring verification and a teaching strategy to strengthen local exploitation; and (3) a predator avoidance phase integrating Lévy flight and sinusoidal perturbations to enhance adaptability and accelerate convergence. The effectiveness of the proposed algorithm is assessed using the CEC2017 benchmark functions, where it is contrasted with several advanced metaheuristic approaches. The experimental findings highlight its advantages in terms of convergence rate, stability, and solution precision. Furthermore, the ERDBO is applied to three well-known engineering design tasks—namely the tension/compression spring, the three-bar truss, and the pressure vessel problem. The outcomes verify both its efficiency and applicability, indicating that the ERDBO provides a robust and competitive optimization framework for tackling challenging real-world engineering scenarios. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

58 pages, 10342 KB  
Article
An Enhanced Educational Competition Optimizer Integrating Multiple Mechanisms for Global Optimization Problems
by Na Li, Zi Miao, Sha Zhou, Haoxiang Zhou, Meng Wang and Zhenzhong Liu
Biomimetics 2025, 10(11), 719; https://doi.org/10.3390/biomimetics10110719 - 24 Oct 2025
Cited by 1 | Viewed by 1307
Abstract
The Educational Competition Optimizer (ECO) formulates search as a three-stage didactic process—primary, secondary and tertiary learning—but the original framework suffers from scarce information exchange, sluggish late-stage convergence and an unstable exploration–exploitation ratio. We present EECO, which introduces three synergistic mechanisms: a regenerative population [...] Read more.
The Educational Competition Optimizer (ECO) formulates search as a three-stage didactic process—primary, secondary and tertiary learning—but the original framework suffers from scarce information exchange, sluggish late-stage convergence and an unstable exploration–exploitation ratio. We present EECO, which introduces three synergistic mechanisms: a regenerative population strategy that uses the covariance matrix of elite solutions to maintain diversity, a Powell mechanism that accelerates exploitation within promising regions, and a trend-driven update that adaptively balances exploration and exploitation. EECO was evaluated on the 29 benchmark functions of CEC-2017 and nine real-world constrained engineering problems. Results show that EECO delivers higher solution accuracy and markedly smaller standard deviations than eight recent algorithms, including EDECO, ISGTOA, APSM-jSO, LSHADE-SPACMA, EOSMA, GLSRIME, EPSCA, and ESLPSO. Across the entire experimental battery, EECO consistently occupied the first place in the Friedman hierarchy: it attained average ranks of 2.138 in 10-D, 1.438 in 30-D, 1.207 in 50-D, and 1.345 in 100-D CEC-2017 benchmarks, together with 1.722 on the nine real-world engineering problems, corroborating its superior and dimension-scalable performance. The Wilcoxon rank sum test confirms the statistical significance of these improvements. With its remarkable convergence accuracy and reliable stability, EECO emerges as a promising variant of the ECO algorithm. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

23 pages, 2165 KB  
Article
An Enhanced Knowledge Salp Swarm Algorithm for Solving the Numerical Optimization and Seed Classification Tasks
by Qian Li and Yiwei Zhou
Biomimetics 2025, 10(9), 638; https://doi.org/10.3390/biomimetics10090638 - 22 Sep 2025
Viewed by 1321
Abstract
The basic Salp Swarm Algorithm (SSA) offers advantages such as a simple structure and few parameters. However, it is prone to falling into local optima and remains inadequate for seed classification tasks that involve hyperparameter optimization of machine learning classifiers such as Support [...] Read more.
The basic Salp Swarm Algorithm (SSA) offers advantages such as a simple structure and few parameters. However, it is prone to falling into local optima and remains inadequate for seed classification tasks that involve hyperparameter optimization of machine learning classifiers such as Support Vector Machines (SVMs). To overcome these limitations, an Enhanced Knowledge-based Salp Swarm Algorithm (EKSSA) is proposed. The EKSSA incorporates three key strategies: Adaptive adjustment mechanisms for parameters c1 and α to better balance exploration and exploitation within the salp population; a Gaussian walk-based position update strategy after the initial update phase, enhancing the global search ability of individuals; and a dynamic mirror learning strategy that expands the search domain through solution mirroring, thereby strengthening local search capability. The proposed algorithm was evaluated on thirty-two CEC benchmark functions, where it demonstrated superior performance compared to eight state-of-the-art algorithms, including Randomized Particle Swarm Optimizer (RPSO), Grey Wolf Optimizer (GWO), Archimedes Optimization Algorithm (AOA), Hybrid Particle Swarm Butterfly Algorithm (HPSBA), Aquila Optimizer (AO), Honey Badger Algorithm (HBA), Salp Swarm Algorithm (SSA), and Sine–Cosine Quantum Salp Swarm Algorithm (SCQSSA). Furthermore, an EKSSA-SVM hybrid classifier was developed for seed classification, achieving higher classification accuracy. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

58 pages, 35499 KB  
Article
Graduate Student Evolutionary Algorithm: A Novel Metaheuristic Algorithm for 3D UAV and Robot Path Planning
by Xiaoxuan Liu, Shaobo Li, Yongming Wu and Zijun Fu
Biomimetics 2025, 10(9), 616; https://doi.org/10.3390/biomimetics10090616 - 12 Sep 2025
Cited by 2 | Viewed by 1360
Abstract
In recent years, numerical optimization, UAVs, and robot path planning have become hot research topics. Solving these fundamental artificial intelligence problems is crucial for further advancements. However, traditional methods struggle with complex nonlinear problems, prompting researchers to explore intelligent optimization algorithms. Existing approaches, [...] Read more.
In recent years, numerical optimization, UAVs, and robot path planning have become hot research topics. Solving these fundamental artificial intelligence problems is crucial for further advancements. However, traditional methods struggle with complex nonlinear problems, prompting researchers to explore intelligent optimization algorithms. Existing approaches, however, still suffer from slow convergence, low accuracy, and poor robustness. Inspired by graduate students’ daily behavior, this paper proposes a novel intelligent optimization algorithm, the Graduate Student Evolutionary Algorithm (GSEA). By simulating key processes such as searching for research directions and concentrating on studies, a mathematical model of GSEA is established. The algorithm’s convergence behavior is analyzed qualitatively, and its performance is evaluated against competitive algorithms on the CEC2017 and CEC2022 test sets. Statistical tests confirm GSEA’s effectiveness and robustness. To further validate its practical applicability, GSEA is applied to UAV and robot path planning problems, with experimental results demonstrating its superiority in solving real-world optimization challenges. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

41 pages, 28333 KB  
Article
ACPOA: An Adaptive Cooperative Pelican Optimization Algorithm for Global Optimization and Multilevel Thresholding Image Segmentation
by YuLong Zhang, Jianfeng Wang, Xiaoyan Zhang and Bin Wang
Biomimetics 2025, 10(9), 596; https://doi.org/10.3390/biomimetics10090596 - 6 Sep 2025
Cited by 16 | Viewed by 1314
Abstract
Multi-threshold image segmentation plays an irreplaceable role in extracting discriminative structural information from complex images. It is one of the core technologies for achieving accurate target detection and regional analysis, and its segmentation accuracy directly affects the analysis quality and decision reliability in [...] Read more.
Multi-threshold image segmentation plays an irreplaceable role in extracting discriminative structural information from complex images. It is one of the core technologies for achieving accurate target detection and regional analysis, and its segmentation accuracy directly affects the analysis quality and decision reliability in key fields such as medical imaging, remote sensing interpretation, and industrial inspection. However, most existing image segmentation algorithms suffer from slow convergence speeds and low solution accuracy. Therefore, this paper proposes an Adaptive Cooperative Pelican Optimization Algorithm (ACPOA), an improved version of the Pelican Optimization Algorithm (POA), and applies it to global optimization and multilevel threshold image segmentation tasks. ACPOA integrates three innovative strategies: the elite pool mutation strategy guides the population toward high-quality regions by constructing an elite pool composed of the three individuals with the best fitness, effectively preventing the premature loss of population diversity; the adaptive cooperative mechanism enhances search efficiency in high-dimensional spaces by dynamically allocating subgroups and dimensions and performing specialized updates to achieve division of labor and global information sharing; and the hybrid boundary handling technique adopts a probabilistic hybrid approach to deal with boundary violations, balancing exploitation, exploration, and diversity while retaining more useful search information. Comparative experiments with eight advanced algorithms on the CEC2017 and CEC2022 benchmark test suites validate the superior optimization performance of ACPOA. Moreover, when applied to multilevel threshold image segmentation tasks, ACPOA demonstrates better accuracy, stability, and efficiency in solving practical problems, providing an effective solution for complex optimization challenges. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

52 pages, 8807 KB  
Article
DRIME: A Distributed Data-Guided RIME Algorithm for Numerical Optimization Problems
by Jinghao Yang, Yuanyuan Shao, Bin Fu and Lei Kou
Biomimetics 2025, 10(9), 589; https://doi.org/10.3390/biomimetics10090589 - 3 Sep 2025
Cited by 1 | Viewed by 1454
Abstract
To address the shortcomings of the RIME algorithm’s weak global exploration ability, insufficient information exchange among populations, and limited population diversity, this work proposes a distributed data-guided RIME algorithm called DRIME. First, this paper proposes a data-distribution-driven guided learning strategy that enhances information [...] Read more.
To address the shortcomings of the RIME algorithm’s weak global exploration ability, insufficient information exchange among populations, and limited population diversity, this work proposes a distributed data-guided RIME algorithm called DRIME. First, this paper proposes a data-distribution-driven guided learning strategy that enhances information exchange among populations and dynamically guides populations to exploit or explore. Then, a soft-rime search phase based on weighted averaging is proposed, which balances the development and exploration of RIME by alternating with the original strategy. Finally, a candidate pool is utilized to replace the optimal reference point of the hard-rime puncture mechanism to enrich the diversity of the population and reduce the risk of falling into local optima. To evaluate the performance of the DRIME algorithm, parameter sensitivity analysis, policy effectiveness analysis, and two comparative analyses are performed on the CEC-2017 test set and the CEC-2022 test set. The parameter sensitivity analysis identifies the optimal parameter settings for the DRIME algorithm. The strategy effectiveness analysis confirms the effectiveness of the improved strategies. In comparison with ACGRIME, TERIME, IRIME, DNMRIME, GLSRIME, and HERIME on the CEC-2017 test set, the DRIME algorithm achieves Friedman rankings of 1.517, 1.069, 1.138, and 1.069 in different dimensions. In comparison with EOSMA, GLS-MPA, ISGTOA, EMTLBO, LSHADE-SPACMA, and APSM-jSO on the CEC-2022 test set, the DRIME algorithm achieves Friedman rankings of 2.167 and 1.917 in 10 and 30 dimensions, respectively. In addition, the DRIME algorithm achieved an average ranking of 1.23 in engineering constraint optimization problems, far surpassing other comparison algorithms. In conclusion, the numerical optimization experiments successfully illustrate that the DRIME algorithm has excellent search capability and can provide satisfactory solutions to a wide range of optimization problems. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

26 pages, 7120 KB  
Article
An Improved Bionic Artificial Lemming Algorithm for Global Optimization and Cloud Task-Scheduling Problems
by Yuyong Tan, Jianfeng Wang and Bin Wang
Biomimetics 2025, 10(9), 572; https://doi.org/10.3390/biomimetics10090572 - 28 Aug 2025
Cited by 6 | Viewed by 1548
Abstract
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The [...] Read more.
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm has gradually emerged because of its unique structural design and efficient optimization performance and has been widely recognized by academic circles. However, in the face of more complex and challenging optimization and scheduling problems, it also exposed some obvious shortcomings. For example, the dispersion of the initial individual set in the algorithm is low, which leads to the low accuracy of the optimal solution. In addition, the exploitation ability of the algorithm is relatively weak, which leads to a slow convergence speed. Fortunately, this paper proposes an improved artificial lemming algorithm. Based on the in-depth analysis of the original algorithm, aiming at addressing the shortcomings of the original algorithm, some innovative mechanisms are introduced. In order to verify the effectiveness of the improved algorithm, a large number of experiments are carried out through global optimization test problems. The experimental results show that the performance of the algorithm has been obviously improved, and the accuracy and convergence speed of the solution are obviously better than the original algorithm and some baseline algorithms. In addition, this paper also applies the improved artificial travel algorithm to the cloud scheduling problem. These experimental results further verify the feasibility and effectiveness of this method in practical application and provide strong support for its application in a wider range of fields. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

39 pages, 4851 KB  
Article
Multi-Degree Reduction of Said–Ball Curves and Engineering Design Using Multi-Strategy Enhanced Coati Optimization Algorithm
by Feng Zou, Xia Wang, Weilin Zhang, Qingshui Shi and Huogen Yang
Biomimetics 2025, 10(7), 416; https://doi.org/10.3390/biomimetics10070416 - 26 Jun 2025
Cited by 3 | Viewed by 1351
Abstract
Within computer-aided geometric design (CAGD), Said–Ball curves are primarily adopted in domains such as 3D object skeleton modeling, vascular structure repair, and path planning, owing to their flexible geometric properties. Techniques for curve degree reduction seek to reduce computational and storage demands while [...] Read more.
Within computer-aided geometric design (CAGD), Said–Ball curves are primarily adopted in domains such as 3D object skeleton modeling, vascular structure repair, and path planning, owing to their flexible geometric properties. Techniques for curve degree reduction seek to reduce computational and storage demands while striving to maintain the essential geometric attributes of the original curve. This study presents a novel degree reduction model leveraging Euclidean distance and curvature data, markedly improving the preservation of geometric features throughout the reduction process. To enhance performance further, we propose a multi-strategy enhanced coati optimization algorithm (MSECOA). This algorithm utilizes a good point set combined with opposition-based learning to refine the initial population distribution, employs a fitness–distance equilibrium approach alongside a dynamic spiral search strategy to harmonize global exploration with local exploitation, and integrates an adaptive differential evolution mechanism to boost convergence rates and robustness. Experimental results demonstrate that the MSECOA outperforms nine highly cited agorithms in terms of convergence performance, solution accuracy, and stability. The algorithm exhibits superior behavior on the IEEE CEC2017 and CEC2022 benchmark functions and demonstrates strong practical utility across four engineering optimization problems with constraints. When applied to multi-degree reduction approximation of Said–Ball curves, the algorithm’s effectiveness is substantiated through four reduction cases, highlighting its superior precision and computational efficiency, thus providing a highly effective and accurate solution for complex curve degree reduction tasks. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

20 pages, 7815 KB  
Article
An Enhanced Snow Geese Optimizer Integrating Multiple Strategies for Numerical Optimization
by Baoqi Zhao, Yu Fang and Tianyi Chen
Biomimetics 2025, 10(6), 388; https://doi.org/10.3390/biomimetics10060388 - 11 Jun 2025
Cited by 2 | Viewed by 1355
Abstract
An enhanced snow geese algorithm (ESGA) is proposed to address the problems of the weakened population diversity and unbalanced search tendencies encountered by the snow geese algorithm (SGA) in the search process. First, an adaptive switching strategy is used to dynamically select the [...] Read more.
An enhanced snow geese algorithm (ESGA) is proposed to address the problems of the weakened population diversity and unbalanced search tendencies encountered by the snow geese algorithm (SGA) in the search process. First, an adaptive switching strategy is used to dynamically select the search strategy to balance the exploitation and exploration capabilities. Second, a dominant group guidance strategy is introduced to improve the population quality. Finally, a dominant stochastic difference search strategy is designed to enrich the population diversity and help it escape from the local optimum by co-directing effects in multiple directions. Ablation experiments were performed on the CEC2017 test set to illustrate the improvement mechanism and the degree of compatibility of their improved strategies. The proposed ESGA with a highly cited algorithm and the powerful improved algorithm are compared on the CEC2022 test suite, and the experimental results confirm that the ESGA outperforms the compared algorithms. Finally, the ability of the ESGA to solve complex problems is further highlighted by solving the robot path planning problem. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

40 pages, 8848 KB  
Article
Three Strategies Enhance the Bionic Coati Optimization Algorithm for Global Optimization and Feature Selection Problems
by Qingzheng Cao, Shuqi Yuan and Yi Fang
Biomimetics 2025, 10(6), 380; https://doi.org/10.3390/biomimetics10060380 - 7 Jun 2025
Cited by 2 | Viewed by 1030
Abstract
With the advancement of industrial digitization, utilizing large datasets for model training to boost performance is a pivotal technical approach for industry progress. However, raw training datasets often contain abundant redundant features, which increase model training’s computational cost and impair generalization ability. To [...] Read more.
With the advancement of industrial digitization, utilizing large datasets for model training to boost performance is a pivotal technical approach for industry progress. However, raw training datasets often contain abundant redundant features, which increase model training’s computational cost and impair generalization ability. To tackle this, this study proposes the bionic ABCCOA algorithm, an enhanced version of the bionic Coati Optimization Algorithm (COA), to improve redundant feature elimination in datasets. To address the bionic COA’s inadequate global search performance in feature selection (FS) problems, leading to lower classification accuracy, an adaptive search strategy is introduced. This strategy combines individual learning capability and the learnability of disparities, enhancing global exploration. For the imbalance between the exploration and exploitation phases in the bionic COA algorithm when solving FS problems, which often traps it in suboptimal feature subsets, a balancing factor is proposed. By integrating phase control and dynamic adjustability, a good balance between the two phases is achieved, reducing the likelihood of getting stuck in suboptimal subsets. Additionally, to counter the bionic COA’s insufficient local exploitation performance in FS problems, increasing classification error rates, a centroid guidance strategy is presented. By combining population centroid guidance and fractional-order historical memory, the algorithm lowers the classification error rate of feature subsets and speeds up convergence. The bionic ABCCOA algorithm was tested on the CEC2020 test functions and engineering problem, achieving an over 90% optimization success rate and faster convergence, confirming its efficiency. Applied to 27 FS problems, it outperformed comparative algorithms in best, average, and worst fitness function values, classification accuracy, feature subset size, and running time, proving it an efficient and robust FS algorithm. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

34 pages, 10238 KB  
Article
An Improved Northern Goshawk Optimization Algorithm for Mural Image Segmentation
by Jianfeng Wang, Zuowen Bao and Hao Dong
Biomimetics 2025, 10(6), 373; https://doi.org/10.3390/biomimetics10060373 - 5 Jun 2025
Cited by 4 | Viewed by 1420
Abstract
In the process of mural protection and restoration, using optimization algorithms for image segmentation is a common method for restoring mural details. However, existing optimization-based image segmentation methods often lack image segmentation quality. To alleviate the aforementioned issues, this paper proposes a mural [...] Read more.
In the process of mural protection and restoration, using optimization algorithms for image segmentation is a common method for restoring mural details. However, existing optimization-based image segmentation methods often lack image segmentation quality. To alleviate the aforementioned issues, this paper proposes a mural image segmentation algorithm based on OPBNGO by integrating the Northern Goshawk Optimization (NGO) algorithm with the off-center learning strategy, partitioned learning strategy, and Bernstein-weighted learning strategy. In OPBNGO, firstly, the off-center learning strategy is proposed, which effectively improves the global search ability of the algorithm by utilizing biased center individuals. Secondly, the partitioned learning strategy is introduced, which achieves a better balance between the exploration and development phases by applying diverse learning methods to the population. Finally, the Bernstein-weighted learning strategy is proposed, which effectively improves the algorithm’s development performance. Subsequently, the OPBNGO algorithm is applied to solve the image segmentation problem for eight mural images. Experimental results show that it achieves a winning rate of over 96.87% in terms of fitness function value, achieves a winning rate of over 93.75% in terms of FSIM, SSIM, and PSNR metrics, and can be considered a promising mural image segmentation algorithm. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

21 pages, 3019 KB  
Article
IPO: An Improved Parrot Optimizer for Global Optimization and Multilayer Perceptron Classification Problems
by Fang Li, Congteng Dai, Abdelazim G. Hussien and Rong Zheng
Biomimetics 2025, 10(6), 358; https://doi.org/10.3390/biomimetics10060358 - 2 Jun 2025
Cited by 5 | Viewed by 1402
Abstract
The Parrot Optimizer (PO) is a new optimization algorithm based on the behaviors of trained Pyrrhura Molinae parrots. In this paper, an improved PO (IPO) is proposed for solving global optimization problems and training the multilayer perceptron. The basic PO is enhanced by [...] Read more.
The Parrot Optimizer (PO) is a new optimization algorithm based on the behaviors of trained Pyrrhura Molinae parrots. In this paper, an improved PO (IPO) is proposed for solving global optimization problems and training the multilayer perceptron. The basic PO is enhanced by using three improvements, which are aerial search strategy, modified staying behavior, and improved communicating behavior. The aerial search strategy is derived from Arctic Puffin Optimization and is employed to enhance the exploration ability of PO. The staying behavior and communicating behavior of PO are modified using random movement and roulette fitness–distance balance selection methods to achieve a better balance between exploration and exploitation. To evaluate the optimization performance of the proposed IPO, twelve CEC2022 test functions and five standard classification datasets are selected for the experimental tests. The results between IPO and the other six well-known optimization algorithms show that IPO has superior performance for solving complex global optimization problems. The results between IPO and the other six well-known optimization algorithms show that IPO has superior performance for solving complex global optimization problems. In addition, IPO has been applied to optimize a multilayer perceptron model for classifying the oral English teaching quality evaluation dataset. An MLP model with a 10-21-3 structure is constructed for the classification of evaluation outcomes. The results show that IPO-MLP outperforms other algorithms with the highest classification accuracy of 88.33%, which proves the effectiveness of the developed method. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

41 pages, 10525 KB  
Article
An Innovative Differentiated Creative Search Based on Collaborative Development and Population Evaluation
by Xinyu Cai and Chaoyong Zhang
Biomimetics 2025, 10(5), 260; https://doi.org/10.3390/biomimetics10050260 - 23 Apr 2025
Cited by 22 | Viewed by 1677
Abstract
In real-world applications, many complex problems can be formulated as mathematical optimization challenges, and efficiently solving these problems is critical. Metaheuristic algorithms have proven highly effective in addressing a wide range of engineering issues. The differentiated creative search is a recently proposed evolution-based [...] Read more.
In real-world applications, many complex problems can be formulated as mathematical optimization challenges, and efficiently solving these problems is critical. Metaheuristic algorithms have proven highly effective in addressing a wide range of engineering issues. The differentiated creative search is a recently proposed evolution-based meta-heuristic algorithm with certain advantages. However, it also has limitations, including weakened population diversity, reduced search efficiency, and hindrance of comprehensive exploration of the solution space. To address the shortcomings of the DCS algorithm, this paper proposes a multi-strategy differentiated creative search (MSDCS) based on the collaborative development mechanism and population evaluation strategy. First, this paper proposes a collaborative development mechanism that organically integrates the estimation distribution algorithm and DCS to compensate for the shortcomings of the DCS algorithm’s insufficient exploration ability and its tendency to fall into local optimums through the guiding effect of dominant populations, and to improve the quality of the DCS algorithm’s search efficiency and solution at the same time. Secondly, a new population evaluation strategy is proposed to realize the coordinated transition between exploitation and exploration through the comprehensive evaluation of fitness and distance. Finally, a linear population size reduction strategy is incorporated into DCS, which significantly improves the overall performance of the algorithm by maintaining a large population size at the initial stage to enhance the exploration capability and extensive search of the solution space, and then gradually decreasing the population size at the later stage to enhance the exploitation capability. A series of validations was conducted on the CEC2018 test set, and the experimental results were analyzed using the Friedman test and Wilcoxon rank sum test. The results show the superior performance of MSDCS in terms of convergence speed, stability, and global optimization. In addition, MSDCS is successfully applied to several engineering constrained optimization problems. In all cases, MSDCS outperforms the basic DCS algorithm with fast convergence and strong robustness, emphasizing its superior efficacy in practical applications. Full article
(This article belongs to the Special Issue Advances in Swarm Intelligence Optimization Algorithms and Applications: 2nd Edition)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-17
Back to TopTop