Determining the Shortest Path for Inner Warehouse Transportation
Article Sidebar
Main Article Content
Abstract
Always meeting customer needs is the primary goal of logistic service companies specializing in warehousing. However, warehouses are often large, and the movement of goods in the warehouse is problematic because it takes a long time and slows the order-picking process. This problem can be solved if storage assignment and the optimal warehouse movement route are appropriately planned. This study compares the use of Dynamic Programming models for two data in this warehouse in determining the shortest path for the Order Picker in completing and fulfilling customer orders.
Article Details
License
Copyright (c) 2023 Noraimi Azlin Mohd Nordin, S.Sarifah Radiah Shariff, Siti Suzlin Supadi, Yosi Pahala
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
Anđelković, A., & Radosavljević, M. (2018). Improving the order-picking process through implementation of the warehouse management system. Strategic Management-International Journal of Strategic Management and Decision Support Systems in Strategic Management, 23(1).
Bhowmik, B. (2010). Dynamic Programming - Its Principles, Applications, Strengths, and Limitations. International Journal of Engineering Science and Technology, 2(9), 4822-4826.
Bouman, P., Agatz, N., & Schmidt, M. (2016). <154419746.pdf>. 9(1), 61-63. doi:10.1145?321105.321111
Chen, F., Xu, G., & Wei, Y. (2018). Heuristic routing methods in multiple-block warehouses with ultra-narrow aisles and access restriction. International Journal of Production Research, 57(1), 228-249. doi:10.1080/00207543.2018.1473657
de las Casas, P. M., Sedeno-Noda, A., & Borndörfer, R. (2021). An improved multiobjective shortest path algorithm. Computers & Operations Research, 135, 105424.
de Leeuw, S. & Wiers, V. C. S. (2010). Warehouse manpower planning strategies in times of financial crisis: evidence from logistics service providers and retailers in the Netherlands. Production Planning and Control, 2, 1-16.
Dobrilovic, D., Jevtic, V., Beker, I., & Stojanov, Z. (2012). Shortest-path based Model for Warehouse Inner Transportation Optimization. 7th IEEE International Symposium on Applied Computational Intelligence and Informatics, 63-68. doi:978-1-4673-1014-7
Ferone, D., Festa, P., Fugaro, S., & Pastore, T. (2021). A dynamic programming algorithm for solving the k-Color Shortest Path Problem. Optimization Letters, 15(6), 1973-1992.
Ghani, N. E. A., Shariff, S. S. R., & Zahari, S. M. (2016). An alternative algorithm for vehicle routing problems with time windows for daily deliveries. Advances in Pure Mathematics, 6(5), 342-350.
Gutenschwager, K., Radtke, A., Volker, S., & Zeller, G. (2012). The Shortest Path: Comparison of Different Approaches and Implementation for the Automatic Routing of Vehicles. Proceedings of the 2012 Winter Simulation Conference, 3312-3323. doi:978-4673-4782-2
Heragu, S. S., Du, L., Mantel, R. J., & Schuur, P. C. (2005). A mathematical model for warehouse design and product allocation. International Journal of Production Research, 43(2), 327-338. doi:10.1080/00207540412331285841
Labus, N., & Gajsek, B. (2018). Use of Ergonomic Principles in Manual Order Picking Systems. Logistics & Sustainable Transport, 9(1), 11-22.
Lantoine, G., & Russell, R. P. (2012). A hybrid differential dynamic programming algorithm for constrained optimal control problems. Part 1: Theory. Journal of Optimization Theory and Applications, 154, 382-417.
Lee, J. A., Chang, Y. S., Shim, H.-J., & Cho, S.-J. (2015). A Study on the Picking Process Time. Procedia Manufacturing, 3, 731-738. doi:10.1016/j.promfg.2015.07.316
Lewis, R. (2020). Algorithms for finding shortest paths in networks with vertex transfer penalties. Algorithms, 13(11), 269.
Liu, J & Limere, V. (2012). An Improved Largest Gap Routing Heuristic For Order Picking. Industrial Management, 1–5.
Liu, D., Yu, W., Baldi, S., Cao, J., & Huang, W. (2019). A switching-based adaptive dynamic programming method to optimal traffic signaling. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(11), 4160-4170.
Ma'mun, S., Kusrini, E., Indah Asmarawati, C., Masita Sari, G., Nurjanah, A., Kisanjani, A., . . . Purnomo, M. R. A. (2018). Warehousing performance improvement using Frazelle Model and per group benchmarking: A case study in the retail warehouse in Yogyakarta and Central Java. MATEC Web of Conferences, 154, 01091. doi:10.1051/matecconf/201815401091
Masae, M., Glock, C. H., & Vichitkunakorn, P. (2020). Optimal order picker routing in a conventional warehouse with two blocks and arbitrary starting and ending points of a tour. International Journal of Production Research, 58(17), 5337-5358.
McKinnon, A., Flöthmann, C., Hoberg, K., & Busch, C. (2017). Logistics competencies, skills, and training: a global overview. World Bank Publication
Mirzaei, M., Zaerpour, N., & De Koster, R. (2021). The impact of integrated cluster-based storage allocation on parts-to-picker warehouse performance. Transportation Research Part E: Logistics and Transportation Review, 146, 102207.
Ngah, R., Abdullah, J., Khalique , M. ., & Goyipnazarov, S. B. . (2021). The Influence of Socio-Economics on Travel Behavior of Public Transportation in Malaysia. Environment-Behaviour Proceedings Journal, 6(17), 269-275.
Nordin, N. A. M., Omar, M., & Shariff, S. S. R. (2018). The Application of Dynamic Programming Method in Finding Shortest Path for Order Picker with Limited Picking Capacity. An International Journal, 13, 20-48.
Queirolo, F., Tonelli, F., Schenone, M., Nan, P. & Zunino, I. (2002). Warehouse Layout Design Minimizing Travel Time with a Genetic and Simulative Approach. Simulation Symposium, 14th Edition, 2-6.
Rahmat, A. K., Razak, A. H. A., Yusak, N. A. M., & Pahim, K. M. (2022). Refining Electronic Hailing Service Quality on Customer Satisfaction and Impact on Electronic Word of Mouth. Environment-Behaviour Proceedings Journal, 7(SI8), 61-67.
Roodbergen, K. J., & Koster, R. (2001). Routing methods for warehouses with multiple cross aisles. International Journal of Production Research, 39(9), 1865-1883. doi:10.1080/00207540110028128
Rushton, A., Croucher, P., & Baker, P. (2022). The handbook of logistics and distribution management: Understanding the supply chain. Kogan Page Publishers.
Şenaras, A. E., İnanç, Ş., Sezen, H. K., & Şenaras, O. M. (2021). Shortest Route Application via Dynamic Programming in the Transportation Networks. In Handbook of Research on Decision Sciences and Applications in the Transportation Sector (pp. 362-371). IGI Global.
Shariff, S. R. ., Mohd Nordin, N. A. ., Omar, M. ., & Supadi, S. S. . (2022). Modeling the Inner Warehouse Shortest Route Planning using Dynamic Programming Block . Environment-Behaviour Proceedings Journal, 7(SI9), 611-617.
Singhal, D. A., & Pandey, P. (2016). Travelling Salesman Problems by Dynamic Programming Algorithm. Scientific Engineering and Applied Science (IJSEAS), 2(1), 263-267.
Vrysagotis, V., & Kontis, P. A. (2011). Warehouse layout problems : Types of problems and solution algorithms. Journal of Computations & Modelling, 1(1), 131-152.
Wang, S., Zhen, L. & Zhuge, D. (2018). Dynamic programming algorithms for the selection of waste disposal ports in cruise shipping. doi:10.1016/j.trb.2017.12.01
Weidinger, F. (2018). Picker routing in rectangular mixed shelves warehouses. Computers & Operations Research, 95, 139-150. doi:10.1016/j.cor.2018.03.012
Zakaria, A., & Zurcher, S. A. (2023). An Analysis of Sustainability Approaches of Malaysian Public Universities. Environment-Behaviour Proceedings Journal, 8(23)