İki aşamalı yer seçimi ve eş zamanlı topla dağıt araç rotalama problemi: Karışık tam sayılı matematiksel model ve sezgisel yaklaşım

Yıl 2021, Cilt: 36 Sayı: 2, 807 - 822, 05.03.2021

Ece Arzu Yıldız , İsmail Karaoğlan , Fulya Altıparmak

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

Öz

Bu çalışmada İki Aşamalı Yer Seçimi ve Eş Zamanlı Topla Dağıt Araç
Rotalama Problemi (2A/YS-ETDARP) ele alınmıştır. Bu problemde amaç, fabrika,
depo ve müşterilerden oluşan iki aşamalı bir dağıtım ağında en düşük maliyet
ile hangi tesislerin hangi aday bölgelere kurulacağı ve her aşamada rotalama faaliyetlerinin
nasıl gerçekleşeceğini belirlemektir. Rotalama faaliyetleri iki yönlü olup
birincil tesislerden (fabrika) ikincil tesislere (depo) ve ikincil tesislerden
müşterilere yapılacak olan dağıtım, müşterilerden ikincil tesislere ve ikincil
tesislerden birincil tesislere gönderilmek üzere toplama faaliyetlerini
kapsamaktadır. 2A/YS-ETDARP’nin çözümü için iki indisli düğüm tabanlı karışık
tamsayılı bir matematiksel model önerilmiştir. Problem NP-Zor sınıfında yer
aldığından dolayı büyük boyutlu problemlerin çözümü için Clarke-Wright
algoritmasına dayalı bir çözüm kurucu sezgisel algoritma geliştirilmiştir.
Sezgisel algoritmanın performansını değerlendirmek için literatürden elde
edilmiş değişik veri setleri üzerinde deneysel bir çalışma
yapılmıştır. Deneysel çalışma sonucunda sezgisel algoritmanın orta ve
büyük boyutlu problemler için kısa süreler içerisinde oldukça iyi çözümlere
ulaştığı görülmüştür.

Anahtar Kelimeler

iki aşamalı yer seçimi ve araç rotalama problemi, eş zamanlı topla dağıt, tam sayılı programlama, sezgisel yaklaşım

Kaynakça

