The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage

Autor(en): Boge, Sven
Knust, Sigrid 
Stichwörter: ALGORITHM; Business & Economics; EXPORT CONTAINERS; Logistics; Management; Operations Research & Management Science; Reshuffles; Stacking problems; Storage loading
Erscheinungsdatum: 2020
Herausgeber: ELSEVIER
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 280
Ausgabe: 3
Startseite: 940
Seitenende: 952
Zusammenfassung: 
In this paper, we consider the parallel stack loading problem (PSLP) with the objective to minimize the number of reshuffles in the retrieval stage. Since in the PSLP the incoming items have to be stored according to a fixed arrival sequence, some reshuffles cannot be avoided later on. We study two surrogate objective functions (number of unordered stackings, number of badly placed items) to estimate the number of reshuffles and compare them theoretically as well as in a computational study. For this purpose, MIP formulations and a simulated annealing algorithm are proposed. (C) 2019 Elsevier B.V. All rights reserved.
ISSN: 03772217
DOI: 10.1016/j.ejor.2019.08.005

Show full item record

Page view(s)

6
Last Week
0
Last month
0
checked on Mar 2, 2024

Google ScholarTM

Check

Altmetric