By Topic

A New Heuristic Method for Assembly Planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Hui ; Dept. of Precision Instrum. & Mechanology, Tsinghua Univ., Beijing ; Xiang Dong ; Duan Guanghong

Traditionally, the problem of assembly sequence planning is often converted to an equivalent problem of finding how the same assembly can be disassembled. Therefore, in our research, disassembly feasibility information graph is proposed firstly, to represent disassembly (sequence/operation) relevant information. And based on this graph, we transform disassembly sequence planning problem into a problem of searching for optimal path. Then, an ant colony system is designed to search optimal disassembly sequence solution. The tour of ant represents a possible product disassembly solution. The pheromone trail laid on edge by ant reflects the quality of its tour. It is by two steps to get heuristic information: obtain heuristic vector - representing the feasibility of solution - and then, get heuristic information - representing the quality of solution. By this approach, disassembly solution could be generated, as well as corresponding assembly solution. Finally, an intelligent assembly planning software, based on the proposed approaches, is introduced

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on  (Volume:2 )

Date of Conference:

4-6 Oct. 2006