Industrial Engineering Journal ›› 2022, Vol. 25 ›› Issue (4): 151-157.doi: 10.3969/j.issn.1007-7375.2022.04.018

• PRACTICE & APPLICATION • Previous Articles     Next Articles

Asynchronous Parallel Disassembly Sequence Planning Based on Improved Genetic Algorithm

SUN Xianjing1,2, TANG Qiuhua1,2, DENG Mingxing3   

  1. 1. Key Laboratory of Metallurgical Equipment and Control of Ministry of Education;
    2. Hubei Provincial Key Laboratory of Mechanical Transmission and Manufacturing Engineering;
    3. School of Automobile and Traffic Engineering, Wuhan University of Science and Technology, Wuhan 430081, China
  • Received:2020-12-10 Published:2022-08-30

Abstract: Aiming at the problem of asynchronous parallel disassembly sequence planning considering the priority relationship constraint and the machine working area conflict constraint, a genetic algorithm with path reconnection strategy is proposed. The disassembly direction is simplified by defining the And/Or priority relationship between components. And via the working area conflict constraint, the working area conflict is avoided during the disassembly process of the parts. On this basis, the population is encoded and decoded, and a path reconnection operator is added to reconnect the elite solution obtained by the genetic algorithm iteration to enhance the local search ability of the algorithm. Finally, a number of actual cases prove the effectiveness of the algorithm.

Key words: asynchronous parallel disassembly, genetic algorithm (GA), path relinking

CLC Number: