Biomimetics· 2026Q2
An Intelligent Disassembly Sequence Optimisation Framework for End-of-Life EV Batteries Using Adaptive Operator Selection
- 1citations
- Q2SCImago
- 2026year
Short summary
A novel framework using a hard-constraint rule base, LinUCB, and the Bees Algorithm (BA) optimises disassembly sequences for end-of-life EV batteries, reducing the mean normalised weighted objective value by up to 39.01% compared to other methods.
AI-generated from the title and abstract; the full text is not read.
Key points
- A disassembly-oriented hard-constraint rule base ensures feasible disassembly sequences for EoL EV batteries.
- LinUCB adaptively selects operators based on the current search state to improve optimisation efficiency.
- The Bees Algorithm (BA) is employed with a weighted multi-criteria evaluation function (time, cost, utility).
- LinUCB-BA reduced the mean normalised weighted objective value by up to 39.01% (vs. SSO) and 28.12% (vs. TLBO) in a 27-component case.
AI-generated from the title and abstract; the full text is not read.
Abstract
End-of-life (EoL) electric vehicle (EV) batteries comprise numerous interconnected components with complex topological and precedence relationships. These constraints significantly increase the difficulty of disassembly sequence planning (DSP), as feasible sequences must satisfy multiple dependency requirements. Moreover, the large number of possible disassembly alternatives creates a vast search space, making sequence optimisation susceptible to combinatorial explosion and convergence to local optima. Therefore, effective DSP requires both robust constraint-handling mechanisms to ensure sequence feasibility and efficient optimisation strategies to identify high-quality solutions. To address these challenges, this paper proposes a disassembly sequence optimisation method that integrates a hard-constraint rule base, the linear upper confidence bound (LinUCB) algorithm, and the Bees Algorithm (BA). First, a disassembly-oriented hard-constraint rule base is developed to standardise the identification of component topological relationships and precedence constraints, thereby ensuring the generation of feasible disassembly sequences. A LinUCB-based contextual adaptive operator-selection mechanism is subsequently introduced to dynamically select neighbourhood operators according to the current search state. A weighted multi-criteria evaluation function incorporating disassembly time, payment cost, and human–robot utility is integrated into the BA. Two representative EoL-EV battery case studies with different levels of structural complexity are used for validation. Across 50 independent runs, LinUCB-BA reduced the mean normalised weighted objective value by 39.01% and 28.12% relative to simplified swarm optimisation (SSO) and teaching–learning-based optimisation (TLBO), respectively, in the 27-component case, and by 7.19% and 2.33% in the 16-component case. Compared with the enhanced discrete Bees Algorithm (EDBA) ablation baseline, further reductions of 1.98% and 0.43% were achieved, together with lower run-to-run variability. These results indicate that the proposed framework is effective for the two investigated battery disassembly scenarios, while broader validation across additional battery architectures and operating conditions remains necessary.
The authors' abstract, as published at the source. Biomimetics, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Industrial and Manufacturing Engineering
Industrial and Manufacturing EngineeringEngineering