Miao Rong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Miao Rong has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Dunwei Gong
Qingdao University of Science and Technology
7 shared publications - Yong Zhang
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221008, China
4 shared publications - Shengxiang Yang
De Montfort University
3 shared publications - Witold Pedrycz
University of Alberta
3 shared publications - Biao Xu
College of Engineering, Shantou University, Shantou, China
2 shared publications - Chen Peng
Shanghai University
2 shared publications
Latest Publications
- 15 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 322
A Q-learning driven prediction approach to dynamic constrained many-objective engineering system optimization
- 15 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 322
A Q-learning driven prediction approach to dynamic constrained many-objective engineering system optimization
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (4) , 3319-3329
Dynamic Multiobjective Optimization for Integrated Coal Mine Energy Systems With Streaming Constraints
Integrated coal mine energy systems (ICMES) generate streaming constraints where the number of active constraints fluctuates over time due to equipment switching, safety driven operations, and maintenance events. These dynamics cause abrupt contraction, expansion, or fragmentation of the feasible region. To address this challenge, we propose a federated learning (FL) variational autoencoder (VAE) evolutionary algorithm (FVE). Each constraint is mapped to an FL client so that local VAEs can learn heterogeneous constraint specific feasible subspaces as clients observe differently structured constraint data. Federated aggregation fuses these local latent models into a global generative model that adapts quickly and robustly to constraint inflow and outflow. An adaptive population correction mechanism repairs infeasible individuals, and enhanced dynamic dynamic nondominated sorting genetic algorithm-II tracks pareto front evolution under structural shifts. Comparative experiments on benchmark functions and an ICMES scheduling case demonstrate that FVE achieves faster feasibility restoration, improved convergence, and higher diversity than state-of-the-art methods. These results confirm the practicality of FVE for real-time industrial optimization under streaming constraints.
- 3 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (4) , 3319-3329
Dynamic Multiobjective Optimization for Integrated Coal Mine Energy Systems With Streaming Constraints
Integrated coal mine energy systems (ICMES) generate streaming constraints where the number of active constraints fluctuates over time due to equipment switching, safety driven operations, and maintenance events. These dynamics cause abrupt contraction, expansion, or fragmentation of the feasible region. To address this challenge, we propose a federated learning (FL) variational autoencoder (VAE) evolutionary algorithm (FVE). Each constraint is mapped to an FL client so that local VAEs can learn heterogeneous constraint specific feasible subspaces as clients observe differently structured constraint data. Federated aggregation fuses these local latent models into a global generative model that adapts quickly and robustly to constraint inflow and outflow. An adaptive population correction mechanism repairs infeasible individuals, and enhanced dynamic dynamic nondominated sorting genetic algorithm-II tracks pareto front evolution under structural shifts. Comparative experiments on benchmark functions and an ICMES scheduling case demonstrate that FVE achieves faster feasibility restoration, improved convergence, and higher diversity than state-of-the-art methods. These results confirm the practicality of FVE for real-time industrial optimization under streaming constraints.
- 27 September 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 298
Integration path coverage testing of the changing driver code guided by knowledge graph
- 27 September 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 298
Integration path coverage testing of the changing driver code guided by knowledge graph
- 24 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (4) , 1328-1342
A Prediction and Weak Coevolution-Based Dynamic Constrained Multiobjective Optimization
Dynamic multi-objective evolutionary algorithms (DMOEAs) have gained great popularity in dealing with dynamic multi-objective optimization problems (DMOPs). However, existing studies have difficulties in tackling DMOPs subject to (dynamic) constraints. In this paper, we propose a prediction and weak coevolutionary multi-objective optimization algorithm (PWDCMO) to handle dynamic constrained multi-objective optimization problems (DCMOPs), where a prediction strategy is employed to forecast potential optimal regions under the new environment, with a weak coevolutionary constrained multi-objective optimization (CCMO) as the optimizer aiming at balancing exploration and convergence. The proposed method is compared with four popular dynamic constrained multi-objective evolutionary algorithms (DCMOEAs) on six test instances from two various test suites with their convergence and the overall performance being discussed. Furthermore, the performance of the proposed prediction strategy is also investigated to observe its impact on the final results. Additionally, the PWDCMO is employed in the optimization of an integrated coal mine energy system (ICMES) to validate the proficiency in addressing real world problems. Experimental results demonstrate the superiority of PWDCMO.
- 24 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (4) , 1328-1342
A Prediction and Weak Coevolution-Based Dynamic Constrained Multiobjective Optimization
Dynamic multi-objective evolutionary algorithms (DMOEAs) have gained great popularity in dealing with dynamic multi-objective optimization problems (DMOPs). However, existing studies have difficulties in tackling DMOPs subject to (dynamic) constraints. In this paper, we propose a prediction and weak coevolutionary multi-objective optimization algorithm (PWDCMO) to handle dynamic constrained multi-objective optimization problems (DCMOPs), where a prediction strategy is employed to forecast potential optimal regions under the new environment, with a weak coevolutionary constrained multi-objective optimization (CCMO) as the optimizer aiming at balancing exploration and convergence. The proposed method is compared with four popular dynamic constrained multi-objective evolutionary algorithms (DCMOEAs) on six test instances from two various test suites with their convergence and the overall performance being discussed. Furthermore, the performance of the proposed prediction strategy is also investigated to observe its impact on the final results. Additionally, the PWDCMO is employed in the optimization of an integrated coal mine energy system (ICMES) to validate the proficiency in addressing real world problems. Experimental results demonstrate the superiority of PWDCMO.
- Open Access
- 1 January 2022
- Published by Acta Physico-Chimica Sinica & University Chemistry Editorial Office, Peking University in 大学化学
- p. 2201040
Fluorescence of Sugar-Coated Haws on a Stick: From Delicious Snack to Carbon Quantum Dots
- 1 January 2022
- Published by Acta Physico-Chimica Sinica & University Chemistry Editorial Office, Peking University in 大学化学
- p. 2201040
Open AccessFluorescence of Sugar-Coated Haws on a Stick: From Delicious Snack to Carbon Quantum Dots
- 27 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 24 (2) , 290-304
A Multimodel Prediction Method for Dynamic Multiobjective Evolutionary Optimization
A large number of prediction strategies are specific to a dynamic multi-objective optimization problem (DMOP) with only one type of the Pareto set (PS) change. However, a continuous DMOP with more than one type of the unknown PS change has been seldom investigated. We present a multi-model prediction approach (MMP) realized in the framework of evolutionary algorithms (EAs) to tackle the problem. In this paper, we first detect the type of the PS change, followed by the selection of an appropriate prediction model to provide an initial population for the subsequent evolution. To observe the influence of MMP on EAs, optimal solutions obtained by three classical dynamic multi-objective EAs with and without MMP are investigated. Furthermore, to investigate the performance of MMP, three state-of-the-art prediction strategies are compared on a large number of dynamic test instances under the same particle swarm optimizer. Experimental results demonstrate that the proposed approach outperforms its counterparts under comparison on most optimization problems.
- 27 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 24 (2) , 290-304
A Multimodel Prediction Method for Dynamic Multiobjective Evolutionary Optimization
A large number of prediction strategies are specific to a dynamic multi-objective optimization problem (DMOP) with only one type of the Pareto set (PS) change. However, a continuous DMOP with more than one type of the unknown PS change has been seldom investigated. We present a multi-model prediction approach (MMP) realized in the framework of evolutionary algorithms (EAs) to tackle the problem. In this paper, we first detect the type of the PS change, followed by the selection of an appropriate prediction model to provide an initial population for the subsequent evolution. To observe the influence of MMP on EAs, optimal solutions obtained by three classical dynamic multi-objective EAs with and without MMP are investigated. Furthermore, to investigate the performance of MMP, three state-of-the-art prediction strategies are compared on a large number of dynamic test instances under the same particle swarm optimizer. Experimental results demonstrate that the proposed approach outperforms its counterparts under comparison on most optimization problems.
- Open Access
- 23 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 19709-19725
Feature Selection and Its Use in Big Data: Challenges, Methods, and Trends
Feature selection has been an important research area in data mining, which chooses a subset of relevant features for use in model building. This paper aims to provide an overview of feature selection methods for big data mining. It first discusses the current challenges and difficulties faced when mining valuable information from big data. A comprehensive review of existing feature selection methods in big data is then presented. Herein, we approach the review from two aspects: methods specific to a particular kind of big data with certain characteristics and applications of methods in classification analysis, which are significantly different to the existing review work. The paper also highlights the current issues of feature selection in big data and suggests the future research directions.
- 23 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 19709-19725
Open AccessFeature Selection and Its Use in Big Data: Challenges, Methods, and Trends
Feature selection has been an important research area in data mining, which chooses a subset of relevant features for use in model building. This paper aims to provide an overview of feature selection methods for big data mining. It first discusses the current challenges and difficulties faced when mining valuable information from big data. A comprehensive review of existing feature selection methods in big data is then presented. Herein, we approach the review from two aspects: methods specific to a particular kind of big data with certain characteristics and applications of methods in classification analysis, which are significantly different to the existing review work. The paper also highlights the current issues of feature selection in big data and suggests the future research directions.
- 19 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 49 (9) , 3362-3374
Multidirectional Prediction Approach for Dynamic Multiobjective Optimization Problems
Various real-world multiobjective optimization problems are dynamic, requiring evolutionary algorithms (EAs) to be able to rapidly track the moving Pareto front of an optimization problem once an environmental change occurs. To this end, several methods have been developed to predict the new location of the moving Pareto set (PS) so that the population can be reinitialized around the predicted location. In this paper, we present a multidirectional prediction strategy to enhance the performance of EAs in solving a dynamic multiobjective optimization problem (DMOP). To more accurately predict the moving location of the PS, the population is clustered into a number of representative groups by a proposed classification strategy, where the number of clusters is adapted according to the intensity of the environmental change. To examine the performance of the developed algorithm, the proposed prediction strategy is compared with four state-of-the-art prediction methods under the framework of particle swarm optimization as well as five popular EAs for dynamic multiobjective optimization. Our experimental results demonstrate that the proposed algorithm can effectively tackle DMOPs.
- 19 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 49 (9) , 3362-3374
Multidirectional Prediction Approach for Dynamic Multiobjective Optimization Problems
Various real-world multiobjective optimization problems are dynamic, requiring evolutionary algorithms (EAs) to be able to rapidly track the moving Pareto front of an optimization problem once an environmental change occurs. To this end, several methods have been developed to predict the new location of the moving Pareto set (PS) so that the population can be reinitialized around the predicted location. In this paper, we present a multidirectional prediction strategy to enhance the performance of EAs in solving a dynamic multiobjective optimization problem (DMOP). To more accurately predict the moving location of the PS, the population is clustered into a number of representative groups by a proposed classification strategy, where the number of clusters is adapted according to the intensity of the environmental change. To examine the performance of the developed algorithm, the proposed prediction strategy is compared with four state-of-the-art prediction methods under the framework of particle swarm optimization as well as five popular EAs for dynamic multiobjective optimization. Our experimental results demonstrate that the proposed algorithm can effectively tackle DMOPs.