Warehouse Storage Assignment by Genetic Algorithm with Multi-objectives

  • Chi-Bin ChengEmail author
  • Yu-Chi Weng
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 903)


The proper assignment of storages to stocks prior to their picking is critical to reduce order picking costs. Appropriate storage assignments can also shorten storing time, improve storage utilization, and facilitate inventory management. Three objectives are considered: minimizing the routing length of storing stocks, maximizing the future chance of adjacent stocks to be picked together, and minimizing the storage distance to the access point for popular stocks. This study devises a genetic algorithm to find feasible solutions and uses a method to determine the final storage assignment from a set of Pareto solutions.


Storage assignment problem Distribution center Genetic algorithm Multi-objective decision making Order picking 


  1. 1.
    Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A.: Facilities Planning. Wiley, Hoboken (2010)Google Scholar
  2. 2.
  3. 3.
    Mela, C.F., Lehmann, D.R.: Using fuzzy set theoretic techniques to identify preference rules from interactions in the linear model: an empirical study. Fuzzy Sets Syst. 71, 165–181 (1995)CrossRefGoogle Scholar
  4. 4.
    Derringer, G., Suich, R.: Simultaneous optimization of several response variable. J. Qual. Technol. 12, 214–219 (1980)CrossRefGoogle Scholar
  5. 5.
    Bortolini, M., Faccio, M., Ferrari, E., Gamberi, M., Pilati, F.: Fresh food sustainable distribution: cost, delivery time and carbon footprint three-objective optimization. J. Food Eng. 174, 56–67 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Information ManagementTamkang UniversityNew Taipei CityTaiwan

Personalised recommendations