Intelligent selective disassembly using the ant colony algorithm

Authors:
J. F. Wang;J. H. Liu;S. Q. Li;Y. F. Zhong
Affiliations:
School of Mechanical Science and Engineering, Huazhong University of Science & Technology, Wuhan, People's Republic of China;School of Mechanical Engineering and Automation, Beihang University, Beijing, People's Republic of China;School of Mechanical Science and Engineering, Huazhong University of Science & Technology, Wuhan, People's Republic of China;School of Mechanical Science and Engineering, Huazhong University of Science & Technology, Wuhan, People's Republic of China
Venue:
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Year:
2003

Citing 5
Cited 3

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
Issues in environmentally conscious manufacturing and product recovery: a survey

Computers and Industrial Engineering - Special issue on o/perational issues in environmentally conscious manufacturing
Determining optimum disassembly sequences in electronic equipment

Computers and Industrial Engineering
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Chaotic particle swarm optimization for assembly sequence planning

Robotics and Computer-Integrated Manufacturing
Rule-based recursive selective disassembly sequence planning for green design

Advanced Engineering Informatics
Disassembly sequence structure graphs: An optimal approach for multiple-target selective disassembly sequence planning

Advanced Engineering Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Selective disassembly is an important issue in industrial and mechanical engineering for environmentally conscious manufacturing. This paper presents an intelligent selective disassembly approach based on ant colony algorithms, which take inspiration from the behavior of real ant colonies and are used to solve combinatorial optimization problems. For diverse assemblies, the algorithm generates different amounts of ants cooperating to find disassembly sequences for selected components, minimizing the reorientation of assemblies and removal of components. A candidate list that is composed of feasible disassembly operations, which are derived from a disassembly matrix of products, guides sequence construction in the implicit solution space and ensures the geometric feasibility of sequences. Preliminary implementation results show the effectiveness of the proposed method.