Toward explicit control between exploration and exploitation in evolutionary algorithms: A case study of differential evolution

Z Cai, X Yang, MC Zhou, ZH Zhan, S Gao - Information Sciences, 2023 - Elsevier
Exploration and exploitation are two cornerstones of evolutionary algorithms. An appropriate
balance between exploration and exploitation can drive a search process toward global …

Symmetry and graph bi-regularized non-negative matrix factorization for precise community detection

Z Liu, X Luo, M Zhou - IEEE Transactions on Automation …, 2023 - ieeexplore.ieee.org
Community is a fundamental and highly desired pattern in a Large-scale Undirected
Network (LUN). Community detection is a vital issue when LUN representation learning is …

A length-adaptive non-dominated sorting genetic algorithm for Bi-objective high-dimensional feature selection

Y Gong, J Zhou, Q Wu, MC Zhou… - IEEE/CAA Journal of …, 2023 - ieeexplore.ieee.org
As a crucial data preprocessing method in data mining, feature selection (FS) can be
regarded as a bi-objective optimization problem that aims to maximize classification …

A Q-learning-based multi-objective evolutionary algorithm for integrated green production and distribution scheduling problems

Y Hou, H Wang, X Huang - Engineering Applications of Artificial …, 2024 - Elsevier
In recent years, integrated production and distribution scheduling (IPDS) has received
growing attention from academia and industry. With increasingly global economic activities …

Bi-trajectory hybrid search to solve bottleneck-minimized colored traveling salesman problems

Y Zhou, W Xu, M Zhou, ZH Fu - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
A bottleneck-minimized colored traveling salesman problem is an important variant of
colored traveling salesman problems. It is useful in handling the planning problems with …

A self-adapting and efficient dandelion algorithm and its application to feature selection for credit card fraud detection

H Zhu, MC Zhou, Y Xie… - IEEE/CAA Journal of …, 2024 - ieeexplore.ieee.org
A dandelion algorithm (DA) is a recently developed intelligent optimization algorithm for
function optimization problems. Many of its parameters need to be set by experience in DA …

Scheduling Multiobjective Dynamic Surgery Problems via -Learning-Based Meta-Heuristics

H Yu, K Gao, N Wu, MC Zhou… - … on Systems, Man …, 2024 - ieeexplore.ieee.org
This work addresses multiobjective dynamic surgery scheduling problems with considering
uncertain setup time and processing time. When dealing with them, researchers have to …

Multiobjective optimized deployment of edge-enabled wireless visual sensor networks for target coverage

X Zhu, M Zhou - IEEE Internet of Things Journal, 2023 - ieeexplore.ieee.org
In wireless visual sensor networks, the generation and transmission of huge amounts of
image data consume much energy of sensor nodes (SNs), and their routing and processing …

A dynamic-niching-based Pareto domination for multimodal multiobjective optimization

J Zou, Q Deng, Y Liu, X Yang, S Yang… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
Maintaining the diversity of the decision space is of great significance in multimodal
multiobjective optimization problems (MMOPs). Since the traditional Pareto-dominance …

FOLD: Fog-dew infrastructure-aided optimal workload distribution for cloud robotic operations

S Sarker, MT Arafat, A Lameesa, M Afrin, R Mahmud… - Internet of Things, 2024 - Elsevier
In our fast-paced, technology-driven world, multi-robot systems have emerged as crucial
solutions to tackle contemporary challenges, from industrial automation to disaster …