• 1. Min, H., Jayaraman, V., Srivastava, R., Combined Location-Routing Problems: A Synthesis and Future Research Directions, European Journal of Operational Research, (108), 1–15, 1998.
• 2. Nagy, G., Salhi, S., Location-Routing: Issues, Models and Methods, European Journal of Operational Research, (177), 649-672, 2007.
• 3. Drexl, M., Schneider, M., A survey of Location Routing Problem, Technical Report LM-2013-03, 2013.
• 4. Prodhon, C., Prins, C., A Survey on Recent Research on Location-Routing Problems, European Journal of Operations Research, (238), 1-17, 2014.
• 5. Boccia, M., Crainic, T.G., Sforza, A., Sterle, C., Location-Routing Models for Designing a Two-Echelon Freight Distribution System, Technical Report 2011- 06, CIRRELT, Montreal, 2011.
• 6. Keçeci, B., Altıparmak, F., Kara, İ., Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery: Mathematical Formulations and a Heuristic Algorithm, Journal of the Faculty of Engineering and Architecture of Gazi University, 30(2), 185-195, 2015.
• 7. Bayrak, A., Özyörük, B., Comparative mathematical models for split delivery simultaneous pickup and delivery vehicle routing problem, Journal of the Faculty of Engineering and Architecture of Gazi University, 32(2), 2017.
• 8. Can Atasagun, G., 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), 2019.
• 9. Parragh, S.N., Doerner, K.F., Hartl, R.F., A Survey on Pickup and Delivery Problems Part I: Transportation Between Customers and Depot, Journal für Betriebswirtschaft, 58 (1), 21-51, 2008.
• 10. Berbeglia, G., Cordeau, J., Gribkovskaia, I., Laporte, G., Static Pickup and Delivery Problems: A Classification Scheme and Survey, Top, 15, 1–31, 2007.
• 11. Boccia, M., Crainic, T.G., Sforza, A., Sterle, C., A Metaheuristic for a Two Echelon Location-Routing Problem, Lecture Notes in Computer Science, Springer, 6049, Editör: Festa, P., Berlin, 288-301, 2010.
• 12. Nguyen VP., Prins C., Prodhon C., A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem, Lecture Notes in Computer Science, 6373, Editör: Blesa M.J., Blum C., Raidl G., Roli A., Sampels M., Springer, Berlin, Heidelberg, 88-102 , 2010.
• 13. Nguyen, V.P., Prins, C., Prodhon, C., A Multi Start Iterative Local Search with Tabu List and Path Relinking for the Two-Echelon Location Routing Problem, Engineering Applications of Artificial Intelligence, (25), 56-71, 2012.
• 14. Nguyen, V.P., Prins, C., Prodhon, C., Solving the Two-Echelon Location Routing Problem by a GRASP Reinforced by a Learning Process and Path Relinking, European Journal of Operational Research, (216), 113-126, 2012.
• 15. Nikbakhsh, E., Zegordi, S., A Heuristic Algorithm and a Lower Bound for the Two-Echelon Location-Routing Problem with Soft Time Window Constraints, Scientia Iranica Transaction E: Industrial Engineering, (17), 36-47, 2010.
• 16. Contardo, C., Hemmelmayr, V., Crainic, T.G., Lower and Upper Bounds for the Two-Echelon Capacitated Location-Routing Problem, Computers & Operations Research, (39), 3185-3199, 2012.
• 17. Govindan, K., Jafarian, A., Khodaverdi, R., Devika, K., Two Echelon Multiple Vehicle Location–Routing Problem with Time Windows for Optimization of Sustainable Supply Chain Network of Perishable Food, International Journal of Production Economics, (152), 9-28, 2014.
• 18. Bala, K., Brcanov, D., Gvozdenovic, N., Two-Echelon Location Routing Synchronized with Production Schedules and Time Windows, Central European Journal of Operations Research, (25), 525-543, 2017.
• 19. Pichka, K., Bajgiran, A.H., Petering, M.E.H., Jang, J., Yue, X., The Two Echelon Open Location Routing Problem: Mathematical Model and Hybrid Heuristic, Computers & Industrial Engineering, (121), 97-112, 2018.
• 20. Veenstra, M., Roodbergen, K., Coelho, L., Zhu, S., A simultaneous Facility Location and Vehicle Routing Problem Arising in Healthcare Logistics in the Netherlands, European Journal of Operational Research, (268), 703-715, 2018.
• 21. Wang, Y., Assogba, K., Liu, Y., Ma, X., Xu, M., Wang, Y., Two-Echelon Location-Routing Optimization with Time Windows Based on Customer Clustering, Expert Systems with Applications, 104, 244-260, 2018.
• 22. Karaoğlan, İ., Altıparmak, F., Kara, İ., Dengiz, B., A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, European Journal of Operational Research, 211(2), 318-332, 2011.
• 23. Karaoğlan, İ., Altıparmak, F., Kara, İ., Dengiz, B., The location-routing problem with simultaneous pickup and delivery: formulations and a heuristic approach, Omega, 40(4), 465-477, 2012.
• 24. Yu, V., Lin, S., Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Applied Soft Computing, 24, 284-290, 2014.
• 25. Yu,V.,Lin, S., Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing, International Journal of Production Research, 54(2), 526-549, 2016.
• 26. Belgin, Ö., Karaoğlan, İ., Altıparmak, F., Two-Echelon Vehicle routing problem with simultaneous pickup and delivery: mathematical model and heuristic approach. Computers & Industrial Engineering (115), 1-16.
• 27. Rahmani, Y., Cherif-Khettaf, W.R., Oulamara, A., The Two-Echelon Multi-Products Location-Routing Problem with Pickup and Delivery: Formulation and Heuristic Approaches, International Journal of Production Research, 54 (4), 999-1019, 2016.
• 28. Demircan-Yıldız, E. A., Karaoğlan, İ., Altıparmak, F., Two Echelon Location Routing Problem with Simultaneous Pickup and Delivery: Mixed Integer Programming Formulations and Comparative Analysis, Lecture Notes on Computer Science, 9855, Editör: Paias, A., Ruthmair, M., Voß, Springer, 275-289, 2016.
• 29. Clarke, G., Wright, J. V., Scheduling of Vehicles from Central Depot to a Number of Delivey Points, Operations Research, 12, 568-581, 1964.
• 30. Salhi, S., Nagy, G., A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling, Journal of the Operational Research Society, (50), 1034–42, 1999.
• 31. Angelelli, E., Mansini, R., The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery, Quantitative Approaches to Distribution Logistics and Supply Chain Management, Cilt 519, Editörler: Klose, A., Speranza, M. G., Van Wassenhove, L. N., Springer, Berlin, 249-267, 2002.