A Fixture Assembly Sequence Planning Method Based on Ant Colony Algorithm

DOI

10.2991/iiicec-15.2015.128How to use a DOI?

Keywords

Fixture; Assembly sequence planning; Ant colony algorithm; Matlab.

Abstract

In order to solve the assembly sequence planning problem of fixtures, an ant colony algorithm is presented according to the principle that an assembly can be assembled if it can be disassembled. The disassembly constraint relations among the parts in a fixture are used to construct an integrated disassembly interference matrix. The key technologies are discussed, including feasible disassembly direction derivation based on an interference matrix, state transition probability of disassembly parts, pheromone updating rule of the ant colony algorithm and so on. The objective function takes the changing times of disassembly directions and tools. A program is realized in Matlab and verified by an example. The algorithm can effectively find the optimal assembly sequences for fixtures.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yan Cao
AU  - Zhuanxia Li
AU  - Sen Cao
PY  - 2015/03
DA  - 2015/03
TI  - A Fixture Assembly Sequence Planning Method Based on Ant Colony Algorithm
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 559
EP  - 562
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.128
DO  - 10.2991/iiicec-15.2015.128
ID  - Cao2015/03
ER  -