KaydedilenlerDerginizi ekleyin

Dergiler / Verimlilik Dergisi / 2026 / Cilt: 59 Sayı: 2

Floyd-Warshall ve Karınca Kolonisi Optimizasyonu Algoritmaları ile Depo Rota Planlaması

Warehouse Route Planning via Floyd-Warshall and Ant Colony Optimization Algorithms

Furkan Ulu(BURSA ULUDAĞ ÜNİVERSİTESİ, MÜHENDİSLİK FAKÜLTESİ, ENDÜSTRİ MÜHENDİSLİĞİ BÖLÜMÜ)0000-0002-6651-4659
Gülveren Tabansız Göç(MUDANYA ÜNİVERSİTESİ, MÜHENDİSLİK, MİMARLIK VE TASARIM FAKÜLTESİ, ENDÜSTRİ MÜHENDİSLİĞİ BÖLÜMÜ)0000-0003-4204-1364
Fatih Çavdur(BURSA ULUDAĞ ÜNİVERSİTESİ, MÜHENDİSLİK FAKÜLTESİ, ENDÜSTRİ MÜHENDİSLİĞİ BÖLÜMÜ)0000-0001-8054-5606
Sayfa
337–354
Yayın Tarihi
2025-04-16
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

Amaç: Bu çalışmada, depo rota planlama problemleri için tam ve bütünleşik bir çözüm yaklaşımı önerilmektedir.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:Amaç: Bu çalışmada, depo rota planlama problemleri için tam ve bütünleşik bir çözüm yaklaşımı önerilmektedir.
📊
Temel Bulgular & Veri:Yöntem: Önerilen çözüm yaklaşımına göre, öncelikle depoda ziyaret edilmesi gereken noktaların bazılarını temsil eden bir ağ gösterimi oluşturulmaktadır.
💡
Sonuç & Katkı:Özgünlük: Çalışmanın en önemli katkısını, depo rota planlama problemi için Floyd-Warshall algoritması ile karınca kolonisi optimizasyonu algoritmasını bir arada kullanan esnek bir çözüm yaklaşımı çerçevesi sunulması oluşturmaktadır.
🔬Tür:Modelleme & Sayısal Simülasyon
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:En Kısa Yol Problemi · Gezgin Satıcı Problemi (GSP) · Floyd-Warshall Algoritması

Özet

Amaç: Bu çalışmada, depo rota planlama problemleri için tam ve bütünleşik bir çözüm yaklaşımı önerilmektedir. Yöntem: Önerilen çözüm yaklaşımına göre, öncelikle depoda ziyaret edilmesi gereken noktaların bazılarını temsil eden bir ağ gösterimi oluşturulmaktadır. Daha sonra, her turda bir gezgin satıcı problemi oluşturmak ve söz konusu ağ yapısının ilgili düğümler arasındaki en kısa yolların belirlenmesi için Floyd-Warshall algoritması kullanılmaktadır. Son olarak, aracın toplam seyahat mesafesini minimize ederek ilgili gezgin satıcı probleminin çözümünü sağlamak için karınca kolonisi optimizasyonu algoritması kullanılmaktadır. Bulgular: Önerilen çözüm yaklaşımının performansını göstermek için çeşitli veri kümeleri ile hesaplamalı deneyler gerçekleştirilmiştir. Sonuçların oldukça tatmin edici olduğu ve önerilen çözüm metodolojisinin depo rota planlamasında önemli faydalar sağlayabileceği gözlemlenmiştir. Özgünlük: Çalışmanın en önemli katkısını, depo rota planlama problemi için Floyd-Warshall algoritması ile karınca kolonisi optimizasyonu algoritmasını bir arada kullanan esnek bir çözüm yaklaşımı çerçevesi sunulması oluşturmaktadır.

Abstract

