Universiti Teknologi Malaysia Institutional Repository

A binary particle swarm optimization approach to optimize assembly sequence planning

A. A. Mukred, Jameel and Zuwairie, Ibrahim and Ibrahim, Ismail and Adam, Asrul and Wan, Khairunizam and Md. Yusof, Zulkifli and N., Mokhtar (2012) A binary particle swarm optimization approach to optimize assembly sequence planning. Advanced Science Letters, 13 . pp. 732-738. ISSN 1936-6612

Full text not available from this repository.

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:Article
Uncontrolled Keywords:Advanced science
Subjects:Q Science
Divisions:Electrical Engineering
ID Code:46466
Deposited By: Haliza Zainal
Deposited On:22 Jun 2015 13:56
Last Modified:27 Aug 2017 16:24

Repository Staff Only: item control page