A binary particle swarm optimization approach to optimize assembly sequence planning

A binary particle swarm optimization approach to optimize assembly sequence planning

This paper presents an approach of applying Binary Particle Swarm Optimization (BPSO) algorithm to an assembly sequence-planning (ASP) problem. Permutation encoding of sequences is used to represent particles, then those particles are strictly subjected to a precedence constraint matrix at which onl...

Full description

Bibliographic Details
Main Authors: Mukred, J.A.A., Ibrahim, Z., Ibrahim, I., Adam, A., Wan, K., Yusof, Z.M., Mokhtar, N.
Format: Article
Published: Advanced Science Letters 2012
Subjects:
TA Engineering (General). Civil engineering (General)
TK Electrical engineering. Electronics Nuclear engineering
Description
Summary:This paper presents an approach of applying Binary Particle Swarm Optimization (BPSO) algorithm to an assembly sequence-planning (ASP) problem. Permutation encoding of sequences is used to represent particles, then those particles are strictly subjected to a precedence constraint matrix at which only the feasible sequences will be iterated in the process. An archive is used in storing the feasible sequences and a swap mechanism is used to identify the feasible sequences for iteration. As the nature of assembly sequence planning is a discrete type of problem Binary PSO technique is used.

Similar Items