Solving assembly sequence planning using angle modulated simulated kalman filter
This paper presents an implementation of Simulated Kalman Filter (SKF) algorithm for optimizing an Assembly Sequence Planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installa...
Main Authors: | , , , , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
IOP Publishing
2018
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/23320/ http://umpir.ump.edu.my/id/eprint/23320/ http://umpir.ump.edu.my/id/eprint/23320/1/Solving%20assembly%20sequence%20planning%20using%20angle%20modulated%20simulated%20kalman%20filter.pdf |
id |
ump-23320 |
---|---|
recordtype |
eprints |
spelling |
ump-233202019-04-25T03:42:53Z http://umpir.ump.edu.my/id/eprint/23320/ Solving assembly sequence planning using angle modulated simulated kalman filter Ainizar, Mustapa Zulkifli, Md. Yusof Asrul, Adam Badaruddin, Muhammad Zuwairie, Ibrahim TK Electrical engineering. Electronics Nuclear engineering TS Manufactures This paper presents an implementation of Simulated Kalman Filter (SKF) algorithm for optimizing an Assembly Sequence Planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installation to shorten assembly time or save assembly costs. Initially, permutation sequence is generated to represent each agent. Each agent is then subjected to a precedence matrix constraint to produce feasible assembly sequence. Next, the Angle Modulated SKF (AMSKF) is proposed for solving ASP problem. The main idea of the angle modulated approach in solving combinatorial optimization problem is to use a function, g(x), to create a continuous signal. The performance of the proposed AMSKF is compared against previous works in solving ASP by applying BGSA, BPSO, and MSPSO. Using a case study of ASP, the results show that AMSKF outperformed all the algorithms in obtaining the best solution. IOP Publishing 2018-03 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/23320/1/Solving%20assembly%20sequence%20planning%20using%20angle%20modulated%20simulated%20kalman%20filter.pdf Ainizar, Mustapa and Zulkifli, Md. Yusof and Asrul, Adam and Badaruddin, Muhammad and Zuwairie, Ibrahim (2018) Solving assembly sequence planning using angle modulated simulated kalman filter. In: 4th Asia Pacific Conference on Manufacturing Systems and the 3rd International Manufacturing Engineering Conference, APCOMS-iMEC 2017, 7-8 December 2017 , Yogyakarta, Indonesia. pp. 1-6., 319 (1). ISSN 1757-8981 (Print); 1757-899X (Online) https://iopscience.iop.org/article/10.1088/1757-899X/319/1/012044/pdf |
repository_type |
Digital Repository |
institution_category |
Local University |
institution |
Universiti Malaysia Pahang |
building |
UMP Institutional Repository |
collection |
Online Access |
language |
English |
topic |
TK Electrical engineering. Electronics Nuclear engineering TS Manufactures |
spellingShingle |
TK Electrical engineering. Electronics Nuclear engineering TS Manufactures Ainizar, Mustapa Zulkifli, Md. Yusof Asrul, Adam Badaruddin, Muhammad Zuwairie, Ibrahim Solving assembly sequence planning using angle modulated simulated kalman filter |
description |
This paper presents an implementation of Simulated Kalman Filter (SKF) algorithm for optimizing an Assembly Sequence Planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installation to shorten assembly time or save assembly costs. Initially, permutation sequence is generated to represent each agent. Each agent is then subjected to a precedence matrix constraint to produce feasible assembly sequence. Next, the Angle Modulated SKF (AMSKF) is proposed for solving ASP problem. The main idea of the angle modulated approach in solving combinatorial optimization problem is to use a function, g(x), to create a continuous signal. The performance of the proposed AMSKF is compared against previous works in solving ASP by applying BGSA, BPSO, and MSPSO. Using a case study of ASP, the results show that AMSKF outperformed all the algorithms in obtaining the best solution. |
format |
Conference or Workshop Item |
author |
Ainizar, Mustapa Zulkifli, Md. Yusof Asrul, Adam Badaruddin, Muhammad Zuwairie, Ibrahim |
author_facet |
Ainizar, Mustapa Zulkifli, Md. Yusof Asrul, Adam Badaruddin, Muhammad Zuwairie, Ibrahim |
author_sort |
Ainizar, Mustapa |
title |
Solving assembly sequence planning using angle modulated simulated kalman filter |
title_short |
Solving assembly sequence planning using angle modulated simulated kalman filter |
title_full |
Solving assembly sequence planning using angle modulated simulated kalman filter |
title_fullStr |
Solving assembly sequence planning using angle modulated simulated kalman filter |
title_full_unstemmed |
Solving assembly sequence planning using angle modulated simulated kalman filter |
title_sort |
solving assembly sequence planning using angle modulated simulated kalman filter |
publisher |
IOP Publishing |
publishDate |
2018 |
url |
http://umpir.ump.edu.my/id/eprint/23320/ http://umpir.ump.edu.my/id/eprint/23320/ http://umpir.ump.edu.my/id/eprint/23320/1/Solving%20assembly%20sequence%20planning%20using%20angle%20modulated%20simulated%20kalman%20filter.pdf |
first_indexed |
2023-09-18T22:34:51Z |
last_indexed |
2023-09-18T22:34:51Z |
_version_ |
1777416527333556224 |