Optimization of Location Assignment for Unit-Load AS/RS with a Dual-Shuttle
AbstractAutomated Storage and Retrieval Systems (AS/RS) offer several advantages such as gaining space, reducing human errors, and completing more storing and retrieving tasks in less time to large size warehouses. Machines included multi-shuttle systems are designed to carry multiple loads in one cycle on the purpose of develop the performance. This paper deals with a quadruple command cycle location assignment method in unit-load dual-shuttle AS/RS. Also, it is shown how to solve location assignment problem using Particle Swarm Optimization (PSO) with the objective of shortest travel distance therewithal shortest travel time. Binary Coded Genetic Algorithm (BGA) and Real Coded Genetic Algorithm (RGA) are developed to validate result obtained. At the end, ten numerical examples for two scenarios designed small size and large size are presented to prove the implementation of the proposed method. Results showed that PSO accomplished to find optimal solution for shortest travel distance of AS/RS machine.
Y. H. Hu, Z. D. Zhu, and W. J. Hsu, “Load shuffling algorithms for split-platform AS/RS,” Robotics and Computer-Integrated Manufacturing, vol. 26, pp. 677-685, 2010.
H. Min, “The applications of warehouse management systems: an exploratory study,” International Journal of Logistics: Research and Applications, vol. 9, no:2, pp. 111-126, June 2006.
K. J. Roodbergen and I. F. A. Vis, “A survey of literature on automated storage and retrieval systems,” European Journal of Operational Research, vol. 194, pp. 343-362, 2009.
A. R. Nia, H. Haleh, and A. Saghaei, “Dual command cycle dynamic sequencing method to consider GHG efficiency in unit-load multiple-rack automated storage and retrieval systems,” Computers & Industrial Engineering, vol. 111, pp. 89-108, 2017.
M. Rajković, N. Zrnić, N. Kosanić, M. Borovinšek, and T. Lerher, “A Multi-Objective Optimization model for minimizing cost, travel time and CO2 emission in an AS/RS,” FME Transactions, vol. 45, no. 4, pp. 620-629, 2017.
Y. Kung, Y. Kobayashi, T. Higashi, M. Sugi, and J. Ota, “Order scheduling of multiple stacker cranes on common rails in an automated storage/retrieval system,” International Journal of Production Research, vol. 52, no. 4, pp. 1171-1187, October 2013.
A. Azzi, D. Battini, M. Faccio, A. Persona, and F. Sgarbossa, “Innovative travel time model for dual-shuttle automated storage/retrieval systems,” Computers & Industrial Engineering, vol. 61, pp. 600-607, 2011.
K. Hachemi, Z. Sari, and N. Ghouali, “A step-by-step dual cycle sequencing method for unit-load automated storage and retrieval systems,” Computers & Industrial Engineering, vol. 63, pp. 980-984, 2012.
D. Popovic, M. Vidovic, and N. Bjelic, “Application of genetic algorithms for sequencing of AS/RS with a triple shuttle module in class-based storage,” Flexible Services and Manufacturing Journal, vol 26, pp. 432-453, 2014.
S. Brezovnik, J. Gotlih, J. Balič, K. Gotlih, and M. Brezočnik, “Optimization of an Automated Storage and Retrieval Systems by Swarm Intelligence,” Procedia Engineering, vol. 100, pp. 1309-1318, 2015.
P. Yang, L. Miao, Z. Xue, and B. Ye, “Variable neighbourhood search heuristic for storage location assignment and storage/retrieval scheduling under shared storage in multi-shuttle automated storage/retrieval systems,” Transportation Research Part E, vol. 79, pp. 164-177, 2015.
T. Wauters, F. Villa, J. Christiaens, R. A. Valdes, and G. V. Berghe, “A decomposition approach to dual shuttle automated storage and retrieval systems,” Computers & Industrial Engineering, vol. 111, pp. 325-337, 2016.
X. H. Shi, X. L. Xing, Q. X. Wang, L. H. Zhang, X. W. Yang, C. G. Zhou, and Y. C. Liang, “A discrete PSO method for generalized TSP problem,” in Proc. ICMLC, Shangai, China, 2004, pp. 2378-2383.
J. Kennedy and R. Eberhart, “Particle Swarm Optimization,” in Proc. ICNN, Perth, WA, Australia, 1995, pp. 1942-1948.
P. Özkan-Bakbak and M. Peker, “Particle Swarm Optimization Design of Optical Directional Coupler Based on Power Loss Analysis,” International Journal of Intelligent Systems and Applications in Engineering, vol. 1, no. 2, pp. 29-33, 2013.
H. Kahramanlı and N. Allahverdi, “Particle Swarm Optimization with Flexible Swarm for Unconstrained Optimization,” International Journal of Intelligent Systems and Applications in Engineering, vol. 1, no. 1, pp. 8-13, 2013.
H. H. Çevik, H. Harmancı, and M. Çunkaş, “Forecasting Hourly Electricity Demand Using a Hybrid Method,” in Proc. ICCED, London, UK, 2017, pp. 8-12.
J. C. H. Pan, P. H. Shih, M. H. Wu, and J. H. Lin, “A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system,” Computers & Industrial Engineering, vol. 81, pp. 1-13, 2015.
D. Whitley, “A genetic algorithm tutorial,” Statistics and Computing, vol. 4, no. 2, pp. 65-85, June 1994.
M. Kurdi, “An effective genetic algorithm with a critical-path-guided Giffler and Thompson crossover operator for job shop scheduling problem,” International Journal of Intelligent Systems and Applications in Engineering, vol. 7, no. 1, pp. 13-18, 2019
Copyright (c) 2019 International Journal of Intelligent Systems and Applications in Engineering
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.