KESİN ZAMAN PENCERELİ - EŞ ZAMANLI DAĞITIM TOPLAMALI ARAÇ ROTALAMA PROBLEMİ: Matematiksel Model

Yıl 2010, Cilt: 25 Sayı: 3, 0 - , 19.02.2013

Suna Çetin Cevriye Gencer

Öz

Bu çalışmada, kesin zaman pencereli-eşzamanlı dağıtım toplamalı araç rotalama problemi tanımlanmış vematematiksel modeli geliştirilmiştir. Genellikle araç rotalama problemlerinde amaç, katedilen mesafenin veyataşıma maliyetinin enazlanmasıdır. Literatür incelendiğinde zaman pencereli araç rotalama problemlerinde deaynı amaç fonksiyonlarının tanımlandığı görülmektedir. Oysa zaman pencereli araç rotalama problemlerindezaman penceresinden kaynaklanan beklemelerin dikkate alınması gerekmektedir. Çalışmada, tanımlanan yeniproblemin matematiksel modelinde, amaç fonksiyonu beklemelerin en küçüklenmesi olarak alınmış;Solomon’un test verileri eşzamanlı dağıtım toplama problemlerine uygun hale getirmek için düzenlenmiş veGAMS paket programı ile sonuçlar elde edilmiştir.

Anahtar Kelimeler

Araç rotalama problemleri, Eşzamanlı dağıtım toplama, Zaman penceresi, Kesin zaman penceresi, Matematiksel model,

Kaynakça

• Dantzig G.B., Ramser J.H., “The Truck
• Dispatching Problem”, Management Science, 6,
• -91, 1959.
• Toth P., Vigo D., The Vehicle Routing
• Problem, Siam, 2002.
• Savelsbergh M.W.P., “Local Search In Routing
• Problems With Time Windows”, Annals of
• Operations Research, 4, 285-305, 1985.
• Solomon M.M., “Algorithms For The Vehicle
• Routing And Scheduling Problems With Time
• Window Constrains”, Operations Research, 35,
• , 254-265, 1987.
• Solomon M.M., Desrosier J., “Survey Paper: The
• Time Constrained Routing and Scheduling
• Problems”, Transportation Science, 22, 1, 1988.
• Pullen H.., Webb M., “A Computer Application
• To A Transport Scheduling Problem”, Computer
• Journal,10:10-13,1967.
• Knight K., Hofer J., “Vehicle Scheduling With
• Timed and Connected Calls: A Case Study”,
• Operational Research Quarterly, 19: 299-310,
• -
• Madsen O.B.G., Optimal Scheduling of Trucks-
• A routing Problem With Tight Due Times For
• Delivery. In H. Strobel, R. Genser, M.
• Etschmaier, editors, Optimization Applied to
• Transportation Systems, IIASA, International
• Institute for Applied System Analysis,
• Luxemburg, Austria, 126-136, 1976.
• Bouthillier A., Crainic T.G., “A Cooperative
• Parallel Meta Heuristic For The Vehicle Routing
• Problem With Time Windows”, Computers &
• Operations Research, 32, 1685-1708, 2005.
• Dondo R., Cerda J., “A Cluster –Based
• Optimization Approach For The Multi-Depot
• Heterogeneous Fleet Vehicle Routing Problem
• With Time Windows”, European Journal of
• Operation Research, 176, 1478-1507, 2007.
• Calvete H.I., Gale C., Oliveros M., Sanchez-
• Valverde B., “A Goal Programming Approach
• To Vehicle Routing Problems With Soft Time
• Windows”, European Journal of Operation
• Research, 177, 1720-1733, 2007.
• Savelsbergh M., Sol M., “The General Pick Up
• And Delivery Problem”, Transportation
• Science, 29, 1, 107-121, 1995.
• Zachariadis, E.E., Tarantilis, C.D., Kiranoudis,
• C. T. “Hybrid Metaheuristic Algorithm For The
• Vehicle Routing Problem With Simultaneous
• Delivery And Pick-Up Service”, Expert System
• with Applications, 36, 1070-1081,2009
• Min, H., “The Multiple Vehicle Routing Problem
• With Simultaneous Delivery and Pick-up Points”,
• Transportation Research, 23A, 377-386, 1989.
• Dethloff, J., “Vehicle Routing And Reverse
• Logistics: The Vehicle Routing Problem With
• Simultaneous Delivery and Pick-Up”, OR
• Spectrum, 23, 79-96, 2001.
• Montane F.A.T, Galvao RD., “A Tabu Search
• Algorithm For the Vehicle Routing Problem
• With Simultaneous Pick Up And Delivery
• Service”, Computers & Operations Research,
• , 595-619, 2006.
• Nagy, G. & Salhi, S. “Heuristic Algorithms For
• Single And Multiple Depot Vehicle Routing
• Problems With Pickups And Deliveries”,
• European Journal Of Operational Research,
• , 1, 126-141, 2005.
• Bianchessi, N., Righini, G., “Heuristic
• Algorithms For The Vehicle Routing Problem
• With Simultaneous Pick-Up And Delivery”,
• Computers & Operations Research, 34, 578-
• , 2009
• Gajpal, Y., Abad, P., “An Ant Colony System
• (ACS) For Vehicle Routing Problem With
• Simultaneous Delivery And Pick Up”,
• Computers & Operations Research, 36, 3215-
• , 2009.
• Ai, T. & Kachitvichyanukul, V., “A Particle
• Swarm Optimization For The Vehicle Routing
• Problem With Simultaneous Pickup And
• Delivery”, Computers & Operations Research,
• , 1693-1702, 2009.
• YAŞA Ö, Ulaştırma Komutanlığı Ring
• Seferlerinin Eş Zamanlı Dağıtım Toplama
• Karar Destek Sistemi, Yüksek Lisans Tezi,
• KHO Savunma Bilimleri Enstitüsü, 2006.
• ÖZKÜTÜK E., Heterojen Araç Filolu Eş
• Zamanlı Dağıtım-Toplamalı Rotalama
• Problemin Çözümü İçin Sezgisel Bir
• Algoritma ve Uygulamalı Bir Karar Destek
• Sistem, Yüksek Lisans Tezi, KHO Savunma
• Bilimleri Enstitüsü, 2008
• Salhi S., Nagy G., “A Cluster Insertion Heuristic
• For Single And Multi Depot Vehicle Routing
• Problems With Backhauling”, Journal of the
• Operation Research Society, 50, 1034-1042,
• -