Ahmed Mukred, Jameel Abdulla and Ibrahim, Zuwairie and Ismail, Ibrahim and Mokhtar, Norrima (2011) A binary particle swarm optimization approach to optimize assembly sequence planning. In: 2nd International Symposium On Mechanical Science And Technology (ISMST 2011).
Full text not available from this repository.
Official URL: https://www.researchgate.net/publication/240917767...
Abstract
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.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Uncontrolled Keywords: | binary particle swarm |
Divisions: | Civil Engineering |
ID Code: | 45464 |
Deposited By: | Haliza Zainal |
Deposited On: | 10 Jun 2015 03:00 |
Last Modified: | 20 Sep 2017 00:34 |
Repository Staff Only: item control page