İki aşamalı gürbüz tek atamalı p-Ana dağıtım üssü merkez ve açık uçlu rotalama problemi

Yıl 2026, Cilt: 41 Sayı: 1 , 549 - 564 , 31.03.2026

Merve Evyapan , Zühal Kartal , Onur Kaya

https://doi.org/10.17341/gazimmfd.1716850

https://izlik.org/JA28GG82GR

Öz

Bu çalışmada, Türkiye genelinde kargo taşımacılığı alanında karşılaşılan toplama-dağıtım sürecini doğrudan rotalar üzerinden gerçekleştiren bir yapıda, p-Ana Dağıtım Üssü (ADÜ) merkez yer seçimi ve açık uçlu araç rotalama kararlarını bütünleşik biçimde ele alan bir problem ele alınmıştır. Problemin amacı, herhangi bir kaynak-hedef noktası arasındaki maksimum seyahat süresini en aza indirerek dengeli ve etkin rotaların oluşturulmasını sağlamaktır. Bu amaçla öncelikle özgün bir karma tamsayılı matematiksel modelleme formülasyonu sunulmuştur. ADÜ yerlerinin belirlenmesi ve rotalama planlamasında, trafik sıkışıklığının etkisi çoğu zaman göz önüne alınmamakta, bu nedenle seyahat süreleri ideal koşullar altında sabit olarak değerlendirilmektedir. Ancak, seyahat süresindeki belirsizliklerin ADÜ yeri belirleme ve rotalama kararlarına entegre edilmesi, güvenilir bir dağıtım ağı tasarımı açısından kritik bir rol oynamaktadır. Bu kapsamda çalışmada ayrıca, taşıma sürecinde meydana gelebilecek gecikmelerin olasılığını dikkate alan çözümler üretmek amacıyla iki aşamalı bir gürbüz programlama modeli geliştirilmiş ve “İki Aşamalı Gürbüz Tek Atamalı p-ADÜ Merkez ve Açık Uçlu Rotalama Problemi” olarak literatüre sunulmuştur. Deterministik ve gürbüz modele ait duyarlılık analizleri CAB ve TR veri setleri üzerinde gerçekleştirilmiştir. Sonuçlar incelendiğinde, gerçek hayat trafik yoğunluğu gibi seyahat süresini etkileyebilecek faktörler gürbüz modele dahil edildiğinde, belirlenen ADÜ merkezlerinin konumları ve rotaların deterministik model sonuçlarından önemli ölçüde farklılaştığı görülmüştür. Bu bulgular, daha güvenilir lojistik dağıtım ağı tasarımları için belirsizliklerin karar süreçlerine entegre edilmesinin önemini ortaya koymaktadır.

Anahtar Kelimeler

ADÜ Yer Seçimi Problemi ve Rotalama Problemi , p-ADÜ Merkez ve Açık Uçlu Araç Rotalama Problemi , Gürbüz Programlama , İki Aşamalı Formülasyon

Kaynakça

