Logo

Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence

Octavia, Tanti and Septianda, Angelica (2017) Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence. jurnal teknik industri, 19 (2). pp. 125-132. ISSN ISSN: 1411-2485, e-ISSN: 2087-7439

[img]
Preview
PDF
Download (3776Kb) | Preview
    [img]
    Preview
    PDF
    Download (165Kb) | Preview
      [img]
      Preview
      PDF (peer review)
      Download (1750Kb) | Preview

        Abstract

        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.

        Item Type: Article
        Uncontrolled Keywords: Picking order sequence, simulated annealing, harmony search.
        Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
        Divisions: Faculty of Industrial Technology > Industrial Engineering Department
        Depositing User: Admin
        Date Deposited: 23 Feb 2018 16:09
        Last Modified: 24 Sep 2021 15:11
        URI: https://repository.petra.ac.id/id/eprint/17783

        Actions (login required)

        View Item