Skip to main content

Improved Shuffled Frog Leaping Algorithm for Solving Multi-aisle Automated Warehouse Scheduling Optimization

  • Conference paper
AsiaSim 2013 (AsiaSim 2013)

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

Included in the following conference series:

Abstract

For multi-aisle automated warehouse scheduling optimization problem, a mathematical model with constraints is established, and a new shuffled frog leaping algorithm is proposed. During the process of obtaining optimal solution, to enhance the local search ability, stepsize is adjusted adaptively, and the frog individuals are guided to update. Meanwhile, in order to maintain the diversity of the populations and strengthen the global search ability, heuristic mutation operation is embedded. This not only ensures the global optimization, but also enhances the convergence efficiency. To verify the performance of the proposed algorithm, it is compared with shuffled frog leaping algorithm (SFLA) and genetic algorithm (GA) through simulation combined the industrial real case. Results show that the proposed algorithm achieves good performance in terms of the solution quality and the convergence efficiency.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gagliardi, J.P., Renaud, J., Ruiz, A.: Models for automated storage and retrieval systems: a literature review. International Journal of Production Research 50(24), 7110–7125 (2012)

    Article  Google Scholar 

  2. Atoum, J., Rababaa, M.A.: Multiple Warehouses Scheduling Using Steady State Genetic Algorithms. The International Arab Journal of Information Technology 7(3), 310–316 (2010)

    Google Scholar 

  3. Yu, M.F., Koster, R.D.: Enhancing performance in order picking processes by dynamic storage systems. International Journal of Production Research (48), 4785-4806 (2010)

    Google Scholar 

  4. Nishi, T., Konishi, M.: An optimisation model and its effective beam search heuristics for floor-storage warehousing systems. International Journal of Production Research (48), 1947-1966 (2010)

    Google Scholar 

  5. Chan, F.T.S., Kumar, V.: Hybrid TSSA algorithm-based approach to solve warehouse-scheduling problems. International Journal of Production Research 47(4), 919–940 (2009)

    Article  MATH  Google Scholar 

  6. De Koster, R.B.M., Le Duc, T., Yugang, Y.: Optimal storage rack design for a 3-dimensional compact AS/RS. International Journal of Production Research 46(6), 1495–1514 (2008)

    Article  MATH  Google Scholar 

  7. Eusuff, M., Lansey, K.: Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm. Journal of Water Resources Planning and Management 129(3), 210–225 (2003)

    Article  Google Scholar 

  8. Gao, H.Y., Cao, J.L.: Membrane-inspired quantum shuffled frog leaping algorithm for spectrum allocation. Journal of Systems Engineering and Electronics 23(5), 679–688 (2012)

    Google Scholar 

  9. Bijami, E., Askari, J., Farsangi, M.M.: Design of stabilising signals for power system damping using generalised predictive control optimised by a new hybrid shuffled frog leaping algorithm. IET Generation, Transmission and Distribution 6(10), 1036–1045 (2012)

    Article  Google Scholar 

  10. Wang, N., Li, X., Chen, X.H.: Fast three-dimensional Otsu thresholding with shuffled frog-leaping algorithm. Pattern Recognition Letters 31(13), 1809–1815 (2010)

    Article  Google Scholar 

  11. Jafari, A., Bijami, E., Bana, H.R., et al.: A design automation system for CMOS analog integrated circuits using New Hybrid Shuffled Frog Leaping Algorithm. Microelectronics Journal 43(11), 908–915 (2012)

    Article  Google Scholar 

  12. Park, B., Lee, J.: Optimization of coordinated-actuated traffic signal system: Stochastic optimization method based on shuffled frog-leaping algorithm. Transportation Research Record (2128), 76-85 (2009)

    Google Scholar 

  13. Pakravesh, H., Shojaei, A.: Optimization of industrial CSTR for vinyl acetate polymerization using novel shuffled frog leaping based hybrid algorithms and dynamic modeling. Computers and Chemical Engineering 35(11), 2351–2365 (2011)

    Article  Google Scholar 

  14. Eusuff, M.M., Lansey, K.E.: Optimization of water distribution network design using the shuffled frog leaping algorithm. Journal of Water Resources Planning and Management 129(3), 210–225 (2003)

    Article  Google Scholar 

  15. Hsu, C.M., Chen, K.Y., Chen, M.C.: Batching orders in warehouses by minimizing travel distance with genetic algorithms. Computers in Industry 56(2), 169–178 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, W., Deng, L., Niu, Q., Fei, M. (2013). Improved Shuffled Frog Leaping Algorithm for Solving Multi-aisle Automated Warehouse Scheduling Optimization. In: Tan, G., Yeo, G.K., Turner, S.J., Teo, Y.M. (eds) AsiaSim 2013. AsiaSim 2013. Communications in Computer and Information Science, vol 402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45037-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45037-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45036-5

  • Online ISBN: 978-3-642-45037-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics