Disassembly sequence planning based on a modified grey wolf optimizer

Jin Xie, Xinyu Li, Liang Gao

TL;DR

Researchers have developed a Modified Grey Wolf Optimizer (MGWO) to solve the complex, NP-hard problem of Disassembly Sequence Planning (DSP). By introducing specialized operators for feasibility and search, the algorithm significantly outperforms traditional meta-heuristics in finding the most efficient, cost-effective, and stable ways to disassemble end-of-life products.

What Problem Does This Paper Address?

As modern products reach their "end-of-life" (EOL), the manufacturing industry faces a massive challenge: how do we take them apart efficiently for recycling and remanufacturing? This isn't just about unscrewing bolts; it’s a high-stakes puzzle called Disassembly Sequence Planning (DSP).

The goal is to find a sequence that minimizes disassembly time, tool changes, and material mixing while maximizing the stability of the product during the process. Because the number of possible sequences grows exponentially with the number of components, DSP is a classic NP-hard combinatorial optimization problem. Traditional exact algorithms fail as products get complex, and existing "intelligence algorithms" often require tedious parameter tuning that doesn't adapt well to different types of hardware.

Methods

The authors propose the Modified Grey Wolf Optimizer (MGWO), building on the original Grey Wolf Optimizer (GWO) which mimics the social hierarchy and hunting behavior of wolves.

Standard GWO is designed for continuous math problems, so the authors introduced three novel operators to make it work for the discrete, constraint-heavy world of mechanical disassembly:

  1. Feasible Solution Generator (FSG): Mechanical parts have "precedence constraints" (you can't remove a piston before the engine head). FSG uses a decimal interference matrix to ensure every generated sequence is actually physically possible.
  2. Neighborhood Search Operator (NSO): This allows the "leader wolves" ($\alpha, \beta$, and a newly generated $\delta$) to self-evolve. It randomly re-inserts components within a valid range to find local improvements in the sequence.
  3. Guided Search Operator (GSO): This manages the global search. It uses self-adaptive factors based on fitness values to determine how much the rest of the "pack" should be influenced by the three leaders.

The algorithm evaluates sequences using a multi-indicator fitness function that weights four factors: changes in disassembly direction, tool changes, material changes (to group similar recyclables), and structural stability.

Datasets

The paper evaluates the MGWO using three distinct engineering benchmarks:

  • Case 1: A Vise (11 components): A standard test case to verify the effectiveness of the modified strategies.
  • Case 2: A Ball Valve (17 components): A more complex assembly used to measure the algorithm's significance and robustness.
  • Case 3: Azimuth Thruster Propeller (17 components): A real-world industrial application from a Chinese boat company, representing a high-value product where efficient recovery is economically vital.

Key Insights and Ideas

  • The "Delta" Wolf Innovation: In standard GWO, the $\delta$ wolf is simply the third-best solution. In this paper, the $\delta$ wolf is a newly generated feasible solution. This prevents the pack from getting stuck in "local optima" (good-but-not-great solutions) by maintaining population diversity.
  • Self-Adaptive Parameters: Unlike algorithms like Particle Swarm Optimization (PSO) or Genetic Algorithms (GA), which require manual tuning of inertia weights or mutation rates, MGWO’s parameters are self-adaptive based on the fitness of the wolves. This makes it much more robust for different types of machinery.
  • Balancing Local and Global Search: The combination of NSO (local refinement) and GSO (global pack movement) allows the algorithm to converge on the optimal solution much faster than its predecessors.

Key Results

The MGWO was compared against five major algorithms: Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simplified Swarm Optimization (SSO), Teaching-Learning-Based Optimization (TLBO), and Improved Harmony Search (IHS).

  • Higher Reliability: For the Vise case, MGWO found the optimal solution with a 63.33% probability, while GA and ACO only managed 13.33% and 16.67%, respectively.
  • Superior Convergence: In all cases, MGWO reached the optimal fitness value (e.g., 3.7500 for the ball valve) in significantly fewer iterations than the other methods.
  • Real-World Success: In the industrial propeller case, MGWO achieved the best mean fitness (5.5669) and the highest probability of hitting the absolute optimum (76.67%), proving its practicality for complex engineering.

Limitations and Future Work

The authors identify two main areas for improvement:

  • Leader Dependency: Currently, only the three leading wolves perform the neighborhood search. The remaining wolves simply follow the leaders, which limits their individual "self-exploration" potential.
  • Model Complexity: The current mathematical model primarily focuses on component interference. Real-world disassembly often involves more nuanced constraints, such as varying labor costs or specialized environmental hazards, which the authors plan to integrate into future versions of the DSP model.

Summary updated

Abstract

Abstract Disassembly sequence planning (DSP) can effectively increase the disassembly efficiency, shorten the disassembly cycle, reduce disassembly costs and reduce environmental hazards of end-of-life (EOL) products, playing an important role in manufacturing industries. Thus, it is urgent to propose an approach to solve the DSP problem. DSP is a famous NP-hard combinatorial optimization problem. As the size of components increases, exact algorithms can hardly obtain the optimal disassembly sequence. Therefore, we proposes a promising intelligence algorithm, modified grey wolf optimizer (MGWO), for solving the DSP problem. MGWO inherits the main idea of the hierarchy and hunting mechanism of the original grey wolf optimizer (GWO). Three new operators are designed in MGWO to ensure the feasibility of solutions under the complex constraint of disassembly precedence. The feasible solution generator (FSG) is designed to obtain feasible disassembly sequences, the neighborhood search operator (NSO) is developed to make wolves (solutions) self-evolving, and the guided search operator (GSO) is used to make the wolf group guided by three leaders of wolves. Two engineering cases are applied to validate the effectiveness of the proposed operators. Then, they and one real-world application are used to compare the MGWO with other reported methods. The results demonstrate that MGWO can solve the DSP problem effectively.
BibTeX
@article{xie2021disassembly,
  author = {Jin Xie and Xinyu Li and Liang Gao},
  title = {{Disassembly sequence planning based on a modified grey wolf optimizer}},
  journal = {The International Journal of Advanced Manufacturing Technology},
  year = {2021},
  doi = {10.1007/s00170-021-07696-x},
}

Loading related content...

Figure