Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence
Implementation of mobile rack warehouse is commonly used in manufacturing industry because it can minimize the warehouse area used. Applying picking orders in taking of Stock Keeping Unit (SKU) on mobile rack warehouses could give fast loading order. This research aims to find out which algorithm is...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Petra Christian University
2017-12-01
|
Series: | Jurnal Teknik Industri |
Subjects: | |
Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/20486 |
id |
doaj-3cb7ee30a90c45898ebb5fa54c8bb4c2 |
---|---|
record_format |
Article |
spelling |
doaj-3cb7ee30a90c45898ebb5fa54c8bb4c22020-11-24T23:54:04ZengPetra Christian UniversityJurnal Teknik Industri1411-24852087-74392017-12-01192125132Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order SequenceTanti Octavia0Septiananda Angelica1 Department of Industrial Engineering, Petra Christian University, Surabaya, Indonesia, Subject Area: Warehouse Management, Industrial Engineering. T. Industri - UK. Petra Implementation of mobile rack warehouse is commonly used in manufacturing industry because it can minimize the warehouse area used. Applying picking orders in taking of Stock Keeping Unit (SKU) on mobile rack warehouses could give fast loading order. This research aims to find out which algorithm is better in applying picking order sequence in mobile rack warehouse. The algorithm used is Simualted Annealing (SA) and Harmony Search (HS) algorithm. Both of these algorithms will be compared in terms of the gap with the shortest path method.The result shows that the HS algorithm produces a better solution than the SA algorithm with lower CPU time, but the convergence rate of HS is lower than that of SA.HS was able to produce a better solution than the shortest path method of 9 cases, while SA only 8 cases from 15 cases.http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/20486picking order; harmony search; simulated annealing |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Tanti Octavia Septiananda Angelica |
spellingShingle |
Tanti Octavia Septiananda Angelica Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence Jurnal Teknik Industri picking order; harmony search; simulated annealing |
author_facet |
Tanti Octavia Septiananda Angelica |
author_sort |
Tanti Octavia |
title |
Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence |
title_short |
Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence |
title_full |
Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence |
title_fullStr |
Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence |
title_full_unstemmed |
Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence |
title_sort |
perbandingan algoritma simulated annealing dan harmony search dalam penerapan picking order sequence |
publisher |
Petra Christian University |
series |
Jurnal Teknik Industri |
issn |
1411-2485 2087-7439 |
publishDate |
2017-12-01 |
description |
Implementation of mobile rack warehouse is commonly used in manufacturing industry because it can minimize the warehouse area used. Applying picking orders in taking of Stock Keeping Unit (SKU) on mobile rack warehouses could give fast loading order. This research aims to find out which algorithm is better in applying picking order sequence in mobile rack warehouse. The algorithm used is Simualted Annealing (SA) and Harmony Search (HS) algorithm. Both of these algorithms will be compared in terms of the gap with the shortest path method.The result shows that the HS algorithm produces a better solution than the SA algorithm with lower CPU time, but the convergence rate of HS is lower than that of SA.HS was able to produce a better solution than the shortest path method of 9 cases, while SA only 8 cases from 15 cases. |
topic |
picking order; harmony search; simulated annealing |
url |
http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/20486 |
work_keys_str_mv |
AT tantioctavia perbandinganalgoritmasimulatedannealingdanharmonysearchdalampenerapanpickingordersequence AT septianandaangelica perbandinganalgoritmasimulatedannealingdanharmonysearchdalampenerapanpickingordersequence |
_version_ |
1725467457525645312 |