A genetic algorithm for product disassembly sequence planning

Authors:
Wang Hui;Xiang Dong;Duan Guanghong
Affiliations:
The Department of Precision Instruments and Mechanology, Tsinghua University, 100084 Beijing, PR China;The Department of Precision Instruments and Mechanology, Tsinghua University, 100084 Beijing, PR China;The Department of Precision Instruments and Mechanology, Tsinghua University, 100084 Beijing, PR China
Venue:
Neurocomputing
Year:
2008

Citing 4
Cited 6

Genetic Algorithms

Genetic Algorithms
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
On Permutation Representations for Scheduling Problems

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Production scheduling and rescheduling with genetic algorithms

Evolutionary Computation

Nested partitions method for assembly sequences merging

Expert Systems with Applications: An International Journal
Genetically optimised disassembly sequence for automotive component reuse

Expert Systems with Applications: An International Journal
A Robotic-Driven Disassembly Sequence Generator for End-Of-Life Electronic Products

Journal of Intelligent and Robotic Systems
Waste electronics and electrical equipment disassembly and recycling using Petri net analysis: Considering the economic value and environmental impacts

Computers and Industrial Engineering
Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

Computer-Aided Design
Mechanical assembly planning using ant colony optimization

Computer-Aided Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a method to solve disassembly sequence planning problem. Firstly, disassembly feasibility information graph (DFIG) is presented to describe the product disassembly sequence and operation information. Then, disassembly sequence planning problem is mapped onto the DFIG as an optimal path-searching problem. Based on this idea, a genetic algorithm is provided to find out feasible and optimal disassembly solutions efficiently. Finally, a case study, which is used to illustrate the performance of proposed method, is presented.