The Optimization of the Location of the Cargo in Three-Dimension Shelf: Employing the FP-Tree and the Artificial Fish Swarm Algorithms

The allocation issues of the location of the cargo have affected the operational efficiency of retail e-commerce warehouses tremendously. Adjusting the cargo location with the change of the order and the operation of the warehouse is a significant research area. A novel approach employing the FP-Tre...

Full description

Bibliographic Details
Main Authors: Shuiwang Zhang, Linping Fu, Rui Wang, Rong Chen
Format: Article
Language:English
Published: Hindawi Limited 2020-01-01
Series:Journal of Control Science and Engineering
Online Access:http://dx.doi.org/10.1155/2020/8832691
Description
Summary:The allocation issues of the location of the cargo have affected the operational efficiency of retail e-commerce warehouses tremendously. Adjusting the cargo location with the change of the order and the operation of the warehouse is a significant research area. A novel approach employing the FP-Tree and the Artificial Fish Swarm Algorithms is proposed. Firstly, energy consumption and shelf stability are employed for the location-allocation. Secondly, the association rules among product items are obtained by the FP-Tree Algorithm to mine frequent list of items. Furthermore, the frequency and the weight of product items are taken into account to ensure the local stability of the shelf during data mining. Thirdly, another method of the location-allocation is obtained with the objectives of the energy consumption and the overall shelf stability along with the frequent items stored nearby that is conducted by the Artificial Fish Swarm Algorithm. Finally, the picking order distance is obtained through two methods of the location-allocation above. The performance and efficiency of the novel introduced method have been confirmed by running the experiment. The outcomes of the simulation suggest that the introduced method has a higher performance concerning criterion called the picking order distance.
ISSN:1687-5249
1687-5257