Nothing Special   »   [go: up one dir, main page]

Skip to main content

Research on Optimization of Warehouse Allocation Problem Based on Improved Genetic Algorithm

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 952))

Abstract

In this paper, a mathematical model is established for the distribution of cargo warehouses in a three-dimensional warehouse. This model is a multi-objective optimization problem which considers three factors: shelf stability, time of delivery, and association rules among goods. This paper uses the simulated annealing algorithm to solve the problem that the traditional genetic algorithm “easily falls into the local optimal solution” in the search problem, and combines the improved genetic algorithm and the objective function to distribute the goods in the goods. The experimental results show that the improved genetic algorithm is better than the traditional genetic algorithm in time and the optimization of the objective function, which improves the efficiency of the whole warehouse and reduces the operation cost of the enterprise.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Similar content being viewed by others

References

  1. Enrico, M., Giacomo, N., Dimitri, T.: Optimizing allocation in a warehouse network. Electron. Notes Discrete Math. 64, 195–204 (2018)

    Article  MathSciNet  Google Scholar 

  2. Mourad, M., Paul, R., Karine, E., Samuel, V., Botta, G., Thibard, M.: Pooled warehouse management: an empirical study. Comput. Ind. Eng. 112, 526–536 (2017)

    Article  Google Scholar 

  3. Lu, C., Lu, Z.: The storage location assignment problem for outbound containers in a maritime terminal. Int. J. Prod. Econ. 135(1), 73–80 (2012)

    Article  Google Scholar 

  4. Li, J., Yang, G., Chen, F.: Research on location assignment of retail e-commerce storage cente. Ind. Eng. Manag. 4, 102–108 (2013)

    Google Scholar 

  5. Faraz, R., Jennifer, A.: Analytical models for an automated storage and retrieval system with multiple in-the-aisle pick positions. IIE Trans. 46(9), 968–986 (2014)

    Article  Google Scholar 

  6. SAP Homepage. https://www.saponlinetutorials.com. Accessed 21 Dec 2017

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Project Number: 71472081).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wang Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ning, D., Li, W., Wei, T., Yue, Z. (2018). Research on Optimization of Warehouse Allocation Problem Based on Improved Genetic Algorithm. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 952. Springer, Singapore. https://doi.org/10.1007/978-981-13-2829-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2829-9_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2828-2

  • Online ISBN: 978-981-13-2829-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics