Lixin Cheng

Prof. Lixin Cheng


Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
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.

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.