Mingyang Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mingyang Yu has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Jing Xu
Nankai University
7 shared publications - Haorui Yang
School of Artificial Intelligence, Nankai University, Tianjin, China
3 shared publications Haorui Yang
Nankai University
2 shared publications- Haorui Yang
College of Artificial Intelligence, Nankai University, Tianjin, China
2 shared publications - Haoyuan He
School of Finance, Renmin University of China, Beijing 100872, China
2 shared publications - Huiling Chen
Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, China
2 shared publications
Latest Publications
- 25 September 2026
- Published by Springer Nature
- p. 365-375
OTFusion: Optimal Transport-Driven 3D Multi-modal Medical Image Fusion for Enhanced Cross-Modality Representation
- 25 September 2026
- Published by Springer Nature
- p. 365-375
OTFusion: Optimal Transport-Driven 3D Multi-modal Medical Image Fusion for Enhanced Cross-Modality Representation
- 8 September 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Graph-structured neighborhood shaping: A topology-aware graph-based mechanism for engineering optimization
- 8 September 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
Graph-structured neighborhood shaping: A topology-aware graph-based mechanism for engineering optimization
- Open Access
- 2 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2362
Quantum Computing and Adaptive Mechanism-Based Bounty Hunter Optimizer for Numerical Optimization and Bankruptcy Prediction
To improve the optimization performance of the original Bounty Hunter Optimizer (BHO) in complex search environments, this paper proposes a quantum computing and adaptive mechanism-based BHO, named QCAMBHO. The proposed algorithm integrates three complementary strategies: quantum-computing-enhanced initialization, adaptive Lévy flight, and an adaptive differential operator. These mechanisms are designed to improve population diversity, strengthen global exploration, and enhance later-stage exploitation. The performance of QCAMBHO is evaluated on the CEC2017 and CEC2022 benchmark test suites. Experimental results show that QCAMBHO achieves competitive or superior optimization performance compared with several advanced algorithms in terms of convergence accuracy, stability, and robustness. Ablation experiments further confirm the positive contribution of each strategy and the synergistic effect of their integration. To examine its practical applicability, QCAMBHO is further used to optimize the key parameters of Kernel Extreme Learning Machine (KELM), and a QCAMBHO-KELM model is constructed for enterprise bankruptcy prediction. The results show that QCAMBHO-KELM achieves better overall classification performance than BHO-KELM and other comparison models across multiple evaluation metrics, including accuracy, Matthews correlation coefficient, sensitivity, specificity, precision, recall, and F1-score. These findings indicate that QCAMBHO not only provides an effective optimizer for complex numerical problems but also offers a promising decision-support tool for improving the accuracy and reliability of enterprise bankruptcy early warning.
- 2 July 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2362
Open AccessQuantum Computing and Adaptive Mechanism-Based Bounty Hunter Optimizer for Numerical Optimization and Bankruptcy Prediction
To improve the optimization performance of the original Bounty Hunter Optimizer (BHO) in complex search environments, this paper proposes a quantum computing and adaptive mechanism-based BHO, named QCAMBHO. The proposed algorithm integrates three complementary strategies: quantum-computing-enhanced initialization, adaptive Lévy flight, and an adaptive differential operator. These mechanisms are designed to improve population diversity, strengthen global exploration, and enhance later-stage exploitation. The performance of QCAMBHO is evaluated on the CEC2017 and CEC2022 benchmark test suites. Experimental results show that QCAMBHO achieves competitive or superior optimization performance compared with several advanced algorithms in terms of convergence accuracy, stability, and robustness. Ablation experiments further confirm the positive contribution of each strategy and the synergistic effect of their integration. To examine its practical applicability, QCAMBHO is further used to optimize the key parameters of Kernel Extreme Learning Machine (KELM), and a QCAMBHO-KELM model is constructed for enterprise bankruptcy prediction. The results show that QCAMBHO-KELM achieves better overall classification performance than BHO-KELM and other comparison models across multiple evaluation metrics, including accuracy, Matthews correlation coefficient, sensitivity, specificity, precision, recall, and F1-score. These findings indicate that QCAMBHO not only provides an effective optimizer for complex numerical problems but also offers a promising decision-support tool for improving the accuracy and reliability of enterprise bankruptcy early warning.
- Open Access
Multi-Strategy Enhanced Beaver Behavior Optimizer for Global Optimization and Enterprise Bankruptcy Prediction
Enterprise bankruptcy prediction is a critical research issue in financial risk early warning, credit evaluation, and investment decision-making. To address the limitations of traditional methods in handling high-dimensional, nonlinear, and complex financial data, including parameter sensitivity, susceptibility to local optima, and insufficient prediction stability, this study proposes a multi-strategy enhanced Beaver Behavior Optimizer and applies it to optimize kernel extreme learning machines, constructing the MEBBO KELM prediction model. Three improvement mechanisms are introduced, including an elite pool enhanced exploration strategy, a stochastic centroid reverse learning strategy, and a leader guided boundary control strategy, which improve population diversity, global search capability, boundary handling capacity, and convergence accuracy. The proposed algorithm is evaluated on CEC2017 and CEC2022 benchmark datasets and compared with EWOA, HPHHO, MELGWO, TACPSO, CFOA, ALA, AOO, RIME, and BBO. Statistical analyses are conducted using the Wilcoxon rank sum test and the Friedman test. The results demonstrate that MEBBO achieves superior solution accuracy and stability, indicating strong global optimization capability and robustness. Further experiments on the Wieslaw Corporate Bankruptcy Dataset show that MEBBO-KELM achieves strong and robust performance across multiple evaluation metrics, including ACC, MCC, Sensitivity, Specificity, Precision, Recall, and F1 score. Specifically, ACC reaches 79.7578, MCC reaches 0.6050, and F1 score reaches 78.8504, confirming its effectiveness.
Open AccessMulti-Strategy Enhanced Beaver Behavior Optimizer for Global Optimization and Enterprise Bankruptcy Prediction
Enterprise bankruptcy prediction is a critical research issue in financial risk early warning, credit evaluation, and investment decision-making. To address the limitations of traditional methods in handling high-dimensional, nonlinear, and complex financial data, including parameter sensitivity, susceptibility to local optima, and insufficient prediction stability, this study proposes a multi-strategy enhanced Beaver Behavior Optimizer and applies it to optimize kernel extreme learning machines, constructing the MEBBO KELM prediction model. Three improvement mechanisms are introduced, including an elite pool enhanced exploration strategy, a stochastic centroid reverse learning strategy, and a leader guided boundary control strategy, which improve population diversity, global search capability, boundary handling capacity, and convergence accuracy. The proposed algorithm is evaluated on CEC2017 and CEC2022 benchmark datasets and compared with EWOA, HPHHO, MELGWO, TACPSO, CFOA, ALA, AOO, RIME, and BBO. Statistical analyses are conducted using the Wilcoxon rank sum test and the Friedman test. The results demonstrate that MEBBO achieves superior solution accuracy and stability, indicating strong global optimization capability and robustness. Further experiments on the Wieslaw Corporate Bankruptcy Dataset show that MEBBO-KELM achieves strong and robust performance across multiple evaluation metrics, including ACC, MCC, Sensitivity, Specificity, Precision, Recall, and F1 score. Specifically, ACC reaches 79.7578, MCC reaches 0.6050, and F1 score reaches 78.8504, confirming its effectiveness.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. PP (4) , 1-14
Carbon Footprint Efficiency Ratio: A Unified Indicator for Green Evaluation of Evolutionary Algorithms
Evolutionary algorithms (EAs) are widely adopted for black-box optimization, yet evaluation protocols remain largely accuracy-centric and often omit computational energy use, hindering carbon-aware deployment in green computing settings. We propose the Carbon Footprint Efficiency Ratio (CFER) to quantify optimization benefit per unit carbon emission and enable a unified assessment of carbon efficiency. To compute CFER without dedicated power-monitoring hardware, we develop a device-independent energy estimation model based on the Multimodal Energy Consumption Factor (MECF). Using a dataset constructed from 13 benchmark functions and 8 classical EAs, MECF is identified via outlier removal and Huber regression, achieving a mean estimation error of 1.80% and a maximum error of 2.51%. On the CEC2020 test suite, CFER-based comparisons reveal rankings that differ substantially from accuracy-only evaluations, highlighting algorithms that improve carbon efficiency with only marginal accuracy loss. Beyond metric-based assessment, we introduce a CFER-aware green optimization mechanism as an algorithm-agnostic plug-in control layer. Driven by real-time carbon estimation and marginal CFER feedback, it adaptively budgets computation through carbon-budget termination and population shrinking under low marginal carbon efficiency. Integrated into GA, DE, and PSO for uncrewed aerial vehicle (UAV) three-dimensional path planning, the resulting CFER-aware variants reduce CO2 emissions by 45.91%, 28.28%, and 59.14%, respectively, while increasing CFER by 78.59%, 32.45%, and 133.70%, respectively, yielding an improved performance–carbon trade-off with minor performance-score degradation. Overall, the proposed framework supports carbon-aware evaluation, algorithm selection, and adaptive computation budgeting for green AI systems.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. PP (4) , 1-14
Carbon Footprint Efficiency Ratio: A Unified Indicator for Green Evaluation of Evolutionary Algorithms
Evolutionary algorithms (EAs) are widely adopted for black-box optimization, yet evaluation protocols remain largely accuracy-centric and often omit computational energy use, hindering carbon-aware deployment in green computing settings. We propose the Carbon Footprint Efficiency Ratio (CFER) to quantify optimization benefit per unit carbon emission and enable a unified assessment of carbon efficiency. To compute CFER without dedicated power-monitoring hardware, we develop a device-independent energy estimation model based on the Multimodal Energy Consumption Factor (MECF). Using a dataset constructed from 13 benchmark functions and 8 classical EAs, MECF is identified via outlier removal and Huber regression, achieving a mean estimation error of 1.80% and a maximum error of 2.51%. On the CEC2020 test suite, CFER-based comparisons reveal rankings that differ substantially from accuracy-only evaluations, highlighting algorithms that improve carbon efficiency with only marginal accuracy loss. Beyond metric-based assessment, we introduce a CFER-aware green optimization mechanism as an algorithm-agnostic plug-in control layer. Driven by real-time carbon estimation and marginal CFER feedback, it adaptively budgets computation through carbon-budget termination and population shrinking under low marginal carbon efficiency. Integrated into GA, DE, and PSO for uncrewed aerial vehicle (UAV) three-dimensional path planning, the resulting CFER-aware variants reduce CO2 emissions by 45.91%, 28.28%, and 59.14%, respectively, while increasing CFER by 78.59%, 32.45%, and 133.70%, respectively, yielding an improved performance–carbon trade-off with minor performance-score degradation. Overall, the proposed framework supports carbon-aware evaluation, algorithm selection, and adaptive computation budgeting for green AI systems.
- Open Access
- 12 March 2026
- Published by MDPI AG in Electronics
- Vol. 15 (6) , 1186
Reinforced Arctic Puffin Optimization: A Multi-Strategy Fusion Approach with a Case Study in Manipulator Trajectory Planning
In agricultural automation, trajectory planning for fruit-picking robot arms must satisfy dynamic obstacle avoidance and real-time control constraints in complex orchards, forming a high-dimensional, constrained optimization problem. Due to strong nonlinearity and steep gradients, traditional planners often yield high-cost trajectories with unstable quality. This paper introduces a Reinforced Arctic Puffin Optimization (RAPO) algorithm for trajectory planning in high-dimensional, complex, constrained scenarios. RAPO improves Arctic Puffin Optimization (APO), which uses a two-stage foraging strategy but may suffer premature convergence, insufficient population diversity, and weak boundary handling. Dynamic fitness–distance balance (DFDB) adaptively coordinates exploration and exploitation. An elite-pool dynamic search strategy (DEPSS) combines t-distribution perturbation and Lévy flight to maintain diversity and enhance exploitation. A convex-lens opposition-learning boundary control method (CLOBC) improves out-of-bounds handling and reduces invalid search. Stochastic centroid opposition learning (SOBL) further suppresses premature convergence and expands coverage. On the CEC2017 benchmark (30/50/100 dimensions), RAPO outperforms nine algorithms in convergence speed and solution quality, verified by Wilcoxon and Friedman tests. In dense, narrow, and dynamic obstacle scenarios, RAPO achieves the lowest path cost, converges within 30 iterations, reduces variance, and generates smoother trajectories. This case study demonstrates RAPO’s robust mathematical performance, providing a robust and efficient framework for agricultural picking robots.
- 12 March 2026
- Published by MDPI AG in Electronics
- Vol. 15 (6) , 1186
Open AccessReinforced Arctic Puffin Optimization: A Multi-Strategy Fusion Approach with a Case Study in Manipulator Trajectory Planning
In agricultural automation, trajectory planning for fruit-picking robot arms must satisfy dynamic obstacle avoidance and real-time control constraints in complex orchards, forming a high-dimensional, constrained optimization problem. Due to strong nonlinearity and steep gradients, traditional planners often yield high-cost trajectories with unstable quality. This paper introduces a Reinforced Arctic Puffin Optimization (RAPO) algorithm for trajectory planning in high-dimensional, complex, constrained scenarios. RAPO improves Arctic Puffin Optimization (APO), which uses a two-stage foraging strategy but may suffer premature convergence, insufficient population diversity, and weak boundary handling. Dynamic fitness–distance balance (DFDB) adaptively coordinates exploration and exploitation. An elite-pool dynamic search strategy (DEPSS) combines t-distribution perturbation and Lévy flight to maintain diversity and enhance exploitation. A convex-lens opposition-learning boundary control method (CLOBC) improves out-of-bounds handling and reduces invalid search. Stochastic centroid opposition learning (SOBL) further suppresses premature convergence and expands coverage. On the CEC2017 benchmark (30/50/100 dimensions), RAPO outperforms nine algorithms in convergence speed and solution quality, verified by Wilcoxon and Friedman tests. In dense, narrow, and dynamic obstacle scenarios, RAPO achieves the lowest path cost, converges within 30 iterations, reduces variance, and generates smoother trajectories. This case study demonstrates RAPO’s robust mathematical performance, providing a robust and efficient framework for agricultural picking robots.
- 5 March 2026
- Published by Elsevier in Information Sciences
- Vol. 743
IKUN: A mean-field game theoretic KD-tree density guided mechanism for evolutionary algorithms
- 5 March 2026
- Published by Elsevier in Information Sciences
- Vol. 743
IKUN: A mean-field game theoretic KD-tree density guided mechanism for evolutionary algorithms
- Top Cited PapersOpen Access
- 26 January 2026
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 59 (3)
Alzheimer’s disease brain image segmentation using multi-feature fusion in 3D Rényi entropy model and quantum hybrid optimization
- 26 January 2026
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 59 (3)
Top Cited PapersOpen AccessAlzheimer’s disease brain image segmentation using multi-feature fusion in 3D Rényi entropy model and quantum hybrid optimization
- Top Cited Papers
- 2 January 2026
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 155
A reinforced quantum Aquila Optimizer for multi-threat 3D UAVs path planning in complex environments
- 2 January 2026
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 155
Top Cited PapersA reinforced quantum Aquila Optimizer for multi-threat 3D UAVs path planning in complex environments
- Open Access
OPAL: Operator-Programmed Algorithms for Landscape-Aware Black-Box Optimization
Black-box optimization often relies on evolutionary and swarm algorithms whose performance is highly problem dependent. We view an optimizer as a short program over a small vocabulary of search operators and learn this operator program separately for each problem instance. We instantiate this idea in Operator-Programmed Algorithms (OPAL), a landscape-aware framework for continuous black-box optimization that uses a small design budget with a standard differential evolution baseline to probe the landscape, builds a $k$-nearest neighbor graph over sampled points, and encodes this trajectory with a graph neural network. A meta-learner then maps the resulting representation to a phase-wise schedule of exploration, restart, and local search operators. On the CEC~2017 test suite, a single meta-trained OPAL policy is statistically competitive with state-of-the-art adaptive differential evolution variants and achieves significant improvements over simpler baselines under nonparametric tests. Ablation studies on CEC~2017 justify the choices for the design phase, the trajectory graph, and the operator-program representation, while the meta-components add only modest wall-clock overhead. Overall, the results indicate that operator-programmed, landscape-aware per-instance design is a practical way forward beyond ad hoc metaphor-based algorithms in black-box optimization.
Open AccessOPAL: Operator-Programmed Algorithms for Landscape-Aware Black-Box Optimization
Black-box optimization often relies on evolutionary and swarm algorithms whose performance is highly problem dependent. We view an optimizer as a short program over a small vocabulary of search operators and learn this operator program separately for each problem instance. We instantiate this idea in Operator-Programmed Algorithms (OPAL), a landscape-aware framework for continuous black-box optimization that uses a small design budget with a standard differential evolution baseline to probe the landscape, builds a $k$-nearest neighbor graph over sampled points, and encodes this trajectory with a graph neural network. A meta-learner then maps the resulting representation to a phase-wise schedule of exploration, restart, and local search operators. On the CEC~2017 test suite, a single meta-trained OPAL policy is statistically competitive with state-of-the-art adaptive differential evolution variants and achieves significant improvements over simpler baselines under nonparametric tests. Ablation studies on CEC~2017 justify the choices for the design phase, the trajectory graph, and the operator-program representation, while the meta-components add only modest wall-clock overhead. Overall, the results indicate that operator-programmed, landscape-aware per-instance design is a practical way forward beyond ad hoc metaphor-based algorithms in black-box optimization.