[2F4-GS-10h] AI応用：経営と経済

[2F4-GS-10h-01] Binary PSO with Lévy Flight for optimizing the storage assignment

〇Minami Watanabe¹, Koya Ihara^1,2, Takuto Sakuma¹, Shohei Kato^1,2 (1. Nagoya Institute of Technology, 2. Frontier Research Institute of Information Science, Nagoya Institute of Technology)

Keywords:storage assignment, Particle Swarm Optimization, combinational optimization problem

In most of warehouses, a large number of products are shipped due to the spread of electronic commerce and frequent turnover of items. Therefore, improving operational efficiency has become one of the biggest issues. Nowadays, products are distributed empirically based on shipping frequency. The optimization of product placement can be formulated as a combinatorial optimization problem. However, it is difficult to enumerate all the combinations of all products and obtain the optimal solution. Hence, this study proposes a storage assignment method using Binary Particle Swarm Optimization with Lévy Flight (BLPSO), which is one of the effective algorithms for high-dimensional problems. In this paper, the performance of the BLPSO is verified by simulation experiments using real data. Experimental results show that the BLPSO was superior to the comparative methods. Besides, we obtained product location reducing the picking distance compared to the empirical one.