chrome icon

The storage location assignment problem: A literature review

Content maybe subject to  copyright     Report

32  citations

View 1 citation excerpt

Cites background from "The storage location assignment pro..."

... [34] report that although exact methods exist to solve SLAP variations, they usually are not used due to the complexity of the problem. ...

26  citations

24  citations

18  citations

1,603  citations

847  citations

808  citations

606  citations

530  citations

Related Papers (5)

Ask Copilot

Related papers

Contributing institutions

Related topics

International Journal of Industrial Engineering Computations

The storage location assignment problem: A literature review

The storage of goods plays a crucial role in warehouse management systems. Although this operation is often considered simple, it is in fact complex, due to the volume of products, the uncertainty in demands, and the rapid customer service response that the market requires. Moreover, the optimization of logistical resources to maintain an efficient operational flow, such as the allocation of storage spaces, often requires complex decisions. In this paper, we analyze academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the solution methods, objectives, and related considerations. Suggestions are also provided for future research.

Publisher URL: http://growingscience.com/beta/ijiec/2956-the-storage-location-assignment-problem-a-literature-review.html

DOI: 10.5267/j.ijiec.2018.8.001

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

Download from Google Play

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.

Book cover

International Conference on Enterprise Information Systems

ICEIS 2022: Enterprise Information Systems pp 22–47 Cite as

A Storage Location Assignment Problem with Incompatibility and Isolation Constraints: An Iterated Local Search Approach

  • Nilson F. M. Mendes   ORCID: orcid.org/0000-0002-4924-7341 10 ,
  • Beatrice Bolsi   ORCID: orcid.org/0000-0002-6968-8689 10 &
  • Manuel Iori   ORCID: orcid.org/0000-0003-2097-6572 10  
  • Conference paper
  • First Online: 28 July 2023

175 Accesses

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 487))

Centralised warehouses are a widespread practice in the healthcare supply chain, as they allow for the storage of large quantities of products a short distance from hospitals and pharmacies, allowing both a reduction in warehouse costs and prompt replenishment in case of shortages. However, for this practice to lead to effective optimization, warehouses need to be equipped with efficient order fulfillment and picking strategies, as well as a storage policy that takes into account the specific procedures of the various types of items, necessary to preserve their quality. In this framework, we present a storage location assignment problem with product-cell incompatibility and isolation constraints, modeling goals and restrictions of a storage policy in a pharmaceutical warehouse. In this problem, the total distance that order pickers travel to retrieve all required items in a set of orders must be minimised. An Iterated Local Search algorithm is proposed to solve the problem, numerical experiments based on simulated data are presented, and a detailed procedure is provided on how to retrieve and structure the warehouse layout input data. The results show a dramatic improvement over a greedy full turnover procedure commonly adopted in real-life operations.

  • Storage allocation
  • Healthcare supply chain
  • Iterated local search
  • Warehouse management

This is a preview of subscription content, log in via an institution .

Buying options

  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
  • Available as EPUB and PDF
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Accorsi, R., Baruffaldi, G., Manzini, R.: Picking efficiency and stock safety: a bi-objective storage assignment policy for temperature-sensitive products. Comput. Ind. Eng. 115 , 240–252 (2018)

Article   Google Scholar  

Aldrighetti, R., Zennaro, I., Finco, S., Battini, D.: Healthcare supply chain simulation with disruption considerations: a case study from northern Italy. Glob. J. Flex. Syst. Manag. 20 (1), 81–102 (2019)

Battini, D., Calzavara, M., Persona, A., Sgarbossa, F.: Order picking system design: the storage assignment and travel distance estimation (SA &TDE) joint method. Int. J. Prod. Res. 53 (4), 1077–1093 (2015)

Bo, D., Yanfei, L., Haisheng, R., Xuejun, L., Cuiqing, L.: Research on optimization for safe layout of hazardous chemicals warehouse based on genetic algorithm. IFAC-PapersOnLine 51 (18), 245–250 (2018). https://doi.org/10.1016/j.ifacol.2018.09.307 , 10th IFAC Symposium on Advanced Control of Chemical Processes ADCHEM 2018

