98%
921
2 minutes
20
Superb Fairy-wren Optimization Algorithm (SFOA) is an animal-based meta-heuristic algorithm derived from Fairy-wren's behavior of growing, feeding, and avoiding natural enemies. The SFOA has some shortcomings when facing complex environments. Its switching mechanism is not enough to adapt to complex optimization problems, and it faces a weakening of population diversity in the late stage of optimization, leading to a higher possibility of falling into local optima. In addition, its global search ability needs to be improved. To address the above deficiencies, this paper proposes an Adaptive Superb Fairy-wren Optimization Algorithm (ASFOA). To assess the ability of the proposed ASFOA, three groups of experiments are conducted in this paper. Firstly, the effectiveness of the proposed improved strategies is checked on the CEC2018 test set. Second, the ASFOA is compared with eight classical/highly cited/newly proposed metaheuristics on the CEC2018 test set, in which the ASFOA performed the best overall, with average rankings of 1.621, 1.138, 1.483, and 1.966 in the four-dimensional cases, respectively. Then the convergence and robustness of ASFOA is verified on the CEC2022 test set. The experimental results indicate that the proposed ASFOA is a competitive metaheuristic algorithm variant with excellent performance in terms of convergence and distribution of solutions. In addition, we further validate the ability of ASFOA to solve real optimization problems. The average ranking of the proposed ASFOA on 10 engineering constrained optimization problems is 1.500. In summary, ASFOA is a promising variant of metaheuristic algorithms.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC12383383 | PMC |
http://dx.doi.org/10.3390/biomimetics10080496 | DOI Listing |
iScience
September 2025
School of Biology and Biological Engineering, South China University of Technology, Guangzhou, Guangdong 510006, China.
Deep learning has rapidly emerged as a promising toolkit for protein optimization, yet its success remains limited, particularly in the realm of activity. Moreover, most algorithms lack rigorous iterative evaluation, a crucial aspect of protein engineering exemplified by classical directed evolution. This study introduces DeepDE, a robust iterative deep learning-guided algorithm leveraging triple mutants as building blocks and a compact library of ∼1,000 mutants for training.
View Article and Find Full Text PDFiScience
September 2025
Energy Conversion Research Center, Electrical Materials Research Division, Korea Electrotechnology Research Institute, Changwon, Gyeongsangnam-do 51543, Republic of Korea.
Indoor photovoltaics (IPVs) are small and not optimized for versatile environments, making them environmentally sensitive. To expand the application of energy-harvesting photovoltaics, overcoming the current problems and mismatch loss is important. In this study, we found that IPVs are sensitive to changes in current density under low illuminance, and we introduced a protocol to reveal the modules resulting in the smallest standard deviation using current maps.
View Article and Find Full Text PDFJ Appl Stat
February 2025
Department of Mathematics and State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, People's Republic of China.
We conduct gene mutation rate estimations via developing mutual information and Ewens sampling based convolutional neural network (CNN) and machine learning algorithms. More precisely, we develop a systematic methodology through constructing a CNN. Meanwhile, we develop two machine learning algorithms to study protein production with target gene sequences and protein structures.
View Article and Find Full Text PDFPatterns (N Y)
July 2025
Cedars-Sinai Medical Center, Los Angeles, CA, USA.
The tree-based pipeline optimization tool (TPOT) is one of the earliest automated machine learning (ML) frameworks developed for optimizing ML pipelines, with an emphasis on addressing the complexities of biomedical research. TPOT uses genetic programming to explore a diverse space of pipeline structures and hyperparameter configurations in search of optimal pipelines. Here, we provide a comparative overview of the conceptual similarities and implementation differences between the previous and latest versions of TPOT, focusing on two key aspects: (1) the representation of ML pipelines and (2) the underlying algorithm driving pipeline optimization.
View Article and Find Full Text PDFMed Phys
September 2025
Department of Radiation Oncology, Mayo Clinic in Florida, Jacksonville, Florida, USA.
Background: Dose-driven continuous scanning (DDCS) enhances the efficiency and precision of proton pencil beam delivery by reducing beam pauses inherent in discrete spot scanning (DSS). However, current DDCS optimization studies using traveling salesman problem (TSP) formulations often rely on fixed beam intensity and computationally expensive interpolation for move spot generation, limiting efficiency and methodological robustness.
Purpose: This study introduces a Break Spot-Guided (BSG) method, combined with two acceleration strategies-dose rate skipping and bounding-to optimize beam intensity while minimizing beam delivery time (BDT).