主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2022, Vol. 30 ›› Issue (1): 124-135.doi: 10.16381/j.cnki.issn1003-207x.2019.1266

• Articles • Previous Articles     Next Articles

The Optimization Model and Algorithm for Storage Location Assignment Problem in Unmanned Warehouse System

LI Zhen-ping1, JIA Shun-shun1,2, BU Xiao-qi1, WU Ling-yun3,4, ZHANG Guo-wei3,4,5   

  1. 1. School of Information, Beijing Wuzi University, Beijing 101149, China; 2. International School of Economics and Management,Capital University of Economics and Business Beijing, 100070, China;3. Key Laboratory of Management Decision and Information Systems, Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;4. School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China;5. School of Economics and Management, North China Electric Power University, Beijing 102206, China
  • Received:2019-08-25 Revised:2020-01-21 Online:2022-01-20 Published:2022-01-29
  • Contact: 吴凌云 E-mail:lywu@amss.ac.cn

Abstract: Unmanned warehouse is an automatic storage system appeared in recent years. The storage allocation strategy is one of the main factors affecting the efficiency of unmanned warehouse system. Based on the scene that there might be only part of the storage locations empty in the replenishment stage of the unmanned warehouse system, the optimization model and algorithm for storage location assignment problem of unmanned warehouse system is studied. A mixed integer programming model of the storage location assignment problem is formulated to maximize the sum of the correlation degrees among items stored on the same shelves. Based on the greedy algorithm and neighborhood search algorithm, a two-stage algorithm is designed for solving the model. In the first stage, a greedy algorithm is used to obtain an initial feasible solution, in the second stage, the neighborhood search heuristic algorithm is designed to optimize the initial feasible solution. An computer generated example is used to verify the optimization effect of neighborhood search algorithm, the results show that the objective value of solution being optimized by neighborhood search algorithm is increase by at least 27%. Several small-scale examples are used to analyze the approximation ratio and running speed of the two stage heuristic algorithm, which verifies the fast and effective of the algorithm. The model and algorithm of this paper not only solve the storage allocation problem with parts of the storage locations being empty on the shelves, but also can be used to solve the problem with all the storage locations being empty on the shelves. So the application of this method is broader, which can be used as the core model and algorithm for designing the unmanned warehouse management information system.

Key words: unmanned warehouse; storage location assignment; mixed integer programming; greedy algorithm; neighborhood search

CLC Number: