Hierarchical parallel search with automatic parameter configuration for particle swarm optimization

F Zhao, F Ji, T Xu, N Zhu - Applied Soft Computing, 2024 - Elsevier
Particle swarm optimization (PSO) has been widely applied in solving optimization
problems. Despite a multitude of PSO variants that have been proposed thus far, they still …

Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling

R Li, W Gong, L Wang, C Lu… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
With the development of the economy, distributed manufacturing has gradually become the
mainstream production mode. This work aims to solve the energy-efficient distributed flexible …

Information gain ratio-based subfeature grouping empowers particle swarm optimization for feature selection

J Gao, Z Wang, T Jin, J Cheng, Z Lei, S Gao - Knowledge-Based Systems, 2024 - Elsevier
Feature selection is a critical preprocessing step in machine learning with significant real-
world applications. Despite the widespread use of particle swarm optimization (PSO) for …

Cumulative Major Advances in Particle Swarm Optimization from 2018 to the Present: Variants, Analysis and Applications

D Zhu, R Li, Y Zheng, C Zhou, T Li, S Cheng - Archives of Computational …, 2025 - Springer
Abstract Particle Swarm Optimization (PSO) is a key tool in Artificial Intelligence, is well-
known to the public for its effectiveness in addressing complex and diverse problems. It …

Metaheuristics should be tested on large benchmark set with various numbers of function evaluations

AP Piotrowski, JJ Napiorkowski… - Swarm and Evolutionary …, 2025 - Elsevier
Numerical metaheuristics are often tested on mathematical problems collected into a
benchmark set. There are many benchmark sets, but the number of problems in a particular …

[HTML][HTML] Efficient self-learning evolutionary neural architecture search

Z Qiu, W Bi, D Xu, H Guo, H Ge, Y Liang, HP Lee… - Applied Soft …, 2023 - Elsevier
The evolutionary algorithm has become a major method for neural architecture search
recently. However, the fixed probability distribution employed by the traditional evolutionary …

Particle swarm optimization for hybrid mutant slime mold: An efficient algorithm for solving the hyperparameters of adaptive Grey-Markov modified model

G Hu, S Wang, J Zhang, EH Houssein - Information Sciences, 2025 - Elsevier
The grey prediction model is a scientific and effective prediction method for small amounts of
incomplete data. In this paper, we proposed a particle swarm optimization for mixed mutant …

Neural Architecture Search for Text Classification With Limited Computing Resources Using Efficient Cartesian Genetic Programming

X Wu, D Wang, H Chen, L Yan, Y Xiao… - IEEE Transactions …, 2023 - ieeexplore.ieee.org
CGP has often been applied for neural architecture search (NAS). However, the
performance of Cartesian genetic programming (CGP) is less than ideal when searching for …

An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem

K Tang, XF Wei, YH Jiang, ZW Chen, L Yang - Mathematics, 2023 - mdpi.com
The ant colony algorithm faces dimensional catastrophe problems when solving the large-
scale traveling salesman problem, which leads to unsatisfactory solution quality and …

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

X Wu, D Wang, L Wen, Y Xiao, C Wu, Y Wu… - arXiv preprint arXiv …, 2024 - arxiv.org
Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically
designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing …