A dynamic programming algorithm for the space allocation and aisle positioning problem

被引:12
|
作者
Bodnar, Peter [1 ]
Lysgaard, Jens [1 ]
机构
[1] Aarhus Univ, DK-8210 Aarhus V, Denmark
关键词
storage location assignment; product allocation; warehousing; dynamic programming; WAREHOUSE; DESIGN;
D O I
10.1057/jors.2013.64
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAPP instances of moderate size.
引用
收藏
页码:1315 / 1324
页数:10
相关论文
共 50 条
  • [41] Bi-level programming modeling and hierarchical hybrid algorithm for antimissile dynamic firepower allocation problem with uncertain environment
    Cheng-li Fan
    Qing-hua Xing
    Qiang Fu
    Zhi-gang Zou
    Pattern Analysis and Applications, 2017, 20 : 287 - 306
  • [42] Bi-level programming modeling and hierarchical hybrid algorithm for antimissile dynamic firepower allocation problem with uncertain environment
    Fan, Cheng-li
    Xing, Qing-hua
    Fu, Qiang
    Zou, Zhi-gang
    PATTERN ANALYSIS AND APPLICATIONS, 2017, 20 (01) : 287 - 306
  • [43] Product allocation problem for an AS/RS with multiple in-the-aisle pick positions
    Ramtin, Faraz
    Pazour, Jennifer A.
    IIE TRANSACTIONS, 2015, 47 (12) : 1379 - 1396
  • [44] Space small targets detection based on dynamic programming algorithm
    Wang C.-X.
    Zhang Y.-Y.
    Wang X.-W.
    Xi X.-L.
    Yuhang Xuebao/Journal of Astronautics, 2010, 31 (01): : 199 - 205
  • [45] A constraint-programming approach for the storage space allocation problem in a distribution center
    Telha, Claudio
    Gonzalez-Ramirez, Rosa G.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2025,
  • [46] Fast dynamic programming algorithm for the large scale VCVRP problem
    Zhang P.
    Xiao K.
    Fu C.
    Yang K.
    1600, Systems Engineering Society of China (36): : 694 - 705
  • [47] The Parallel Processing Approach to the Dynamic Programming Algorithm of Knapsack Problem
    Sin, Si Thu Thant
    PROCEEDINGS OF THE 2021 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (ELCONRUS), 2021, : 2252 - 2256
  • [48] A new dynamic programming algorithm for the simplified partial digest problem
    Wang, Biing-Feng
    THEORETICAL COMPUTER SCIENCE, 2023, 954
  • [49] A dynamic programming algorithm for the conditional covering problem on tree graphs
    Horne, JA
    Smith, JC
    NETWORKS, 2005, 46 (04) : 186 - 197
  • [50] An efficient dynamic programming algorithm for a new generalized LCS problem
    Zhu, Daxin
    Wang, Lei
    Tian, Jun
    Wang, Xiaodong
    IAENG International Journal of Computer Science, 2016, 43 (02) : 204 - 211