Wanlin Yang

Dr. Wanlin Yang


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
18 April 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
WYWanlin Yang
Wanlin Yang
ZLZixiang Li
Zixiang Li
CZChenyu Zheng
Chenyu Zheng
ZZZhang Zikai
Zhang Zikai
LZLiping Zhang
Liping Zhang
QTQiuhua Tang
Qiuhua Tang
Disassembly lines are widely utilized to disassemble end-of-life products. Most of the research focuses on the complete disassembly of obsolete products. However, there is a lack of studies on profit and on carbon emission saved. Hence, this study considers the multi-objective partial disassembly line balancing problem with AND/OR precedence relations to optimize profit, saved carbon emission and line balance simultaneously. Firstly, a multi-objective mixed-integer programming model is formulated, which could optimally solve the small number of instances with a single objective. Meanwhile, an improved multi-objective artificial bee colony algorithm is developed to generate a set of high-quality Pareto solutions. This algorithm utilizes two-layer encoding of the task permutation vector and the number of selected parts, and develops two-phase decoding to handle the precedence relation constraint and cycle time constraint. In addition, the modified employed bee phase utilizes the neighborhood operation, and the onlooker phase utilizes the crossover operator to achieve a diverse population. The modified scout phase selects a solution from the Pareto front to replace the abandoned individual to obtain a new high-quality solution. To test the performance of the proposed algorithm, the algorithm is compared with the multi-objective simulated annealing algorithm, the original multi-objective artificial bee colony algorithm and the well-known fast non-dominated genetic algorithm. The comparative study demonstrates that the proposed improvements enhance the performance of the method presented, and the proposed methodology outperforms all the compared algorithms.

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.