The parallel stack loading problem (PSLP) aims to find an optimal loading plan for incoming items into parallel stacks that minimizes the number of relocations in the retrieval stage.
[TEE24] S. Tanaka, M. ElWakil, and A. Eltawil. The parallel stack loading problem of minimizing the exact number of relocations. Computers & Operations Research, vol. 169, art. no. 106712 (2024). DOI: 10.1016/j.cor.2024.106712
[TBS26] S. Tanaka, S. Boge, and S. Knust: The parallel stack loading problem: polynomial solvability in the unlimited-capacity case and exact approaches for the finite-capacity case. European Journal of Operational Research, in press. DOI: 10.1016/j.ejor.2026.03.009
[TEE24]
branch-and-bound algorithm (C) + IP (Python)
v1.0 [source code]
[TBS26]
IP+valid inequalities (branch-and-cut) and Benders decomposition (Python)
v1.0 [source code]
[TEE24]
all
10 feasible instances for each combination of parameters
[TBS26]
set1 (systematically generated, including non-full instances)
set2 (originated from [BE16], later increased by [BK20] and [TBS26]) (The [BK20] version is available from [external link])
[BE16] N. Bysen and S. Emde: The parallel stack loading problem to minimize blockages, European Journal of Operational Research, vol. 249, pp. 618-627 (2016). DOI: 10.1016/j.ejor.2015.09.033
[BK20] S. Boge and S. Knust: The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage, European Journal of Operational Research, vol. 280, pp. 940-952 (2020). DOI: 10.1016/j.ejor.2019.08.005