Assembly Sequence Planning Based on Discrete Bat Algorithm

DOI

10.2991/icmse-18.2018.96How to use a DOI?

Keywords

assembly sequence planning; bat algorithm; fitness function; orthogonal test

Abstract

A Discrete Bat Algorithm (DBA) is proposed to solve the assembly sequence planning (ASP) problem. Several key technologies including the position and velocity of Bat Algorithm, corresponding operators for updating the position and the position of local search are redefined. The fitness function is established based on the geometric feasibility which is quantified, the stability, the polymerization for assembly sequence and the frequency of direction changes. The performance of the DBA is investigated through a case study of a typical assembly which contains10 parts. The near-optimal parameters of the algorithm are determined by the combination of orthogonal test (initial positioning) and control variables (precise positioning). It is proved that the DBA, compared with Particle Swarm Optimization (PSO) which is applied frequently in assembly sequence planning field, is more effective.

Copyright

© 2018, 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  - Yuejun Chen
AU  - Li Zhang
AU  - Wenjie Han
PY  - 2018/05
DA  - 2018/05
TI  - Assembly Sequence Planning Based on Discrete Bat Algorithm
BT  - Proceedings of the 2018 8th International Conference on Manufacturing Science and Engineering (ICMSE 2018)
PB  - Atlantis Press
SP  - 517
EP  - 525
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmse-18.2018.96
DO  - 10.2991/icmse-18.2018.96
ID  - Chen2018/05
ER  -