Skip to main content

A Cellular Ant Algorithm-Based Method for Solving Stereo Warehouse Slotting Optimization Problem

  • Conference paper
  • First Online:
Proceedings of China Modern Logistics Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 286))

Abstract

A new model for the ant colony optimization (ACO) method which is optimized by combining the cellular automata (CA) is proposed in this paper. The mathematic model of slotting optimization for stereo warehouse, together with the proposed ACO-based searching process is developed. Through the evolutionary mechanism of cellular and the redistribution of pheromones, the proposed ACO method is able to improve the searching effectiveness of solution space, and the case of getting into local optimums is avoided. Compared to the traditional ACO algorithm, the proposed ACO method can find the global optimal solution easily. The efficiency of the proposed method is demonstrated in the case study.

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

Access this chapter

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

References

  1. von Neumann J (1966) Theory of self reproducing cellular automata. University of Illinois Press, Urbana and London

    Google Scholar 

  2. Cai HP, Liu JX, Chen YW, Wang H (2006) Survey of the research on dynamic weapon-target assignment problem. J Sys Eng Electron 17(3):559–565

    Article  Google Scholar 

  3. Ressler JL, Augusteijn MF (1992) Weapon target assignment accessibility using neural networks. Intell Eng Sys Through Artif Neural Networks 2:397–402

    Google Scholar 

  4. Li HR and MiaoY (2000) WTA with the maximum kill probability based on simulated annealing algorithms, the special committee of C2 and computer of the electronic technology academic committee of china, ship engineering society. Academica conference, pp 436–440

    Google Scholar 

  5. Lee ZJ, Lee CY, Su SF (2002) An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem. Appl Soft Comput J 2(1):39–47

    Article  MathSciNet  Google Scholar 

  6. Guo P, Yan WJ (2007) The review of ant colony algorithm based on TSP. J Comput Sci China 34(10):181–184 194

    Google Scholar 

  7. Macro D, Maria GL (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans EC 1(1):53–66

    Google Scholar 

  8. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans SMC 26(1):29–41

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meng Jin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, M., Mu, X., Du, F., Luo, L. (2015). A Cellular Ant Algorithm-Based Method for Solving Stereo Warehouse Slotting Optimization Problem. In: Proceedings of China Modern Logistics Engineering. Lecture Notes in Electrical Engineering, vol 286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44674-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44674-4_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44673-7

  • Online ISBN: 978-3-662-44674-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics