A disassembly sequence planning method and system based on an improved ant colony algorithm

By improving the ant colony algorithm, introducing bidirectional digital coding rules and adaptive optimization operators, the problem of low dismantling efficiency in the recycling and dismantling of scrapped electric vehicles was solved, achieving high efficiency, low emissions and multi-objective optimization of the U-shaped dismantling line, and improving the quality and efficiency of dismantling sequence planning.

CN122334413APending Publication Date: 2026-07-03HEFEI UNIV OF TECH
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
HEFEI UNIV OF TECH
Filing Date
2026-04-07
Publication Date
2026-07-03

Smart Images

  • Figure CN122334413A_ABST
    Figure CN122334413A_ABST
Patent Text Reader

Abstract

This invention relates to the field of end-of-life electric vehicle recycling and dismantling, and discloses a dismantling sequence planning method and system based on an improved ant colony algorithm. The method includes: using the improved ant colony algorithm to iteratively solve a U-shaped dismantling line model; in the initial iteration, generating several U-shaped coded initial feasible sequences containing all dismantled parts; performing local optimization operations using adaptive roulette wheel selection and optimization operators on each U-shaped coded initial feasible sequence; selecting the maximum value from all fitness values ​​as the local optimum solution for this iteration, and simultaneously using the feasible sequence corresponding to the maximum value as the local optimum dismantling sequence for this iteration; comparing the local optimum solution for this iteration with the historical global optimum solution, and updating the global optimum solution and global pheromone; and outputting the final solution after completing the global pheromone update for the current iteration. This invention effectively perturbs the search path through the synergistic effect of multiple operators, significantly enhancing the algorithm's ability to escape local optima.
Need to check novelty before this filing date? Find Prior Art