Dayong Han

Dr. Dayong Han

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 September 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
DHDayong Han
Dayong Han
QTQiuhua Tang
Qiuhua Tang
ZZZhang Zikai
Zhang Zikai
ZLZixiang Li
Zixiang Li
Steelmaking and the continuous-casting (SCC) scheduling problem is a realistic hybrid flow shop scheduling problem with continuous-casting production at the last stage. This study considers the SCC scheduling problem with diverse products, which is a vital and difficult problem in steel plants. To tackle this problem, this study first presents the mixed-integer linear programming (MILP) model to minimize the objective of makespan. Then, an improved migrating birds optimization algorithm (IMBO) is proposed to tackle this considered NP-hard problem. In the proposed IMBO, several improvements are employed to achieve the proper balance between exploration and exploitation. Specifically, a two-level decoding procedure is designed to achieve feasible solutions; the simulated annealing-based acceptance criterion is employed to ensure the diversity of the population and help the algorithm to escape from being trapped in local optima; a competitive mechanism is developed to emphasize exploitation capacity by searching around the most promising solution space. The computational experiments demonstrate that the proposed IMBO obtains competing performance and it outperforms seven other implemented algorithms in the comparative study.

24 July 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SRShangyi Ren
Shangyi Ren
DHDayong Han
Dayong Han
ZLZixiang Li
Zixiang Li
CZChenyu Zheng
Chenyu Zheng
LZLiping Zhang
Liping Zhang
QTQiuhua Tang
Qiuhua Tang
Remaining useful life (RUL) prediction is critical for improving reliability and supporting predictive maintenance in aero-engine systems. However, existing methods have limitations in jointly modeling the spatial correlations between multi-sensor signals and the temporal evolution characteristics of the degradation process. Hence, this study develops a knowledge-enhanced spatiotemporal framework for system-level aero-engine RUL prediction. Firstly, a graph based on the Pearson correlation coefficient (PCC) is constructed from monitoring data to capture data-driven dependencies among sensors. Afterwards, a thermodynamic-cycle-mechanism prior is incorporated into the PCC-based graph through the Hadamard product, forming a knowledge-enhanced graph that emphasizes physically meaningful sensor relationships. Subsequently, an enhanced graph attention module is designed to extract discriminative spatial representations from the knowledge-enhanced graph. Furthermore, relational representations between adjacent time steps are constructed to capture implicit temporal correlations and local degradation dynamics. Finally, a dual-stream GRU with an attention mechanism is employed to model the fused feature stream and relational feature stream for RUL prediction. Experiments on the CMAPSS and N-CMAPSS datasets demonstrate that the proposed method achieves competitive and overall superior performance compared with nine state-of-the-art methods. KESTF achieves the best average RMSE/Score of 12.83/580 on CMAPSS and 5.94/3468 on N-CMAPSS, validating its effectiveness and robustness.

28 August 2026 in Batteries
Verified
Journal Article
Open access
PDF file
CSChengxiang Song
Chengxiang Song
DHDayong Han
Dayong Han
ZLZixiang Li
Zixiang Li
LCLixin Cheng
Lixin Cheng
ZZZhang Zikai
Zhang Zikai
LZLiping Zhang
Liping Zhang
Accurate prediction of the remaining useful life (RUL) of lithium-ion batteries is essential for operational safety and predictive maintenance. However, accurate RUL estimation from incomplete degradation trajectories remains challenging because of limited observable history, nonlinear capacity degradation, local fluctuations, and error accumulation during long-term forecasting. This study proposes GLF-Former, a Transformer-based framework with a global–local dual-branch architecture for battery capacity and RUL prediction. The global branch represents long-term degradation trends, whereas the local branch focuses on short-term capacity variations. A structure-aware attention (SAA) module and an aligned channel-fusion (ACF) module are further introduced to enhance global–local feature interaction and adaptively recalibrate the fused degradation representations. The proposed model was evaluated on representative cells from the CALCE, NASA, and TJU public datasets under multiple prediction starting points. Across the 12 evaluated cell starting point settings, GLF-Former achieved capacity-prediction MAE values of 0.0019–0.0068 Ah and RMSE values of 0.0026–0.0152 Ah, with R2 values ranging from 0.9644 to 0.9997. The corresponding mean AE values ranged from 0.4 to 1.1 cycles across the evaluated settings. The results demonstrate that GLF-Former achieves competitive capacity-prediction and RUL-estimation performance under the evaluated settings, particularly when the available degradation history is limited.

1 October 2026 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
BYBo Yuan
Bo Yuan
ZCZhengyan Chen
Zhengyan Chen
YYYujin Yuan
Yujin Yuan
DHDayong Han
Dayong Han
The steelmaking-continuous casting production scheduling problem is a typical multi-stage, multi-constraint hybrid flow shop problem. For this problem, a two-stage planning method based on benders decomposition is proposed, and the problem is decomposed into two subproblems: batch planning scheduling based on pouring times and time preparation scheduling based on furnace times, and a mathematical linear programming model based on a specific unit event point is established with the objectives of minimizing the total processing time of the casting machine and minimizing the maximum completion time, respectively. For problem solving, a two-stage genetic algorithm based on bender decomposition is designed, combined with the parallel backward preparation method, to realize the scheduling of pouring schedule in the continuous casting stage and the processing schedule of furnace in each process, respectively. Finally, simulation experiments based on actual steel production data show that the proposed two-stage planning method based on bender decomposition can effectively solve this production scheduling problem.

4 September 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
WYWanlin Yang
Wanlin Yang
DHDayong Han
Dayong Han
ZLZixiang Li
Zixiang Li
ZZZhang Zikai
Zhang Zikai
LCLixin Cheng
Lixin Cheng
LZLiping Zhang
Liping Zhang
The U-shaped Disassembly Line Balancing Problem (UDLBP) is a challenging combinatorial optimization problem for which efficient solution approaches remain limited. This study proposes an efficient branch-bound-and-remember (BBR) algorithm that integrates a memory-based mechanism and U-shaped dominance rules to effectively reduce the search space. Specifically, a new branching method, an additional lower bounding method, and new dominance rules are developed to suit the UDLBP, and different search strategies are developed and explored. Extensive computational experiments are conducted on a comprehensive set of benchmark instances to evaluate the performance of the proposed approach. The results demonstrate that the proposed BBR algorithm can consistently identify the best-known solutions for the evaluated benchmark instances. Compared with constraint programming, mixed-integer linear programming, and several state-of-the-art metaheuristic algorithms, the proposed approach achieves competitive solution quality and computational efficiency, consistently matching the best-known solutions with an average recorded CPU time of 0.0199 s under the 500 s computational setting. These findings indicate that the proposed algorithm provides an efficient optimization framework for solving UDLBP, achieving high-quality solutions with substantially low computational cost.