arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.04872cs.AI
收藏

基于蚁群和回溯算法的仓库布局方法

Warehouse Layout Method Based on Ant Colony and Backtracking Algorithm

Multimedia Nusantara University(印尼多媒体大学)

Ardy Wibowo Haryanto, Adhi Kusnadi, Yustinus Eko Soelistio

摘要:

仓库是一个公司的重要方面之一。因此,有必要对仓库管理系统(WMS)进行改进,使其具有简单的功能,可以确定存储货物的布局。提出了一种基于蚁群算法和回溯算法的仓库布局改进方法。该方法分两步进行。首先,由回溯算法生成解的参数树。其次,采用蚁群算法和回溯算法相结合的方法,推导出最优解的参数。通过测量构建树所需的时间以及使用两种场景填充空间来测试该方法。该方法需要0.294到33.15秒来构建树,并且需要3.23秒(最好情况)到61.41分钟(最坏情况)来填满仓库。该方法被证明是一个有吸引力的替代解决方案的仓库布局系统。

英文摘要:

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) to 61.41 minutes (worst case) to fill up the warehouse. This method is proved to be an attractive alternative solution for warehouse layout system.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