Bolaños Zuñiga, J., Saucedo Martínez, J.A., Salais Fierro, T.E., Marmolejo Saucedo, J.A.: Optimization of the storage location assignment and the picker-routing problem by using mathematical programming. Appl. Sci. 10 (2), 534 (2020)

Bottani, E., Casella, G., Murino, T.: A hybrid metaheuristic routing algorithm for low-level picker-to-part systems. Comput. Ind. Eng. 160 , 107540 (2021)

Google Scholar  

Boysen, N., De Koster, R., Weidinger, F.: Warehousing in the e-commerce era: a survey. Eur. J. Oper. Res. 277 (2), 396–411 (2019)

Article   MathSciNet   MATH   Google Scholar  

Cambazard, H., Catusse, N.: Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. Eur. J. Oper. Res. 270 (2), 419–429 (2018)

Chen, F., Xu, G., Wei, Y.: Heuristic routing methods in multiple-block warehouses with ultra-narrow aisles and access restriction. Int. J. Prod. Res. 57 (1), 228–249 (2019)

Chuang, Y.F., Lee, H.T., Lai, Y.C.: Item-associated cluster assignment model on storage allocation problems. Comput. Ind. Eng. 63 (4), 1171–1177 (2012)

De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182 (2), 481–501 (2007)

Article   MATH   Google Scholar  

De Santis, R., Montanari, R., Vignali, G., Bottani, E.: An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses. Eur. J. Oper. Res. 267 (1), 120–137 (2018)

Dijkstra, A.S., Roodbergen, K.J.: Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses. Transp. Res. Part E Logist. Transp. Rev. 102 , 38–59 (2017)

Elbert, R.M., Franzke, T., Glock, C.H., Grosse, E.H.: The effects of human behavior on the efficiency of routing policies in order picking: The case of route deviations. Comput. Ind. Eng. 111 , 537–551 (2017)

Fontana, M.E., Nepomuceno, V.S.: Multi-criteria approach for products classification and their storage location assignment. Int. J. Adv. Manuf. Technol. 88 (9–12), 3205–3216 (2017)

Foroughi, A., Boysen, N., Emde, S., Schneider, M.: High-density storage with mobile racks: picker routing and product location. J. Oper. Res. Soc. 72 (3), 535–553 (2021)

van Gils, T., Ramaekers, K., Caris, A., de Koster, R.B.: Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review. Eur. J. Oper. Res. 267 (1), 1–15 (2018)

Gu, J., Goetschalckx, M., McGinnis, L.F.: Research on warehouse operation: a comprehensive review. Eur. J. Oper. Res. 177 (1), 1–21 (2007)

Guerriero, F., Musmanno, R., Pisacane, O., Rende, F.: A mathematical model for the multi-levels product allocation problem in a warehouse with compatibility constraints. Appl. Math. Model. 37 (6), 4385–4398 (2013)

Article   MathSciNet   Google Scholar  

Keung, K., Lee, C., Ji, P.: Industrial internet of things-driven storage location assignment and order picking in a resource synchronization and sharing-based robotic mobile fulfillment system. Adv. Eng. Inform. 52 , 101540 (2022). https://doi.org/10.1016/j.aei.2022.101540

Kim, J., Méndez, F., Jimenez, J.: Storage location assignment heuristics based on slot selection and frequent itemset grouping for large distribution centers. IEEE Access 8 , 189025–189035 (2020). https://doi.org/10.1109/ACCESS.2020.3031585

Kress, D., Boysen, N., Pesch, E.: Which items should be stored together? A basic partition problem to assign storage space in group-based storage systems. IISE Trans. 49 (1), 13–30 (2017). https://doi.org/10.1080/0740817X.2016.1213469

Li, J., Moghaddam, M., Nof, S.Y.: Dynamic storage assignment with product affinity and ABC classification-a case study. Int. J. Adv. Manuf. Technol. 84 (9–12), 2179–2194 (2016)

