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 better in applying picking order sequence in mobile rack
warehouse. The algorithms used are Simulated Annealing (SA) and Harmony Search (HS)
algorithm. Both of these algorithms will be compared in terms of the gap with the shortest path
method and CPU time. 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 nine cases, while
SA only eight cases from fifteen cases.