.png){kind=icon}
.png){kind=icon}
Return
On the integration of the parallel stack loading problem with the block relocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105609.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The parallel stack loading problem (PSLP) is an NP-hard problem. In this problem, the objective is to optimize assigning a group of arriving items to empty slots of parallel stacks in a storage bay. The PSLP aims to find a bay configuration that minimizes the future retrieval effort of these items. The retrieval effort is generally represented by the number of relocations needed during retrieval. These relocations are obligatory when an item not located at the top of a stack is to be retrieved. The number of relocations for a given bay configuration is minimized by another NP-hard problem, called the block relocation problem (BRP). The simultaneous solution of the PSLP and the BRP is complicated. As an alternative, previous literature studies proposed using a surrogate objective function (SOF) to approximate the number of relocations in the PSLP. This paper proposes two new SOFs which result in bay configurations with a minimized retrieval effort. Also, this paper introduces a new method to represent the retrieval effort. The new method considers the number of empty slots needed for relocations as well as the number of relocations. Extensive computational studies are provided to verify the proposed SOFs, and illustrate that they outperform other SOFs from the literature.
Keywords:
Logistics
Parallel stack loading problem
Relocations
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W