Lu, W., McFarlane, D., Giannikas, V., Zhang, Q.: An algorithm for dynamic order-picking in warehouse operations. Eur. J. Oper. Res. 248 (1), 107–122 (2016)

Mendes, N., Bolsi, B., Iori, M.: An iterated local search for a pharmaceutical storage location assignment problem with product-cell incompatibility and isolation constraints. In: Proceedings of the 24th International Conference on Enterprise Information Systems - Volume 1: ICEIS, pp. 17–26. INSTICC, SciTePress (2022). https://doi.org/10.5220/0011039000003179

Ming-Huang Chiang, D., Lin, C.P., Chen, M.C.: Data mining based storage assignment heuristics for travel distance reduction. Expert Syst. 31 (1), 81–90 (2014)

Mirzaei, M., Zaerpour, N., De Koster, R.: The impact of integrated cluster-based storage allocation on parts-to-picker warehouse performance. Transp. Res. Part E Logist. Transp. Rev. 146 , 102207 (2021)

Mirzaei, M., Zaerpour, N., de Koster, R.B.: How to benefit from order data: correlated dispersed storage assignment in robotic warehouses. Int. J. Prod. Res. 60 (2), 549–568 (2022). https://doi.org/10.1080/00207543.2021.1971787

Muppani, V.R., Adil, G.K.: A branch and bound algorithm for class based storage location assignment. Eur. J. Oper. Res. 189 (2), 492–507 (2008)

Muppani, V.R., Adil, G.K.: Efficient formation of storage classes for warehouse storage location assignment: a simulated annealing approach. Omega 36 (4), 609–618 (2008)

Öztürkoğlu, Ö.: A bi-objective mathematical model for product allocation in block stacking warehouses. Int. Trans. Oper. Res. 27 (4), 2184–2210 (2020)

Pan, J.C.H., Shih, P.H., Wu, M.H.: Storage assignment problem with travel distance and blocking considerations for a picker-to-part order picking system. Comput. Ind. Eng. 62 (2), 527–535 (2012)

Pan, J.C.H., Shih, P.H., Wu, M.H., Lin, J.H.: A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system. Comput. Ind. Eng. 81 , 1–13 (2015)

Pan, J.C.H., Wu, M.H.: A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system. Comput. Ind. Eng. 57 (1), 261–268 (2009)

Pang, K.W., Chan, H.L.: Data mining-based algorithm for storage location assignment in a randomised warehouse. Int. J. Prod. Res. 55 (14), 4035–4052 (2017)

Quintanilla, S., Pérez, Á., Ballestín, F., Lino, P.: Heuristic algorithms for a storage location assignment problem in a chaotic warehouse. Eng. Optim. 47 (10), 1405–1422 (2015)

Rao, S.S., Adil, G.K.: Optimal class boundaries, number of aisles, and pick list size for low-level order picking systems. IIE Trans. 45 (12), 1309–1321 (2013)

Rasmi, S.A.B., Wang, Y., Charkhgard, H.: Wave order picking under the mixed-shelves storage strategy: a solution method and advantages. Comput. Oper. Res. 137 (2022). https://doi.org/10.1016/j.cor.2021.105556

Ratliff, H.D., Rosenthal, A.S.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31 (3), 507–521 (1983)

Reyes, J., Solano-Charris, E., Montoya-Torres, J.: The storage location assignment problem: a literature review. Int. J. Ind. Eng. Comput. 10 (2), 199–224 (2019)

Roodbergen, K.J., Koster, R.: Routing methods for warehouses with multiple cross aisles. Int. J. Prod. Res. 39 (9), 1865–1883 (2001)

Scholz, A., Henn, S., Stuhlmann, M., Wäscher, G.: A new mathematical programming formulation for the single-picker routing problem. Eur. J. Oper. Res. 253 (1), 68–84 (2016)

Silva, A., Coelho, L.C., Darvish, M., Renaud, J.: Integrating storage location and order picking problems in warehouse planning. Transp. Res. Part E Logist. Transp. Rev. 140 , 102003 (2020)

Silva, A., Roodbergen, K.J., Coelho, L.C., Darvish, M.: Estimating optimal ABC zone sizes in manual warehouses. Int. J. Prod. Econ. 252 , 108579 (2022)

Staudt, F.H., Alpan, G., Di Mascolo, M., Rodriguez, C.M.T.: Warehouse performance measurement: a literature review. Int. J. Prod. Res. 53 (18), 5524–5544 (2015)

Thanos, E., Wauters, T., Vanden Berghe, G.: Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation. J. Oper. Res. Soc. 1–14 (2019)

Theys, C., Bräysy, O., Dullaert, W., Raa, B.: Using a tsp heuristic for routing order pickers in warehouses. Eur. J. Oper. Res. 200 (3), 755–763 (2010)

Trab, S., Bajic, E., Zouinkhi, A., Abdelkrim, M.N., Chekir, H., Ltaief, R.H.: Product allocation planning with safety compatibility constraints in IoT-based warehouse. Procedia Comput. Sci. 73 , 290–297 (2015)

Trindade, M.A., Sousa, P.S., Moreira, M.R.: Ramping up a heuristic procedure for storage location assignment problem with precedence constraints. Flex. Serv. Manuf. J. 34 (3), 646–669 (2022)

Uthayakumar, R., Priyan, S.: Pharmaceutical supply chain and inventory management strategies: optimization for a pharmaceutical company and a hospital. Oper. Res. Health Care 2 (3), 52–64 (2013)

Van Gils, T., Ramaekers, K., Braekers, K., Depaire, B., Caris, A.: Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions. Int. J. Prod. Econ. 197 , 243–261 (2018)

Volland, J., Fügener, A., Schoenfelder, J., Brunner, J.O.: Material logistics in hospitals: a literature review. Omega 69 , 82–101 (2017). https://doi.org/10.1016/j.omega.2016.08.004 , http://www.sciencedirect.com/science/article/pii/S0305048316304881

Wang, M., Zhang, R.Q., Fan, K.: Improving order-picking operation through efficient storage location assignment: a new approach. Comput. Ind. Eng. 139 , 106186 (2020)

Xiao, J., Zheng, L.: Correlated storage assignment to minimize zone visits for BOM picking. Int. J. Adv. Manuf. Technol. 61 (5), 797–807 (2012)

Xu, X., Ren, C.: A novel storage location assignment in multi-pickers picker-to-parts systems integrating scattered storage, demand correlation, and routing adjustment. Comput. Ind. Eng. 172 (2022). https://doi.org/10.1016/j.cie.2022.108618

Zhang, R.Q., Wang, M., Pan, X.: New model of the storage location assignment problem considering demand correlation pattern. Comput. Ind. Eng. 129 , 210–219 (2019)

Žulj, I., Glock, C.H., Grosse, E.H., Schneider, M.: Picker routing and storage-assignment strategies for precedence-constrained order picking. Comput. Ind. Eng. 123 , 338–347 (2018)

Download references

Author information

Authors and affiliations.

Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Reggio Emilia, Italy

Nilson F. M. Mendes, Beatrice Bolsi & Manuel Iori

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Beatrice Bolsi .

Editor information

Editors and affiliations.

Polytechnic Institute of Setúbal/ INSTICC, Setúbal, Portugal

Joaquim Filipe

Warsaw University of Technology, Warsaw, Poland

Michał Śmiałek

George Mason University, Fairfax, VA, USA

Alexander Brodsky

ESEO, ERIS, Angers, France

Slimane Hammoudi

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Cite this paper.

Mendes, N.F.M., Bolsi, B., Iori, M. (2023). A Storage Location Assignment Problem with Incompatibility and Isolation Constraints: An Iterated Local Search Approach. In: Filipe, J., Śmiałek, M., Brodsky, A., Hammoudi, S. (eds) Enterprise Information Systems. ICEIS 2022. Lecture Notes in Business Information Processing, vol 487. Springer, Cham. https://doi.org/10.1007/978-3-031-39386-0_2

Download citation

DOI : https://doi.org/10.1007/978-3-031-39386-0_2

Published : 28 July 2023

Publisher Name : Springer, Cham

Print ISBN : 978-3-031-39385-3

Online ISBN : 978-3-031-39386-0

eBook Packages : Computer Science Computer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

  • Publish with us

Policies and ethics

  • Find a journal
  • Track your research

IMAGES

  1. (PDF) The storage location assignment problem: A literature review

    the storage location assignment problem a literature review

  2. Ramping up a heuristic procedure for storage location assignment

    the storage location assignment problem a literature review

  3. Figure 1 from A restricted neighbourhood Tabu Search for Storage

    the storage location assignment problem a literature review

  4. (PDF) The storage location assignment problem: A literature review

    the storage location assignment problem a literature review

  5. Storage Location Assignment Problem

    the storage location assignment problem a literature review

  6. (PDF) The Multi-Period Storage Location Assignment Problem

    the storage location assignment problem a literature review

VIDEO

  1. Storage Location Assignment with MAGELLAN

  2. ORG STRUCTURE

  3. Metodologi Penelitian (Research, Investigation, Define Problem, Literature Review)

  4. Literature Review-Group 12

  5. Lecture 3: Threads, Address Spaces, Filesystem, Devices

  6. Unlocking Secret Storage Increase Hacks

