UMN Knowledge Center

Warehouse Layout Method Based on Ant Colony and Backtracking Algorithm

Haryanto, Ardy Wibowo and Kusnadi, Adhi and Soelistio, Yustinus Eko (2015) Warehouse Layout Method Based on Ant Colony and Backtracking Algorithm. 14th IAPR International Conference on Quality in Research (QIR). (Unpublished)

[img] Text
4. Adhi Kusnadi - Warehouse Layout.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (311kB)

Abstract

Warehouse is one of the important aspects of a company. Therefore, it is necessary to improve Warehouse Management System (WMS) to have a simple function that can determine the layout of the storage goods. In this paper we propose an improved warehouse layout method based on ant colony algorithm and backtracking algorithm. The method works on two steps. First, it generates a solutions parameter tree from backtracking algorithm. Then second, it deducts the solutions parameter by using a combination of ant colony algorithm and backtracking algorithm. This method was tested by measuring the time needed to build the tree and to fill up the space using two scenarios. The method needs 0.294 to 33.15 seconds to construct the tree and 3.23 seconds (best case) to61.41 minutes (worst case) to fill up the warehouse. This method is proved to be an attractive alternative solution for warehouse layout system.

Item Type: Article
Uncontrolled Keywords: warehouse layout; block stacking method; ant colony algorithm; backtracking algorithm
Subjects: T Technology > T Technology (General) > T55 Industrial engineering. Management engineering > T58.5-58.64 Information technology > T58.59 Algorithm
T Technology > T Technology (General) > T55 Industrial engineering. Management engineering > T70 Information System
Divisions: Fakultas Teknik Informatika > Program Studi Sistem Informasi
Depositing User: mr admin umn
Date Deposited: 27 Feb 2020 03:54
Last Modified: 27 Feb 2020 03:54
URI: http://kc.umn.ac.id/id/eprint/12439

Actions (login required)

View Item View Item