Purpose: In this study, we propose a complete and integrated solution approach for warehouse route planning problems. Methodology: According to the proposed solution approach, a graph representation of the warehouse is first constructed where some vertices correspond to points to be visited. The Floyd-Warshall algorithm is employed to calculate the shortest paths between the corresponding points of the graph to formulate a traveling salesman problem for each tour. Finally, the ant colony optimization algorithm is utilized to solve the corresponding traveling salesman problem by minimizing the total travel distance. Findings: Computational experiments are conducted with different datasets to demonstrate the performance of the proposed solution approach. It is observed that the results are quite satisfactory and the proposed solution methodology might provide significant benefits in warehouse route planning. Originality: The main important contribution of our study is the proposal of a flexible solution framework that combines the Floyd-Warshall algorithm and the ant colony optimization algorithm for the general route planning problem.

🔖

Bu Makaleye Atıf Yap

Ulu, F., Göç, G. T., Çavdur, F. (2025). Floyd-Warshall ve Karınca Kolonisi Optimizasyonu Algoritmaları ile Depo Rota Planlaması. Verimlilik Dergisi, Cilt: 59 Sayı: 2, 337–354. https://doi.org/10.51551/verimlilik.1539618

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (67)

  1. Aerts, B., Cornelissens, T. ve Sörensen, K. (2021). “The Joint Order Batching and Picker Routing Problem: Modelled and Solved as a Clustered Vehicle Routing Problem”, Computers & Operations Research, 129, 105168. https://doi.org/10.1016/j.cor.2020.105168
  2. Alnahhal, M. ve Noche, B. (2015). “Dynamic Material Flow Control in Mixed Model Assembly Lines”, Computers & Industrial Engineering, 85, 110-119. https://doi.org/10.1016/j.cie.2015.03.009
  3. Ardjmand, E., Bajgiran, O.S. ve Youssef, E. (2019). “Using List-Based Simulated Annealing and Genetic Algorithm for Order Batching and Picker Routing in Put Wall Based Picking Systems”, Applied Soft Computing, 75, 106-119. https://doi.org/10.1016/j.asoc.2018.11.019
  4. Ardjmand, E., Ghalehkhondabi, I., Young II, W.A., Sadeghi, A., Weckman, G.R. ve Shakeri, H. (2020). “A Hybrid Artificial Neural Network, Genetic Algorithm and Column Generation Heuristic for Minimizing Makespan in Manual Order Picking Operations”, Expert Systems with Applications, 159, 113566. https://doi.org/10.1016/j.eswa.2020.113566
  5. Baker, P. ve Canessa, M. (2009). “Warehouse Design: A Structured Approach”, European Journal of Operational Research, 193(2), 425-436. https://doi.org/10.1016/j.ejor.2007.11.045
  6. Bottani, E., Montanari, R., Rinaldi, M. ve Vignali, G. (2015). “Intelligent Algorithms for Warehouse Management”, Intelligent Techniques in Engineering Management, Intelligent Systems Reference Library, 87, (Editör: C. Kahraman, S. Çevik Onar), Springer, Cham, 645-667. https://doi.org/10.1007/978-3-319-17906-3_25
  7. Calzavara, M., Sgarbossa, F. ve Persona, A. (2019). “Vertical Lift Modules for Small Items Order Picking: An Economic Evaluation”, International Journal of Production Economics, 210, 199-210. https://doi.org/10.1016/j.ijpe.2019.01.012
  8. Cano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A. ve Cortes, P. (2019). “Genetic Algorithms for the Picker Routing Problem in Multi-Block Warehouses”, International Conference on Business Information Systems, 313-322. https://doi.org/10.1007/978-3-030-20485-3_24
  9. Cano, J.A., Cortes, P., Munuzuri, J. ve Correa-Espinal, A. (2024). “Solving the Picker Routing Problem in Multi-Block High-Level Storage Systems Using Metaheuristics”, Flexible Services and Manufacturing Journal, 35(2), 376-415. https://doi.org/10.1007/s10696-022-09445-y
  10. Caron, F., Marchet, G. ve Perego, A. (1998). “Routing Policies and COI-Based Storage Policies in Picker-to-Part Systems”, International Journal of Production Research, 36(3), 713-732. https://doi.org/10.1080/002075498193651
  11. Caron, F., Marchet, G. ve Perego, A. (2000). “Optimal Layout in Low-Level Picker-to-Part Systems”, International Journal of Production Research, 38(1), 101-117. https://doi.org/10.1080/002075400189608
  12. Cergibozan, Ç. ve Tasan, A.S. (2022). “Genetic Algorithm Based Approaches to Solve the Order Batching Problem and A Case Study In A Distribution Center”, Journal of Intelligent Manufacturing, 33(1), 137-149. https://doi.org/10.1007/s10845-020-01653-3
  13. Cheng, C.Y., Chen, Y.Y., Chen, T.L. ve Yoo, J.J.W. (2015). “Using A Hybrid Approach Based on the Particle Swarm Optimization and Ant Colony Optimization to Solve A Joint Order Batching and Picker Routing Problem”, International Journal of Production Economics, 170, 805-814. https://doi.org/10.1016/j.ijpe.2015.03.021
  14. Çelik, M. ve Süral, H. (2019). “Order Picking in Parallel-Aisle Warehouses with Multiple Blocks: Complexity and A Graph Theory-Based Heuristic”, International Journal of Production Research, 57(3), 888-906. https://doi.org/10.1080/00207543.2018.1489154
  15. De Santis, R., Montanari, R., Vignali, G. ve Bottani, E. (2018). “An Adapted Ant Colony Optimization Algorithm for the Minimization of the Travel Distance of Pickers in Manual Warehouses”, European Journal of Operational Research, 267(1), 120-137. https://doi.org/10.1016/j.ejor.2017.11.017
  16. de Souza, M.C., de Carvalho, C.R. ve Brizon, W.B. (2008). “Packing Items to Feed Assembly Lines”, European Journal of Operational Research, 184(2), 480-489. https://doi.org/10.1016/j.ejor.2006.09.091
  17. DHaen, R., Ramaekers, K., Moons, S. ve Braekers, K. (2024). “A Real‐Life Study on the Value of Integrated Optimization in Order Picking Operations under Dynamic Order Arrivals”, Networks, 84(3), 345-362. https://doi.org/10.1002/net.22237
  18. Dijkstra, E.W. (1959). “A Note on Two Problems in Connexion with Graphs”, Numerische Mathematik, (1), 269-271. https://doi.org/10.1007/BF01386390
  19. Dorigo, M. ve Gambardella, L.M. (1997). “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem”, IEEE Transactions on Evolutionary Computation, 1(1), 53-66. https://doi.org/10.1109/4235.585892
  20. Dorigo, M. ve Stutzle, T. (2004). Ant Colony Optimization, Cambridge, MIT Press, MA. https://doi.org/10.7551/mitpress/1290.001.0001
  21. Dorigo, M., Di Caro, G. ve Gambardella L.M. (1999). “Ant Algorithms for Discrete Optimization”, Artificial Life, 5(2), 137-72. https://doi.org/10.1162/106454699568728
  22. Dorigo, M., Maniezzo, V. ve Colorni, A. (1996). “Ant System: Optimization by A Colony of Cooperating Agents”, IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 26(1), 29-41. https://doi.org/10.1109/3477.484436
  23. Dukic, G. ve Oluic, C. (2007). “Order-Picking Methods: Improving Order-Picking Efficiency”, International Journal of Logistics Systems and Management, 3(4), 451-460. https://doi.org/10.1504/IJLSM.2007.013214
  24. Emde, S. ve Boysen, N. (2012a). “Optimally Locating In-House Logistics Areas to Facilitate JIT-Supply of Mixed-Model Assembly Lines”, International Journal of Production Economics, 135(1), 393-402. https://doi.org/10.1016/j.ijpe.2011.07.022
  25. Emde, S. ve Boysen, N. (2012b). “Optimally Routing and Scheduling Tow Trains for JIT-Supply of mixed-model Assembly Lines”, European Journal of Operational Research, 217(2), 287-299. https://doi.org/10.1016/j.ejor.2011.09.013
  26. Floyd, R.W. (1962). “Algorithm 97: Shortest Path”, Communications of the ACM, 5(6), 345. https://doi.org/10.1145/367766.368168
  27. Gil-Borras, S., Pardo, E.G., Alonso-Ayuso, A. ve Duarte, A. (2021) “A Heuristic Approach for the Online Order Batching Problem with Multiple Pickers”, Computers & Industrial Engineering, 160, 107517. https://doi.org/10.1016/j.cie.2021.107517
  28. Golz, J., Gujjula, R., Gunther, H.O., Rinderer, S. ve Ziegler, M. (2012). “Part Feeding at High-Variant Mixed-Model Assembly Lines”, Flexible Services and Manufacturing Journal, 24(2), 119-141. https://doi.org/10.1007/s10696-011-9116-1
  29. Gu, J., Goetschalckx, M. ve McGinnis, L.F. (2007). “Research on Warehouse Operation: A Comprehensive Review”, European Journal of Operational Research, 177(1), 1-21. https://doi.org/10.1016/j.ejor.2006.02.025
  30. Guo, S., Singh, M. ve Goodarzi, S. (2023). “Enhance Picking Viability in E-commerce Warehouses under Pandemic”, International Journal of Production Research, 61(15), 5302-5321. https://doi.org/10.1080/00207543.2022.2101400
  31. Hall, R.W. (1993). “Distance Approximation for Routing Manual Pickers in A Warehouse”, IIE Transactions, 25(4), 76-87. https://doi.org/10.1080/07408179308964306
  32. Koster, R.D. ve Poort, E.V.D. (1998). “Routing Orderpickers in A Warehouse: A Comparison between Optimal and Heuristic Solutions”, IIE Transactions, 30, 469-480. https://doi.org/10.1023/A:1007599307171
  33. Kübler, P., Glock, C.H. ve Bauernhansl, T. (2020). “A New Iterative Method for Solving the Joint Dynamic Storage Location Assignment, Order Batching and Picker Routing Problem in Manual Picker-To-Parts Warehouses”, Computers & Industrial Engineering, 147, 106645. https://doi.org/10.1016/j.cie.2020.106645
  34. Lin, C.C., Peng, Y.C. ve Kang, J.R. (2024). “Joint Green Dynamic Order Batching and Picker Routing Problem Using PSO with Global Worst Experience”, Applied Soft Computing, 154, 111336. https://doi.org/10.1016/j.asoc.2024.111336
  35. Lu, W., McFarlane, D., Giannikas, V. ve Zhang, Q. (2016). “An Algorithm for Dynamic Order-Picking in Warehouse Operations”, European Journal of Operational Research, 248(1), 107-122. https://doi.org/10.1016/j.ejor.2015.06.074
  36. Masae, M., Glock, C.H. ve 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. https://doi.org/10.1080/00207543.2020.1724342
  37. Masae, M., Glock, C.H. ve Vichitkunakorn, P. (2021). “A Method for Efficiently Routing Order Pickers in the Leaf Warehouse”, International Journal of Production Economics, 234, 108069. https://doi.org/10.1016/j.ijpe.2021.108069
  38. Ozden, S.G., Smith, A.E. ve Gue, K.R. (2021). “A Computational Software System to Design Order Picking Warehouses”, Computers & Operations Research, 132, 105311. https://doi.org/10.1016/j.cor.2021.105311
  39. Park, B.C. (2012). “Order Picking: Issues, Systems and Models”, Warehousing in the Global Supply Chain, Editör: Manzini, R. Springer, London, 1-30. https://doi.org/10.1007/978-1-4471-2274-6_1
  40. Petersen, C. (1997). “An Evaluation of Order Picking Routing Policies”, International Journal of Operations & Production Management, 17(11), 1098-1111. https://doi.org/10.1108/01443579710177860
  41. Petersen, C. (1999). “The Impact of Routing and Storage Policies on Warehouse Efficiency”, International Journal of Operations & Production Management, 19(10), 1053-1064. https://doi.org/10.1108/01443579910287073
  42. Petersen, C. ve Aase, G. (2004). “A Comparison of Picking, Storage, and Routing Policies in Manual Order Picking”, International Journal of Production Economics, 92(1), 11-19. https://doi.org/10.1016/j.ijpe.2003.09.006
  43. Pugliese, L.D.P., Guerriero, F., Macrina, G., Matteucci, M. ve Mosca, V. (2024). “An Adaptive Large Neighborhood Search for the Order Picking Process: The Case of a Retail Distribution Company in Italy”, Procedia Computer Science, 232, 2606-2615. https://doi.org/10.1016/j.procs.2024.02.079
  44. Raith, A. ve Ehrgott, M. (2009). “A Comparison of Solution Strategies for Biobjective Shortest Path Problems”, Computers & Operations Research, 36(4), 1299-1331. https://doi.org/10.1016/j.cor.2008.02.002
  45. Rao, S.S. ve Adil, G.K. (2013). “Optimal class boundaries, number of aisles, and pick list size for low-level order picking systems”, IIE Transactions, 45, 1309-1321. https://doi.org/10.1080/0740817X.2013.772691
  46. Rasmi, S.A.B., Wang, Y. ve Charkhgard, H. (2022). “Wave Order Picking under The Mixed-Shelves Storage Strategy: A Solution Method and Advantages”, Computers & Operations Research, 137, 105556. https://doi.org/10.1016/j.cor.2021.105556
  47. Ratliff, H. ve Rosenthal, A. (1983). “Order-Picking in A Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem”, Operations Research, 31(3), 507-521. https://doi.org/10.1287/opre.31.3.507
  48. Roodbergen, K. ve de Koster, R. (2001). “Routing Methods for Warehouses with Multiple Cross Aisles”, International Journal of Production Research, 39(9), 1865-1883. https://doi.org/10.1080/00207540110028128
  49. Roodbergen, K.J., Sharp, G.P. ve Vis, I.F. (2008). “Designing the Layout Structure of Manual Order Picking Areas in Warehouses”, IIE Transactions, 40(11), 1032-1045. https://doi.org/10.1080/07408170802167639
  50. Rouwenhorst, B., Reuter, B., Stockrahm, V., van Houtum, G.J., Mantel, R.J. ve Zijm, W.H. (2000). “Warehouse Design and Control: Framework and Literature Review”, European Journal of Operational Research, 122 (3), 515-533. https://doi.org/10.1016/S0377-2217(99)00020-X
  51. Rushton A., Croucher P. ve Baker P. (2017). “The Handbook of Logistics and Distribution Management: Understanding the Supply Chain”, London, UK, 255-265.
  52. Scholz, A., Henn, S., Stuhlmann, M., Wascher, G. (2016). “A New Mathematical Programming Formulation for the Single-Picker Routing Problem”, European Journal of Operational Research, 253, 68-84, 2016. https://doi.org/10.1016/j.ejor.2016.02.018
  53. Silva, A., Coelho, L.C., Darvish, M. ve Renaud, J. (2020). “Integrating Storage Location and Order Picking Problems in Warehouse Planning”, Transportation Research Part E: Logistics and Transportation Review, 140, 102003. https://doi.org/10.1016/j.tre.2020.102003
  54. Stutzle T. ve Hoos H.H. (2000). “Max-Min Ant System”, Future Generation Computer Systems, 16(8), 889-914. https://doi.org/10.1016/S0167-739X(00)00043-1
  55. Teck, S. ve Dewil, R. (2022). “A Bi-Level Memetic Algorithm for the Integrated Order and Vehicle Scheduling in A RMFS”, Applied Soft Computing, 121, 108770. https://doi.org/10.1016/j.asoc.2022.108770
  56. Tutam, M. ve White, J.A. (2019). “Multi-Dock Unit-Load Warehouse Designs with A Cross-Aisle”, Transportation Research Part E: Logistics and Transportation Review, 129, 247-262. https://doi.org/10.1016/j.tre.2019.07.011
  57. Vaidyanathan, B.S., Matson, J.O., Miller, D.M. ve Matson, J.E. (1999). “A Capacitated Vehicle Routing Problem for Just-in-Time Delivery”, IIE Transactions, 31(11), 1083-1092. https://doi.org/10.1080/07408179908969909
  58. Van Gils, T., Caris, A., Ramaekers, K. ve Braekers, K. (2019a). “Formulating and Solving the Integrated Batching, Routing, and Picker Scheduling Problem in A Real-Life Spare Parts Warehouse”, European Journal of Operational Research, 277(3), 814-830. https://doi.org/10.1016/j.ejor.2019.03.012
  59. Van Gils, T., Caris, A., Ramaekers, K., Braekers, K. ve de Koster, R.B. (2019b). “Designing Efficient Order Picking Systems: The Effect of Real-Life Features on the Relationship among planning problems”, Transportation Research Part E: Logistics and Transportation Review, 125, 47-73, 2019. https://doi.org/10.1016/j.tre.2019.02.010
  60. Vaughan, T. (1999). “The Effect of Warehouse Cross Aisles on Order Picking Efficiency”, International Journal of Production Research, 37, 881-897. https://doi.org/10.1080/002075499191580
  61. Warshall, S. (1962). “A Theorem on Boolean Matrices”, Journal of the ACM (JACM), 9(1), 11-12. https://doi.org/10.1145/321105.321107
  62. Wu, R., He, J., Li, X. ve Chen, Z. (2024). “A Memetic Algorithm with Fuzzy-Based Population Control for the Joint Order Batching and Picker Routing Problem”, Information Sciences, 656, 119913. https://doi.org/10.1016/j.ins.2023.119913
  63. Xie, L., Li, H. ve Luttmann, L. (2023). “Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses”, European Journal of Operational Research, 307(2), 713-730. https://doi.org/10.1016/j.ejor.2022.08.047
  64. Yousefi Nejad Attari, M., Ebadi Torkayesh, A., Malmir, B. ve Neyshabouri Jami, E. (2021). “Robust Possibilistic Programming for Joint Order Batching and Picker Routing Problem in Warehouse Management”, International Journal of Production Research, 59(14), 4434-4452. https://doi.org/10.1080/00207543.2020.1766712
  65. Zhang, J., Liu, F., Tang, J. ve Li, Y. (2019). “The Online Integrated Order Picking and Delivery Considering Pickers’ Learning Effects for an O2O Community Supermarket”, Transportation Research Part E: Logistics and Transportation Review, 123, 180-199. https://doi.org/10.1016/j.tre.2019.01.013
  66. Zhao, Z., Cheng, J., Liang, J., Liu, S., Zhou, M. ve Al-Turki, Y. (2024). “Order Picking Optimization in Smart Warehouses with Human–Robot Collaboration”, IEEE Internet of Things Journal, 11, 16314-16324. https://doi.org/10.1109/JIOT.2024.3352658/mm1
  67. Zhu, S., Hu, X., Huang, K. ve Yuan, Y. (2021). “Optimization of Product Category Allocation in Multiple Warehouses to Minimize Splitting of Online Supermarket Customer Orders”, European Journal of Operational Research, 290(2), 556-571. https://doi.org/10.1016/j.ejor.2020.08.024