Shubin Tan
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
Shubin Tan has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Jianchang Liu
School of Information Science and Engineering, Northeastern University, Shenyang, China
19 shared publications - Honghai Wang
College of Information Science and Engineering, National Frontiers Science Center for Industrial Intelligent and Systems Optimization, Northeastern University, Shenyang, China
8 shared publications - Wei Zhang
Northeastern Univ, Natl Frontiers Sci Ctr Ind Intelligent & Syst Opti, Shenyang, Peoples R China
4 shared publications - Yuanchao Liu
College of Information Science and Engineering, Northeastern University, Shenyang, China
4 shared publications - Pingsong Ming
Information Science and Engineering, and the State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, Liaoning, 110819, PR China
3 shared publications - Chuang Yang
College of Information Science and Engineering, and the National Frontiers Science Center for Industrial Intelligence and Systems Optimization, Northeastern University, Shenyang, China
2 shared publications
Latest Publications
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (7) , 6105-6116
A Reliable Resource Scheduling Method With Knowledge Transfer for Edge-Cloud Collaboration-Enabled Industrial Internet of Things
With the rapid development of industrial Internet of Things (IIoT), the edge-cloud collaboration architecture combining the powerful computing ability of cloud computing with the low latency of edge computing plays an increasingly important role in providing the computing resources and reducing the latency for IIoT. However, under this architecture, existing methods in scheduling the resources for IIoT often focus on latency and energy consumption but ignore some other important factors especially the reliable factor, thereby making it difficult for them to adapt to real-world IIoT scenarios. To this end, we propose a reliable resource scheduling method with knowledge transfer for edge-cloud collaboration-enabled IIoT. Specifically, we first model the resource scheduling as a many-objective optimization problem, considering these optimized objectives: latency, energy consumption, load balance, resource utilization, and trust measure between tasks and servers. Then, we develop a knowledge transfer accelerated clustering evolutionary algorithm (KTCEA) for many-objective optimization to solve the model, where the knowledge transfer aims at accelerating the evolution and the clustering makes the population converge from various directions. Under the collaboration of knowledge transfer and clustering, KTCEA can utilize the small population size to effectively search the objective space, and thus have the high real-time performance. Extensive experiment results on a benchmark test suite and the constructed model demonstrate that KTCEA is highly competitive compared with some advanced methods and our method can efficiently achieve the resource scheduling for edge-cloud collaboration-enabled IIoT, respectively.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (7) , 6105-6116
A Reliable Resource Scheduling Method With Knowledge Transfer for Edge-Cloud Collaboration-Enabled Industrial Internet of Things
With the rapid development of industrial Internet of Things (IIoT), the edge-cloud collaboration architecture combining the powerful computing ability of cloud computing with the low latency of edge computing plays an increasingly important role in providing the computing resources and reducing the latency for IIoT. However, under this architecture, existing methods in scheduling the resources for IIoT often focus on latency and energy consumption but ignore some other important factors especially the reliable factor, thereby making it difficult for them to adapt to real-world IIoT scenarios. To this end, we propose a reliable resource scheduling method with knowledge transfer for edge-cloud collaboration-enabled IIoT. Specifically, we first model the resource scheduling as a many-objective optimization problem, considering these optimized objectives: latency, energy consumption, load balance, resource utilization, and trust measure between tasks and servers. Then, we develop a knowledge transfer accelerated clustering evolutionary algorithm (KTCEA) for many-objective optimization to solve the model, where the knowledge transfer aims at accelerating the evolution and the clustering makes the population converge from various directions. Under the collaboration of knowledge transfer and clustering, KTCEA can utilize the small population size to effectively search the objective space, and thus have the high real-time performance. Extensive experiment results on a benchmark test suite and the constructed model demonstrate that KTCEA is highly competitive compared with some advanced methods and our method can efficiently achieve the resource scheduling for edge-cloud collaboration-enabled IIoT, respectively.
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (4) , 6393-6404
A Two-Stage Kalman Filter Method for State of Charge Estimation of Lithium-Ion Battery
The accurate state of charge (SOC) estimation of lithium-ion batteries (LIBs) is crucial for ensuring the safe operation of electric vehicles. This article proposes a two-stage Kalman filter (TS-KF) method for SOC estimation of LIBs. In the first stage, a Kalman filter (KF) algorithm is designed to obtain an adaptive estimate for fitting coefficients of open circuit voltage and SOC relationship, which facilitates its use in the measurement equation of the second stage. In the second stage, an adaptive cubature Kalman filter (ACKF) algorithm based on fractional-order model (FOM) is designed for SOC estimation, where FOM comprises a pair of resistance-constant elements and a Warburg element (FO-RCW). Multiswarm cooperative particle swarm optimizer (MCPSO) is employed to identify parameters of the FO-RCW model based on experimental data. An augmented state equation, which includes SOC and parameters, is constructed using the identified parameters as initial values and the augmented vector method. Then a TS-KF method is proposed to obtain a high-precision SOC estimation, and achieve parameter estimation in real-time. The effectiveness and superiority of TS-KF method is validated via experiments.
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (4) , 6393-6404
A Two-Stage Kalman Filter Method for State of Charge Estimation of Lithium-Ion Battery
The accurate state of charge (SOC) estimation of lithium-ion batteries (LIBs) is crucial for ensuring the safe operation of electric vehicles. This article proposes a two-stage Kalman filter (TS-KF) method for SOC estimation of LIBs. In the first stage, a Kalman filter (KF) algorithm is designed to obtain an adaptive estimate for fitting coefficients of open circuit voltage and SOC relationship, which facilitates its use in the measurement equation of the second stage. In the second stage, an adaptive cubature Kalman filter (ACKF) algorithm based on fractional-order model (FOM) is designed for SOC estimation, where FOM comprises a pair of resistance-constant elements and a Warburg element (FO-RCW). Multiswarm cooperative particle swarm optimizer (MCPSO) is employed to identify parameters of the FO-RCW model based on experimental data. An augmented state equation, which includes SOC and parameters, is constructed using the identified parameters as initial values and the augmented vector method. Then a TS-KF method is proposed to obtain a high-precision SOC estimation, and achieve parameter estimation in real-time. The effectiveness and superiority of TS-KF method is validated via experiments.
- 6 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 183
A state information driven evolutionary algorithm considering dimension influences for many-objective optimization
- 6 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 183
A state information driven evolutionary algorithm considering dimension influences for many-objective optimization
- 21 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (8) , 6579-6589
A Block Storage Optimization Method for Blockchain-Enabled Industrial Internet of Things
With the rapid development of 5G, numerous data is generated in the blockchain-enabled industrial Internet of Things (IIoT). Although these peers in the blockchain system have the storage ability, they are far from meeting the storage requirements of the generated data. In addition, all data is stored in the blockchain network, which is unfriendly to applications that require real-time information. To address the above storage problems, this article proposes a block storage optimization method for blockchain-enabled IIoT, whose core idea is to conditionally select some blocks to store in the cloud. This method firstly models the selection conditions of blocks as a many-objective optimization problem, where the selection conditions include using probability, storage cost, space occupation, and transmission cost. Then, a cascading selection-based evolutionary algorithm (CSEA) for many-objective optimization is developed to solve the model and thereby obtain the optimal blocks stored in the cloud, where CSEA adopts the diversity-first principle. Finally, CSEA is first compared with seven state-of-the-art methods on two benchmark test suites for validating its ability to obtain reliable experimental results, and then is used to solve the proposed model. The corresponding results demonstrate that CSEA has high competitiveness, and our method can effectively address the storage problems above. In summary, this article provides a novel method for addressing the storage problem in the blockchain-enabled IIoT.
- 21 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (8) , 6579-6589
A Block Storage Optimization Method for Blockchain-Enabled Industrial Internet of Things
With the rapid development of 5G, numerous data is generated in the blockchain-enabled industrial Internet of Things (IIoT). Although these peers in the blockchain system have the storage ability, they are far from meeting the storage requirements of the generated data. In addition, all data is stored in the blockchain network, which is unfriendly to applications that require real-time information. To address the above storage problems, this article proposes a block storage optimization method for blockchain-enabled IIoT, whose core idea is to conditionally select some blocks to store in the cloud. This method firstly models the selection conditions of blocks as a many-objective optimization problem, where the selection conditions include using probability, storage cost, space occupation, and transmission cost. Then, a cascading selection-based evolutionary algorithm (CSEA) for many-objective optimization is developed to solve the model and thereby obtain the optimal blocks stored in the cloud, where CSEA adopts the diversity-first principle. Finally, CSEA is first compared with seven state-of-the-art methods on two benchmark test suites for validating its ability to obtain reliable experimental results, and then is used to solve the proposed model. The corresponding results demonstrate that CSEA has high competitiveness, and our method can effectively address the storage problems above. In summary, this article provides a novel method for addressing the storage problem in the blockchain-enabled IIoT.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-12
A Comprehensive Monitoring Strategy for Multiphase Batch Processes: Dual Consideration Metrics and Bilateral Threshold Linkage Monitoring Framework
Multi-phase characteristics are inherent attributes in batch industrial processes. When dealing with multi-phase batch processes, not only do the complex variable relationships contained in different phases need to be considered, but also some small faults are prone to be masked by transition phases, presenting significant challenges to traditional process monitoring methods. To address these challenges, this paper proposes dual consideration metrics and bilateral threshold linkage monitoring (DCMs-BTLM) framework for multi-phase batch processes. Firstly, the application of a sliding window methodology facilitates the segmentation of batch data. Subsequently, the dissimilarity analysis is employed to scrutinize fluctuations in the correlation between adjacent windows. Next, the novel dual consideration metrics are established by integrating a proposed distance metric with the dissimilarity analysis. Finally, a bilateral threshold linkage monitoring framework is proposed to effectively achieve phase division and process monitoring. The DCMs-BTLM strategy adopts a dual-measurement approach, incorporating both distance and correlation metrics in the phase division section, thereby enabling a more rational demarcation of transition phases. Furthermore, the introduced bilateral threshold linkage monitoring framework not only effectively pinpoints transition phases of test batches, but also ensures a robust fault detection capability, thereby enhancing overall process control. The effectiveness of DCMs-BTLM is verified by the benchmark fed-batch penicillin fermentation process and semiconductor etching process.
- 11 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-12
A Comprehensive Monitoring Strategy for Multiphase Batch Processes: Dual Consideration Metrics and Bilateral Threshold Linkage Monitoring Framework
Multi-phase characteristics are inherent attributes in batch industrial processes. When dealing with multi-phase batch processes, not only do the complex variable relationships contained in different phases need to be considered, but also some small faults are prone to be masked by transition phases, presenting significant challenges to traditional process monitoring methods. To address these challenges, this paper proposes dual consideration metrics and bilateral threshold linkage monitoring (DCMs-BTLM) framework for multi-phase batch processes. Firstly, the application of a sliding window methodology facilitates the segmentation of batch data. Subsequently, the dissimilarity analysis is employed to scrutinize fluctuations in the correlation between adjacent windows. Next, the novel dual consideration metrics are established by integrating a proposed distance metric with the dissimilarity analysis. Finally, a bilateral threshold linkage monitoring framework is proposed to effectively achieve phase division and process monitoring. The DCMs-BTLM strategy adopts a dual-measurement approach, incorporating both distance and correlation metrics in the phase division section, thereby enabling a more rational demarcation of transition phases. Furthermore, the introduced bilateral threshold linkage monitoring framework not only effectively pinpoints transition phases of test batches, but also ensures a robust fault detection capability, thereby enhancing overall process control. The effectiveness of DCMs-BTLM is verified by the benchmark fed-batch penicillin fermentation process and semiconductor etching process.
- 5 November 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 167
A strengthened constrained-dominance based evolutionary algorithm for constrained many-objective optimization
- 5 November 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 167
A strengthened constrained-dominance based evolutionary algorithm for constrained many-objective optimization
- 12 June 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 162
A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization
- 12 June 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 162
A two-stage evolutionary algorithm assisted by multi-archives for constrained multi-objective optimization
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (4) , 6819-6832
A Fault Detection Method Based on the Dynamic k-Nearest Neighbor Model and Dual Control Chart
The incipient fault detection of a complex industrial process is a challenging problem for traditional dynamic detection methods. Traditional dynamic detection methods usually decouple the correlations among the variables and dynamic correlations simultaneously, which makes the two types of correlations mixed and may lead to performance deterioration in long-sequence dynamic detection. Some incipient faults may not change the amplitudes of process variables but change the long-sequence dynamic features. Based on the $T^{2}$ statistic and matrix multiplication transformation ( $T^{2}$ S-MMT), traditional dynamic detection methods can detect many faults effectively. However, the $T^{2}$ S-MMT can not effectively detect some incipient faults due to the above two types of correlations mixed. In order to overcome the shortcomings of $T^{2}$ S-MMT and improve the detection ability of some incipient faults, this paper proposes a fault detection method based on the dynamic k-nearest neighbor model and Dual Control Chart (DKNN-DCC), which can improve the incipient fault detection performance by using long-sequence dynamic detection. The proposed method is verified by the Tennessee Eastman (TE) process and the continuously stirred tank reactor (CSTR) process. The experimental results show the effectiveness of the proposed method in incipient fault detection compared with traditional dynamic detection methods. Note to Practitioners —This paper presents a novel incipient fault detection method, which directly mines the long-sequence dynamic abnormal information from the process variable and overcomes the problem of some abnormal information being submerged in the $T^{2}$ statistic calculated based on the matrix multiplication transformation. The proposed method can detect incipient faults that are not easily detected by some traditional methods and can help operators find the abnormal and avoid more serious losses. The structure of the proposed method jumps out of the frameworks of traditional dynamic detection methods, which is feasible to apply to different stable industrial processes.
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (4) , 6819-6832
A Fault Detection Method Based on the Dynamic k-Nearest Neighbor Model and Dual Control Chart
The incipient fault detection of a complex industrial process is a challenging problem for traditional dynamic detection methods. Traditional dynamic detection methods usually decouple the correlations among the variables and dynamic correlations simultaneously, which makes the two types of correlations mixed and may lead to performance deterioration in long-sequence dynamic detection. Some incipient faults may not change the amplitudes of process variables but change the long-sequence dynamic features. Based on the $T^{2}$ statistic and matrix multiplication transformation ( $T^{2}$ S-MMT), traditional dynamic detection methods can detect many faults effectively. However, the $T^{2}$ S-MMT can not effectively detect some incipient faults due to the above two types of correlations mixed. In order to overcome the shortcomings of $T^{2}$ S-MMT and improve the detection ability of some incipient faults, this paper proposes a fault detection method based on the dynamic k-nearest neighbor model and Dual Control Chart (DKNN-DCC), which can improve the incipient fault detection performance by using long-sequence dynamic detection. The proposed method is verified by the Tennessee Eastman (TE) process and the continuously stirred tank reactor (CSTR) process. The experimental results show the effectiveness of the proposed method in incipient fault detection compared with traditional dynamic detection methods. Note to Practitioners —This paper presents a novel incipient fault detection method, which directly mines the long-sequence dynamic abnormal information from the process variable and overcomes the problem of some abnormal information being submerged in the $T^{2}$ statistic calculated based on the matrix multiplication transformation. The proposed method can detect incipient faults that are not easily detected by some traditional methods and can help operators find the abnormal and avoid more serious losses. The structure of the proposed method jumps out of the frameworks of traditional dynamic detection methods, which is feasible to apply to different stable industrial processes.
- 25 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 72 (00189456) , 1-15
Toward Multimode Process Monitoring: A Scheme Based on Kernel Entropy Component Analysis
Modern industries are facing diverse market demands and exhibit typical multimode characteristics. In this context, not only common process characteristics such as non-linearity, non-Gaussianity and multiscale, become more prominent and complex, but also faults, especially small ones, are easily masked by normal process behaviors such as transition operations, which pose great challenges to traditional process monitoring methods. To address these challenges, this paper makes full use of the capability of kernel entropy component analysis (KECA) in capturing cluster structure and extracting data features, and proposes a monitoring scheme applicable to multimode processes. The scheme is formulated under a multi-model framework with Bayesian fusion. First, an improved fuzzy C-means (IFCM) clustering method based on KECA is presented for mode division and identification. Then, multiscale KECA (MSKECA) is developed for multivariate statistical modeling, and angle variance index (AVI) is designed for global-scale monitoring. Finally, a Bayesian inference probability (BIP) index that integrates the results of each unsupervised MSKECA-AVI monitoring model is constructed to determine the process status. The case study on the Tennessee Eastman process (TEP) with operational variability shows that the proposed scheme is effective, especially for small-magnitude faults and transition operations, and performs better overall than some state-of-the-art methods.
- 25 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 72 (00189456) , 1-15
Toward Multimode Process Monitoring: A Scheme Based on Kernel Entropy Component Analysis
Modern industries are facing diverse market demands and exhibit typical multimode characteristics. In this context, not only common process characteristics such as non-linearity, non-Gaussianity and multiscale, become more prominent and complex, but also faults, especially small ones, are easily masked by normal process behaviors such as transition operations, which pose great challenges to traditional process monitoring methods. To address these challenges, this paper makes full use of the capability of kernel entropy component analysis (KECA) in capturing cluster structure and extracting data features, and proposes a monitoring scheme applicable to multimode processes. The scheme is formulated under a multi-model framework with Bayesian fusion. First, an improved fuzzy C-means (IFCM) clustering method based on KECA is presented for mode division and identification. Then, multiscale KECA (MSKECA) is developed for multivariate statistical modeling, and angle variance index (AVI) is designed for global-scale monitoring. Finally, a Bayesian inference probability (BIP) index that integrates the results of each unsupervised MSKECA-AVI monitoring model is constructed to determine the process status. The case study on the Tennessee Eastman process (TEP) with operational variability shows that the proposed scheme is effective, especially for small-magnitude faults and transition operations, and performs better overall than some state-of-the-art methods.