Selective Parallel Disassembly Sequence Planning Method for Remanufacturing

Tian, Yongting; Xiu-fen, Zhang; Xu, Jinfang; Li, Zhiguo

doi:10.3724/sp.j.1089.2018.16317

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to solve the DSP problem on computer, based on adjacency matrix (Tian et al, 2018), this paper proposes a method to transform the above disassembly relation hybrid graph into disassembly relation matrix. Both of them can equally describe the relationship between the components.…”

Section: Disassembly Relationship Matrixmentioning

confidence: 99%

Electric Vehicle Battery Disassembly Sequence Planning Based on Frame-Subgroup Structure Combined with Genetic Algorithm

Zhang

et al. 2020

Front. Mech. Eng.

View full text Add to dashboard Cite

Since the electric vehicle battery (EVB) is wildly recycled in industry, the disassembly procedures of variable EVBs is so important that can influence the efficiency and environmental impacts in remanufacturing. To improve disassembly efficiency in EVB remanufacturing, a disassembly sequence planning method based on frame-subgroup structure is proposed in this paper. Firstly, the improved disassembly relation hybrid graph and disassembly relation matrix are proposed to identify the disassembly precedence relationship and connection relationship between the components in EVB. Secondly, the frame - subgroup structure is given, and the method for solving disassembly sequence planning with frame-subgroup structure and genetic algorithm is introduced. In this method, to simplify the series of processes such as encoding, decoding, crossover and mutation, the solution space composed of all disassembly sequences is transformed into the positive integer sequence for the disassembly efficiency in battery remanufacturing. Finally, the case study of EVB disassembly sequence planning is presented to validate the feasibility of this proposed method. Comparing with other traditional methods, the advantage and application of this proposed method are introduced.

show abstract

Section: Disassembly Relationship Matrixmentioning

confidence: 99%

Electric Vehicle Battery Disassembly Sequence Planning Based on Frame-Subgroup Structure Combined with Genetic Algorithm

Zhang

et al. 2020

Front. Mech. Eng.

View full text Add to dashboard Cite

show abstract

“…Based on the information model of product disassembly, DSP is aiming at optimizing the given evaluation function of the disassembly sequence and determining the optimal or approximately optimal disassembly sequence that meets the disassembly constraints [10]. DSP is a NP-hard problem [11], many heuristic or metaheuristic methods have been used to solve DSP problems because of the advantages of fast solution speed, convenient parameter setting and the high modularity, such as the, a method to solve DSP which based on genetic algorithm (GA) [12][13][14][15], ant colony algorithm [16,17], particle swarm algorithm (PSO) [18,19], artificial bee colony algorithm [20,21], flower pollination algorithm [22], etc.…”

Section: Literature Reviewmentioning

confidence: 99%

Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Zhu

et al. 2020

SN Appl. Sci.

View full text Add to dashboard Cite

To solve the problem of low disassembly efficiency of complex products, an asynchronous parallel disassembly sequence planning method of multi-manipulator based on improved shuffled frog leaping algorithm was proposed. Depending on the characteristics of this method, the disassembly manipulators are taken as the research object, and the minimum completion time of disassembly is taken as the optimization objective. Based on the basic disassembly time of parts, the disassembly preparation time caused by the change of disassembly tools and directions is considered, so that the objective function evaluation model is more realistic. Then, the mathematical model of asynchronous parallel disassembly sequence planning is constructed and the disassembly information modeling method is optimized. We proposed a new method based on the fastener constraint matrix and the part constraint matrix to build the information model of product disassembly. Based on this model, the detachable conditions are derived and the feasible disassembly sequence is obtained. In order to improve the performance of the proposed algorithm, a double-link encoding method and an efficient decoding operator is proposed. The adjustment orders which based on adjustment position and the substitution formulas are constructed to carry out the new segmental local evolution of frog individuals, and the update formula of frog position is reconstructed. Furthermore, the two-point mutation operator is added to the global information exchange strategy to enhance the search ability of the algorithm. The proposed algorithm is applied to a screw lifting mechanism and four products of varying complexity, and the results are compared with two algorithms. The results show that the proposed method can solve disassembly problems of different scales and is especially effective in solving large-scale disassembly problems.

show abstract

Product cooperative disassembly sequence and task planning based on genetic algorithm

Tian

Zhang

Liu

et al. 2019

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Selective Parallel Disassembly Sequence Planning Method for Remanufacturing

Cited by 3 publications

References 0 publications

Electric Vehicle Battery Disassembly Sequence Planning Based on Frame-Subgroup Structure Combined with Genetic Algorithm

Electric Vehicle Battery Disassembly Sequence Planning Based on Frame-Subgroup Structure Combined with Genetic Algorithm

Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Product cooperative disassembly sequence and task planning based on genetic algorithm

Contact Info

Product

Resources

About