Abstract
We consider a storage allocation problem which combines storage location assignment with sequencing decisions about the assigned storage locations, and which originates from a real-world application context. We propose a very efficient successive constrained shortest path method, which outperforms a matheuristic approach recently proposed in the literature in terms of both the computational time required and regarding the quality of the solutions found.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hausman, W.H., Schwarz, L.B., Graves, S.C.: Optimal storage assignment in automatic warehousing systems. Manage. Sci. 22, 629–638 (1976)
Ashayeri, J., Gelders, L.F.: Warehouse design optimization. Eur. J. Oper. Res. 21, 285–294 (1985)
Gu, J., Goetschalckx, M., McGinnis, L.F.: Research on warehouse operation: a comprehensive review. Eur. J. Oper. Res. 177, 1–21 (2007)
Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur. J. Oper. Res. 239, 297–312 (2014)
Reyes, J., Solano-Charris, E., Montoya-Torres, J.: The storage location assignment problem: a literature review. Int. J. Ind. Eng. Comput. 10, 199–224 (2019)
Lanza, G., Passacantando, M., Scutellà, M.G.: Assigning and sequencing storage locations under a two level storage policy: optimization model and matheuristic approach. Technical Report 2398, University of Pisa (2021)
Lanza, G., Passacantando, M., Scutellà, M.G.: Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches. Omega 108, 102565 (2022)
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM. 7, 326–329 (1960)
Acknowledgements
The research has been supported by Region of Tuscany-Regional Government (POR FESR 2014-2020-Line 1-Research and Development Strategic Projects) through the Project IREAD4.0 under Grant CUP 7165.24052017.112000028.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Lanza, G., Passacantando, M., Scutellà, M.G. (2022). A Fast Heuristic Approach for the Assignment and Sequencing Storage Location Problem Under a Two Level Storage Policy. In: Amorosi, L., Dell’Olmo, P., Lari, I. (eds) Optimization in Artificial Intelligence and Data Sciences. AIRO Springer Series, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-030-95380-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-95380-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95379-9
Online ISBN: 978-3-030-95380-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)