Skip to main content

Advertisement

Springer Nature Link
Log in

Worm optimization for the multiple level warehouse layout problem

  • RAOTA-2016
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, the NP-complete multiple level warehouse layout problem is addressed. The problem consists of assigning items to cells and levels with the objective of minimizing transportation costs. A worm optimization algorithm (WO) is introduced, based on the foraging behaviors of Caenorhabditis elegans (Worms), and its performance was assessed by comparing with a genetic algorithm (GA), ant colony optimization (ACO), and an exact solution (B&B) for small problems. The computational results reflected the superiority of WO in large problems, with a marginally better performance than ACO and GA in smaller ones, while solving the tested problems within a reasonable computational time. Furthermore, WO was able to attain most of the known optimal solutions.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Abdinnour-Helm, S., & Hadley, S. W. (2000). Tabu search based heuristics for multi-floor facility layout. International Journal of Production Research, 38, 365–383.

    Article  Google Scholar 

  • Armour, G. C., & Buffa, E. S. (1963). A heuristic algorithm and simulation approach to relative allocation of facilities. Management Science, 9, 294–300.

    Article  Google Scholar 

  • Arnaout, J.-P. (2013). Ant colony optimization algorithm for the Euclidean location–allocation problem with unknown number of facilities. Journal of Intelligent Manufacturing, 24, 45–54.

    Article  Google Scholar 

  • Arnaout, J.-P. (2016). Worm optimization for the traveling salesman problem. In G. Rabadi (Ed.), Heuristics, meta-heuristics and approximate methods in planning and scheduling, international series in operations research and management science. Gewerbestrasse: Springer.

    Google Scholar 

  • Arnaout, J.-P., Arnaout, G., & Khoury, J. (2016). Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location–allocation problem. Journal of Industrial and Management Optimization, 12(4), 1215–1225.

    Article  Google Scholar 

  • Arnaout, J.-P., El-Khoury, C., & Karayaz, G. (2017). Solving the multiple level warehouse layout problem using ant colony optimization. Operational Research: An International Journal (ORIJ). https://doi.org/10.1007/s12351-017-0334-5.

  • Avery, L., & You, Y. J. (May 21, 2012). C. elegans feeding, WormBook ed. The C. elegans Research Community, WormBook. Available: http://www.wormbook.org/chapters/www_feeding/feeding.pdf. Accessed Jun 26, 2017.

  • Block, T. E. (1977). Note—A note on “Comparison of computer algorithms and visual based methods for plant layout” by M. Scriabin and R. C. Vergin. Management Science, 24(2), 235–237.

    Article  Google Scholar 

  • Bozer, Y. A., Meller, R. D., & Erlebacher, S. J. (1994). An improvement-type layout algorithm or single and multi-floor facilities. Management Science, 40, 918–932.

    Article  Google Scholar 

  • Brenner, S. (1974). The genetics of Caenorhabditis elegans. Genetics, 77, 71–94.

    Google Scholar 

  • Buffa, E. S., Armour, G. C., & Vollmann, T. E. (1964). Allocating facilities with craft. Harvard Business Review, 42, 136–158.

    Google Scholar 

  • Burkard, R., Fruhwirth, B., & Rote, G. (1995). Vehicle routing in an automated warehouse: Analysis and optimization. Annals of Operation Research, 57, 29–44.

    Article  Google Scholar 

  • Delmaire, H., Langevin, A., & Riopel, D. (1997). Skeleton-based facility layout design using genetic algorithms. Annals of Operations Research, 69, 85–104.

    Article  Google Scholar 

  • Dorigo, M., & Gambardella, L. M. (1997). Ant colonies for the travelling salesman problem. BioSystems, 43, 73–81.

    Article  Google Scholar 

  • Dougherty E C. (1955). The genera and species of subfamily Rhabditinae Micoletzky 1922 (Nematoda): A nomenclatorial analysis-including an addendum on the composition of the family Rhabditidae Örley, 1880. Journal of Helminthology, 29,105–152.

  • Ferris, H. (19 December 2014). Caenorhabditis elegans. University of California, Davis. http://plpnemweb.ucdavis.edu/nemaplex/Taxadata/G900S2.htm. Accessed Jun 26, 2017.

  • Fisher, R. A. (1960). The design of experiments. New York: Hafner Publishing Company.

    Google Scholar 

  • Guerriero, F., Pisacane, O., & Rende, F. (2015). Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints. Applied Mathematical Modelling, 39(23), 7375–7389.

    Article  Google Scholar 

  • Hahn, P., Smith, J. M., & Zhu, Y.-R. (2010). The multi-story space assignment problem. Annals of Operation Research, 179, 77–103.

    Article  Google Scholar 

  • Hu, P. J. (August 08, 2007). Dauer, WormBook, ed. The C. elegans Research Community, WormBook. Available: http://www.wormbook.org/chapters/www_dauer/dauer.pdf. Accessed June 26, 2017.

  • Jabr, F. (2012). The connectome debate: Is mapping the mind of a worm worth it? Scientific American, a division of Nature America, Inc. Available: http://www.scientificamerican.com/article/c-elegans-connectome/. Accessed June 26, 2017.

  • Johnson, R. V. (1982). SPACECRAFT for multi-floor layout planning. Management Science, 30, 648–649.

    Google Scholar 

  • Kochhar, J. S., & Heragu, S. S. (1998). MULTI-HOPE: A tool for multiple floor layout problems. International Journal of Production Research, 36, 3421–3435.

    Article  Google Scholar 

  • Lai, K. K., Zhang, G. Q., & Xue, J. (2002). Layout design for a paper reel warehouse: A two-stage heuristic approach. International Journal of Production Research, 40, 731–744.

    Article  Google Scholar 

  • Lee, K. Y., Roh, M.-I., & Jeong, H. S. (2005). An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages. Computers & Operations Research, 32, 879–899.

    Article  Google Scholar 

  • Lockery, S. (2009). A social hub for worms. Nature, 458, 1124–1125.

    Article  Google Scholar 

  • Macosko, E., Pokala, N., Feinberg, E., Chalasani, S., Butcher, R., Clardy, J., et al. (2009). A hub-and-spoke circuit drives pheromone attraction and social behavior in C. elegans. Nature, 458, 1171–1176.

    Article  Google Scholar 

  • Matić, D., Filipovic, V., Savic, A., & Stanimirovic, Z. (2011). A genetic algorithm for solving multiple warehouse layout problem. Kragujevac Journal of Mathematics, 35, 119–138.

    Google Scholar 

  • Matić, M., Stanimirović, Z., Djenić, A., & Stanojević, P. (2014). Memetic algorithm for solving the multilevel uncapacitated facility location problem. Informatica, 25(3), 439–466.

    Article  Google Scholar 

  • Maupas, Émile. (1900). Modes et formes de reproduction des nematodes. Archives de Zoologie Expérimentale et Générale, 8, 463–624.

    Google Scholar 

  • Meller, R.-D., & Bozer, Y.-A. (1996). A new simulated annealing algorithm for the facility layout problem. International Journal of Production Research, 34, 1675–1692.

    Article  Google Scholar 

  • NIST/SEMATECH. (2016). e-Handbook of statistical methods. http://www.itl.nist.gov/div898/handbook/. Accessed October 25, 2016.

  • Önüt, S., Tuzkaya, U. R., & Dogac, B. (2008). A particle swarm optimization algorithm for the multiple-level warehouse layout design problem. Computers and Industrial Engineering, 54, 783–99.

    Article  Google Scholar 

  • Ortiz-Astorquiza, C., Contreras, I., & Laporte, G. (2015). Multi-level facility location as the maximization of a submodular set function. European Journal of Operational Research, 247(3), 1013–1016.

    Article  Google Scholar 

  • Osche G. Systematik und Phylogenie der Gattung Rhabditis (Nematoda). Zoologische Jahrbucher-Abt. Zool. Phys. der Tiere. 1952;81:190–280.

  • Ross, P. (1996). Taguchi techniques for quality engineering. New York: McGraw Hill.

    Google Scholar 

  • Scriabin, M., & Vergin, R. C. (1975). Comparison of computer and visual methods for plant layout-A rejoinder. Management Science, 23, 172–181.

    Article  Google Scholar 

  • Shtonda, B. B., & Avery, L. (2006). Dietary choice behavior in Caenorhabditis elegans. The Journal of Experimental Biology, 209, 89–102.

    Article  Google Scholar 

  • Taguchi, G. (1993). Taguchi methods: Design of experiments. Dearborn, MI: American Supplier Institute Inc.

    Google Scholar 

  • Wood, W. B. (1988). The nematode Caenorhabditis elegans. New York: Cold Spring Harbor Laboratory Press. ISBN 0-87969-433-5.

  • Xu, J.-X., & Deng, X. (2012). Complex chemotaxis behaviors of C. elegans with speed regulation achieved by dynamic neural networks. In Proceedings of the IEEE world congress on computational intelligence, Brisbane, Australia, June 10–15.

  • Yang, L., & Feng, Y. (2006). Fuzzy multi-level warehouse layout problem: New model and algorithm. Journal of Systems Science and Systems Engineering, 15(4), 493–503.

    Article  Google Scholar 

  • Zhang, G. Q., & Lai, K. K. (2010). Tabu search approaches for the multi-level warehouse layout problem with adjacency constraints. Engineering Optimization, 42(8), 775–790.

    Article  Google Scholar 

  • Zhang, G. Q., Xue, J., & Lai, K. K. (2002). Layout design for a paper reel warehouse: A two-stage heuristic approach. International Journal of Production Economics, 75, 231–243.

    Article  Google Scholar 

Download references

Acknowledgements

This work was funded in part by a Grant from the Kuwait Foundation for the Advancement of Sciences (KFAS Grant # P115-18EO-02).

Author information

Authors and Affiliations

  1. Department of Business Administration, Gulf University for Science and Technology, West Mishref, Kuwait

    Jean-Paul Arnaout

Authors
  1. Jean-Paul Arnaout
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jean-Paul Arnaout.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arnaout, JP. Worm optimization for the multiple level warehouse layout problem. Ann Oper Res 269, 29–51 (2018). https://doi.org/10.1007/s10479-017-2683-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2683-0

Keywords