Robust Storage Assignment in Warehouses with Correlated Demand

  • Monika KoflerEmail author
  • Andreas Beham
  • Stefan Wagner
  • Michael Affenzeller
Part of the Studies in Computational Intelligence book series (SCI, volume 595)


In many warehouses manual order picking is one of the most time and labour intensive processes. Products that are often ordered together are said to be correlated or affine and order picking performance may be improved by placing correlated products close to each other. In industries with strong seasonality patterns and fluctuating demand regular re-locations of products might be necessary to ensure that the quality of the storage assignment does not deteriorate over time. In this chapter we study how to generate more robust assignments that are suitable for volatile warehouse scenarios with correlated demand. In a case study based on 13 monthly snapshots from a real-world warehouse robust slotting outperformed greedy re-locations by up to 9.6 %.


Greedy Approach Order Picking Robustness Measure Storage Assignment Material Handling Equipment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This paper is an updated and extended version of [12] and was first presented at the APCASE 2014 conference. The work described in this chapter was done within the Josef Ressel-Centre HEUREKA! for Heuristic Optimization sponsored by the Austrian Research Promotion Agency (FFG).


  1. 1.
    Accorsi, R., Manzini, R., Bortolini, M.: A hierarchical procedure for storage allocation and assignment within an order-picking system. A case study. Int. J. Logist. Res. Appl. 15(6), 351–364 (2012)CrossRefGoogle Scholar
  2. 2.
    Achtert, E., Kriegel, H.-P., Zimek, A.: ELKI: a software system for evaluation of subspace clustering algorithms. In: Ludscher, B., Mamoulis, N.: (eds.) Scientific and Statistical Database Management. LNCS, vol. 5069, pp. 580–585. Springer, Berlin Heidelberg (2008)Google Scholar
  3. 3.
    Ankerst, M., Breunig, M., Kriegel, H.-P. Sander, J.: OPTICS: ordering points to identify the clustering structure. In: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data (SIGMOID’99), vol. 28(2), pp. 49-60 (1999)Google Scholar
  4. 4.
    Bindi, F., Manzini, R., Pareschi, A., Regattieri, A.: Similarity-based storage allocation rules in an order picking system: an application to the food service industry. Int. J. Logist. Res. Appl. 12(4), 233–247 (2009)CrossRefGoogle Scholar
  5. 5.
    Carlo, H., Giraldo, G.: Optimizing the rearrangement process in a dedicated warehouse. In: Ellis, K., Gue, K., de Koster, R., Meller, R., Montreuil, B., Ogle, M. (eds.) Progress in Material Handling Research, pp. 39–48. Material Handling Institute, Charlotte, North Carolina (2010)Google Scholar
  6. 6.
    de Ruijter, H., Schuur, P., Mantel, R., Heragu, S.: Order oriented slotting and the effect of order batching for the practical case of a book distribution center. In: Proceedings of the 2009 International Conference on Value Chain Sustainability (2009)Google Scholar
  7. 7.
    Frazelle, E., Sharp, G.: Correlated assignment strategy can improve order-picking operation. Ind. Eng. 4, 33–37 (1989)Google Scholar
  8. 8.
    Garfinkel, M.: Minimizing Multi-zone Orders in the Correlated Storage Assignment Problem. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, January 2005Google Scholar
  9. 9.
    Gu, J., Goetschalckx, M., McGinnis, L.: Research on warehouse operation: A comprehensive review. Eur. J. Oper. Res. 177(1), 1–21 (2007)CrossRefzbMATHGoogle Scholar
  10. 10.
    Heskett, J.: Cube-per-order index—a key to warehouse stock location. Trans. Distrib. Manag. 31, 27 (1963)Google Scholar
  11. 11.
    Kofler, M., Beham, A., Wagner, S., Affenzeller, M.: Affinity based slotting in warehouses with dynamic order patterns. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z.: (eds.) Advanced Methods and Applications in Computational Intelligence. Topics in Intelligent Engineering and Informatics, vol. 6, pp. 123–143. Springer (2014)Google Scholar
  12. 12.
    Kofler, M., Beham, A., Wagner, S., Affenzeller, M.: Robust solutions for a multi-period storage location assignment problem with correlated demand. In: Chaczko, Z., Gaol, F., Pichler, F., Chiu, C.: (eds.) Proceedings of the 2nd Asia-Pacific Conference on Computer Aided System Engineering (APCASE), South Kuta, Indonesia, February 2014, pp. 99–100 (2014)Google Scholar
  13. 13.
    Kofler, M., Beham, A., Wagner, S., Affenzeller, M., Achleitner., W.: Re-warehousing vs. healing: strategies for warehouse storage location assignment. In: Proceedings of the IEEE 3rd International Symposium on Logistics and Industrial Informatics (Lindi 2011), Budapest, Hungary, 25–27 August 2011, pp. 77–82 (2011)Google Scholar
  14. 14.
    Mantel, R., Schuur, P., Heragu, S.: Order oriented slotting: a new assignment strategy for warehouses. Eur. J. Ind. Eng. 1(3), 301–316 (2007)CrossRefGoogle Scholar
  15. 15.
    Muralidharan, B., Linn, R., Pandit, R.: Shuffling heuristics for the storage location assignment in an AS/RS. Int. J. Prod. Res. 33(6), 1661–1672 (1995)CrossRefzbMATHGoogle Scholar
  16. 16.
    Neuhäuser, D., Ein Ansatz zur simulationsgestützten Planung und Bewertung von Lagerreorganisationsmaßnahmen am Beispiel des Lebensmittelhandels. PhD thesis, Institut für Fördertechnik und Logistik, Fakultät Konstruktions-, Produktions- und Fahrzeugtechnik, Universität Stuttgart, Germany (2013)Google Scholar
  17. 17.
    Pierre, B., Vannieuwenhuyse, B., Dominanta, D., Van Dessel, H.: Dynamic ABC storage policy in erratic demand environments. Jurnal Teknik Industri 5(1), 1–12 (2003)Google Scholar
  18. 18.
    Sadiq, M.: A Hybrid Clustering Algorithm for Reconfiguration of Dynamic Order Picking Systems. PhD thesis, University of Arkansas (1993)Google Scholar
  19. 19.
    Tompkins, J., White, J., Bozer, Y., Tanchoco, J.: Facilities Planning, 4th edn. Wiley, New York (2010)Google Scholar
  20. 20.
    Wagner, S.: Heuristic Optimization Software Systems—Modeling of Heuristic Optimization Algorithms in the HeuristicLab Software Environment. PhD thesis, Johannes Kepler University, Linz, Austria (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Monika Kofler
    • 1
    Email author
  • Andreas Beham
    • 1
  • Stefan Wagner
    • 1
  • Michael Affenzeller
    • 1
  1. 1.Heuristic and Evolutionary Algorithms Laboratory (HEAL)University of Applied Sciences Upper AustriaHagenbergAustria

Personalised recommendations