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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2011
|
| Online Access: | http://eprints.utm.my/id/eprint/45464/ https://www.researchgate.net/publication/240917767_A_Binary_Particle_Swarm_Optimization_Approach_to_Optimize_Assembly_Sequence_Planning |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|