• 1. Yaman H., Kara B.Y., Tansel B.Ç., The last arrival hub location problem for cargo delivery systems with stopovers, Transportation Research Part B: Methodological, 41 (8), 906–919, 2007.
• 2. O’Kelly M.E., A Quadratic Integer-Program for the Location of Interacting Hub Facilities, European Journal of Operational Research, 32 (3), 393–404, 1987.
• 3. Campbell J.F., Integer programming formulations of discrete hub location problems, European Journal of Operational Research, 72 (2), 387–405, 1994.
• 4. Ernst A.T., Krishnamoorthy M., Efficient algorithms for the uncapacitated single allocation p-hub median problem, Location Science, 4 (3), 139–154, 1996.
• 5. Kartal Z., Hasgul S., Ernst A.T., Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery, Transportation Research Part E: Logistics and Transportation Review, 108, 141–159, 2017.
• 6. Kartal Z., Krishnamoorthy M., Ernst A.T., Heuristic algorithms for the single allocation p-hub center problem with routing considerations, OR Spectrum, 41, 99–145, 2019.
• 7. Ibnoulouafi E.M., Oudani M., Aouam T., Ghogho M., The p-hub centre routing problem with emissions budget: Formulation and solution procedure, Computers & Operations Research, 154, 2023.
• 8. Atasagun G.C., Karaoğlan İ., A mathematical model for the time dependent vehicle routing problem with simultaneous pick-up and delivery, Journal of the Faculty of Engineering and Architecture of Gazi University, 34 (4), 1743-1755, 2019.
• 9. Bayrak A., Özyörük B., Comparative mathematical models for split delivery simultaneous pickup and delivery, Journal of the Faculty of Engineering and Architecture of Gazi University, 32 (2), 469–479, 2017.
• 10. Rahmati R., Bashiri M., Nikzad E., Siadat A., A two-stage robust hub location problem with accelerated Benders decomposition algorithm, International Journal of Production Research, 60 (17), 5235–5257, 2022.
• 11. Ben-Tal A., Goryashko A., Guslitzer E., Nemirovski A., Adjustable robust solutions of uncertain linear programs, Mathematical Programming, 99 (2), 351–376, 2004.
• 12. Goldman A.J., Optimal locations for centers in a network, Transportation Science, 3 (4), 352–360, 1969.
• 13. Ebery J., Solving large single allocation p-hub problems with two or three hubs, European Journal of Operational Research, 128 (2), 447–458, 2001.
• 14. Kara B.Y., Tansel B.C., On the single-assignment p-hub center problem, European Journal of Operational Research, 125 (3), 648–655, 2000.
• 15. Ernst A.T., Hamacher H., Jiang H.Y., Krishnamoorthy M., Woeginger G., Uncapacitated single and multiple allocation p-hub center problems, CSIRO Math. Inf. Sci., Australia, Unpublished Report, 2002.
• 16. Ernst A.T., Hamacher H., Jiang H., Krishnamoorthy M., Woeginger G., Heuristic algorithms for the uncapacitated hub center single allocation problem, CSIRO Mathematical and Information Sciences, Australia, Unpublished Report, 2002.
• 17. Kara B.Y., Tansel B.C., The single-assignment hub covering problem: models and linearizations, Journal of the Operational Research Society, 54, 59–64, 2003.
• 18. Ernst A.T., Jiang H., Krishnamoorthy M., Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems, CSIRO Mathematical and Information Sciences, Australia, Unpublished Report, 2005.
• 19. Alumur S., Kara B.Y., Network hub location problems: the state of the art, European Journal of Operational Research, 190 (1), 1–21, 2008.
• 20. Alumur S.A., Campbell J.F., Contreras I., Kara B.Y., Marianov V., O’Kelly M.E., Perspectives on modeling hub location problems, European Journal of Operational Research, 291 (1), 1–17, 2021.
• 21. Rodríguez-Martín I., Salazar-González J.-J., Yaman H., A branch-and-cut algorithm for the hub location and routing problem, Computers & Operations Research, 50, 161–174, 2014.
• 22. Gao C.-F., Hu Z.-H., Wang Y.-Z., Optimizing the hub-and-spoke network with drone-based traveling salesman problem, Drones, 7 (1), 6, 2022.
• 23. Aloullal A., Saldanha-da Gama F., Todosijević R., Multi-period single-allocation hub location-routing: Models and heuristic solutions, European Journal of Operational Research, 310 (1), 53–70, 2023.
• 24. Kartal Z., Integrated hub location and capacitated vehicle routing problem over incomplete hub networks, International Journal of Industrial Engineering: Theory, Applications and Practice, 30 (1), 2023.
• 25. Pourmohammadi P., Tavakkoli-Moghaddam R., Rahimi Y., Triki C., Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm, Annals of Operations Research, 324, 1099-1128, 2023. 26. de Camargo R.S., de Miranda G., Løkketangen A., A new formulation and an exact approach for the many-to-many hub location-routing problem, Applied Mathematical Modelling, 37 (12–13), 7465–7480, 2013.
• 27. Bostel N., Dejax P., Zhang M., A model and a metaheuristic method for the hub location routing problem and application to postal services, 2015 International Conference on Industrial Engineering and Systems Management (IESM), Seville-Spain, 1383–1389, 2015.
• 28. Abbasi M., Mokhtari N., Shahvar H., Mahmoudi A., Application of variable neighborhood search for solving large-scale many to many hub location routing problems, Journal of Advances in Management Research, 16 (5), 683–697, 2019.
• 29. Danach K., Gelareh S., Monemi R.N., The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach, EURO Journal on Transportation and Logistics, 8 (5), 597–631, 2019.
• 30. Wu Y., Qureshi A.G., Yamada T., Yu S., Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem, Journal of the Operational Research Society, 75 (2), 2023.
• 31. Wandelt S., Wang S., Sun X., A literature review on hub location-routing models and their solution techniques, Computers & Operations Research, 173, 106861, 2025.
• 32. Kartal Z., Ernst A.T., Integer programming formulations for the uncapacitated vehicle routing p-hub center problem, 21st International Congress on Modelling and Simulation, Gold Coast, 1724–1730, 2015.
• 33. Kassoumeh A.K., Kartal Z., Arslan A., The Effect of Different Initial Solutions on the Metaheuristic Algorithms for the Single Allocation p-Hub Center and Routing Problem, PeerJ Computer Science, 11: e2840.
• 34. Marianov V., Serra D., Location models for airline hubs behaving as M/D/c queues, Computers & Operations Research, 30 (7), 983–1003, 2003.
• 35. Yang T.H., Stochastic air freight hub location and flight routes planning, Applied Mathematical Modelling, 33 (12), 4424–4430, 2009.
• 36. Sim T., Lowe T.J., Thomas B.W., The stochastic p-hub center problem with service-level constraints, Computers & Operations Research, 36 (12), 3166–3177, 2009.
• 37. Contreras I., Cordeau J.-F., Laporte G., Stochastic uncapacitated hub location, European Journal of Operational Research, 212 (3), 518–528, 2011.
• 38. Alumur S.A., Nickel S., Saldanha-da-Gama F., Hub location under uncertainty, Transportation Research Part B: Methodological, 46 (4), 529–543, 2012.
• 39. Mohammadi M., Jula P., Tavakkoli-Moghaddam R., Reliable single-allocation hub location problem with disruptions, Transportation Research Part E: Logistics and Transportation Review, 123, 90–120, 2019.
• 40. Mulvey J.M., Ruszczynski A., A new scenario decomposition method for large-scale stochastic optimization, Operations Research, 43 (3), 477, 1995.
• 41. Yu C., Li H., A robust optimization model for stochastic logistic problems, International Journal of Production Economics, 64 (1–3), 385–397, 2000.
• 42. Shahabi M., Unnikrishnan A., Robust hub network design problem, Transportation Research Part E: Logistics and Transportation Review, 70, 356–373, 2014.
• 43. Ghaffari-Nasab N., Ghazanfari M., Teimoury E., Robust optimization approach to the design of hub-and-spoke networks, International Journal of Advanced Manufacturing Technology, 76, 1091–1100, 2015.
• 44. Habibzadeh Boukani F., Farhang Moghaddam B., Pishvaee M.S., Robust optimization approach to capacitated single and multiple allocation hub location problems, Computational and Applied Mathematics, 35 (1), 45–60, 2016.
• 45. Merakli M., Yaman H., Robust intermodal hub location under polyhedral demand uncertainty, Transportation Research Part B: Methodological, 86, 66–85, 2016.
• 46. Merakli M., Yaman H., A capacitated hub location problem under hose demand uncertainty, Computers & Operations Research, 88, 58–70, 2017.
• 47. Zetina C.A., Contreras I., Cordeau J.-F., Nikbakhsh E., Robust uncapacitated hub location, Transportation Research Part B: Methodological, 106, 393–410, 2017.
• 48. de Sá M., Morabito R., de Camargo R.S., Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements, Expert Systems with Applications, 93, 50–61, 2018.
• 49. Ghaffarinasab N., An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty, Computers & Operations Research, 97, 31–47, 2018.
• 50. Rahmati R., Bashiri M., Robust hub location problem with uncertain inter hub flow discount factor, International Conference on Industrial Engineering and Operations Management (IEOM), Paris-France, 2018.
• 51. Araghi M.E.T., Tavakkoli-Moghaddam R., Jolai F., Hadji Molana S.M., A green multi-facilities open location-routing problem with planar facility locations and uncertain customer, Journal of Cleaner Production, 282, 124343, 2021.
• 52. Wang C., Liu Y., Yang G., Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy, Socio-Economic Planning Sciences, 87, 2023.
• 53. Tan P.Z., Kara B.Y., A hub covering model for cargo delivery systems, Networks, 49 (1), 28–39, 2007.