COMMENTS

  1. The storage location assignment problem: A literature review

    academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the solution methods, objectives, and related

  2. The storage location assignment problem: A literature review

    2022. TLDR. An Iterated Local Search algorithm is proposed to solve the Storage Location Assignment Problem with Product-Cell Incompatibility and Isolation Constraints in a pharmaceutical product warehouse and shows a relevant improvement with respect to a greedy full turnover procedure commonly adopted in real life operations. Expand.

  3. Storage Location Assignment Problem in a Warehouse: A Literature Review

    The storage location assignment problem (SLAP) is an important step when we are designing a warehouse layout, and this step influences in the arranging, picking process, sorting, ... This chapter presented a review of the literature on the storage location assignment problem. Forty-five papers from 2005 to 2021 were divided into 3 categories ...

  4. The storage location assignment problem: A literature review

    In this paper, we analyze academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the solution methods, objectives, and related considerations. Suggestions are also provided for future research. The storage of goods plays a crucial role in warehouse management ...

  5. The storage location assignment problem: A literature review

    PDF | This article is published in International Journal of Industrial Engineering Computations.The article was published on 2019-04-01 and is currently open access. It has received 29 citation(s) till now. The article focuses on the topic(s): Assignment problem.

  6. PDF A Storage Location Assignment Problem with Incompatibility and

    2 Literature Review The Storage Location Assignment Problem (SLAP) is a generalisation of the well know Assignment Problem in which a set of elements must be assigned to a specif position inside a storage area. It is also related with the Quadratic Assignment Problem (QAP), mainly due to the methods used to evaluate the solutions [43]. Most of ...

  7. The storage location assignment problem: A literature review

    Moreover, the optimization of logistical resources to maintain an efficient operational flow, such as the allocation of storage spaces, often requires complex decisions. In this paper, we analyze academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the ...

  8. Solving the Storage Location Assignment Problem Using Reinforcement

    Solving the Storage Location Assignment Problem Using Reinforcement Learning. Pages 89-95. ... "The storage location assignment problem: A literature review," International Journal of Industrial Engineering Computations, vol. 10, no. 2, pp. 199-224, 2019, doi: 10.5267/j.ijiec.2018.8.001. Google Scholar Cross Ref;

  9. PDF International Journal of Industrial Engineering Computations

    In this paper, we develop a systematic literature review of the storage location assignment problem (SLAP). The SLAP is an operational decision associated with the accommodation and picking process, influencing batch definition, classification, routing, and order sequencing. In the following sub-sections, we provide a more complete definition ...

  10. New model of the storage location assignment problem considering demand

    The storage location assignment problem (SLAP) involves determining the allocation of items to storage locations to maximize the order-picking efficiency. ... Literature review. In this section, we discuss the related studies in two aspects: storage strategies, especially correlation-based strategies, and simulated annealing methods used in ...

  11. PDF Storage Location Assignment Problem in a Warehouse: A Literature Review

    Storage Location Assignment Problem in a Warehouse: A Literature Review Lucy Medrano-Zarazúa, Jania Astrid Saucedo-Martínez, and Johanna Bolaños-Zuñiga Abstract Warehouse management is one of the many companies' operations that is a main part of the supply chain. Storage takes up between 2 and 5% of the total

  12. A Discrete-Event Simheuristic for Solving a Realistic Storage Location

    Traditional approaches in the literature to solve the storage location assignment problem present some limitations, such as excluding the stochastic variability of processes or the interaction among different warehouse activities. ... As discussed in the literature review section, a popular approach is to treat the SLAP in isolation and to ...

  13. Integrating storage location and order picking problems in warehouse

    The problem of deciding where to locate products in a warehouse is known as storage location assignment problem (SLAP). It consists of determining the most efficient assignment of products to locations in order to minimize the total handling effort. ... In Section 2, we review the literature of the SLAP and the OPP. The MIP models for the ...

  14. Integrating storage location and order picking problems in warehouse

    Section snippets Background on the storage location assignment and order picking problems. We present a brief review on the SLAP and OPP. For complementary information, we refer to the literature reviews in De Koster et al., 2007, Gu et al., 2007, Gu et al., 2010, Reyes et al., 2019, Van Gils et al., 2018c.

  15. The storage location assignment problem: A literature review

    In this paper, we analyze academic contributions on the storage location assignment problem published between 2005 and 2017. The literature is classified according to the solution methods, objectives, and related considerations. Suggestions are also provided for future research.

  16. PDF Class-based Storage Location Assignment: An Overview of the Literature

    Keywords: Warehouse Operations, Cl ass-based Storage Location Assignm ent Problem, Literature Review. Abstract: Storage, per se, is not only an important process in a warehouse, also it has the greatest influence on the most expensive one, i.e., order picking. This study aims to give a literature overview on class-based storage location

  17. The storage location assignment problem: A literature review

    26 páginas The storage of goods plays a crucial role in warehouse management systems. Although this operation is often considered simple, it is in fact compl... The storage location assignment problem: A literature review

  18. A Discrete Particle Swarm Optimization for Storage Location Assignment

    The storage location assignment of goods is critical to improve the efficiency of warehouse picking and distribution in the era of retail e-commerce. The optimization model of the storage location assignment problem (SLAP) for retail e-commerce is firstly established based on the principles of efficiency priority, shelf stability and similar ...

  19. Ramping up a heuristic procedure for storage location assignment

    Reyes JJR, Solano-Charris EL, Montoya-Torres JR (2019) The storage location assignment problem: a literature review. Int J Ind Eng Comput 10(2019):199-224. Google Scholar Richards G (2014) Warehouse management: a complete guide to improving efficiency and minimizing costs in the modern warehouse. Kogan Page, London

  20. A Storage Location Assignment Problem with Incompatibility and

    The Storage Location Assignment Problem (SLAP) is a generalisation of the well know Assignment Problem in which a set of elements must be assigned to a specif position inside a storage area. It is also related with the Quadratic Assignment Problem (QAP), mainly due to the methods used to evaluate the solutions [].Most of times, SLAP variants have complex constraints and objective functions ...

  21. The storage location assignment problem for outbound containers in a

    It is clear from the literature review that there have been no comprehensive studies on the storage location assignment problem for outbound containers. In this paper, a systematic approach is proposed to determine the storage location for outbound containers in a maritime terminal. The objectives are: Efficient use of storage space in the yard;

  22. PDF Dynamic Storage Location Assignment Problem at Knapp company: toward

    The storage location assignment problem (SLAP), is usually solved with Operational Research me-thods. This article draws up a literature review to solve this problem by highlights link with Machine Learning. It also present plausible prospect to solve this problematic by