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: | Article |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/46466/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|