Ulaştırma Komutanlığı ring seferlerinin eş zamanlı dağıtım toplama karar destek sistemi

Bu çalışmada, Ulaştırma Komutanlığına gelen yurtiçi taşıma isteklerinin en düşük maliyetle karşılanabilmesi hedeflenmiştir. Eş zamanlı dağıtım toplamalı araç rotalama modeli esas alınmıştır. Taleplerin değişken olmasından dolayı rotaların dinamik olarak belirlenmesini kolaylaştırmak için karar destek yazılımı(VRP 2.0) oluşturulmuştur. Bu yazılımda, ara yüzler Visual Basic 6.0 programlama diliyle; hesaplamalar ise C++ 6.0 dilinde kodlanan bir program aracılığıyla elde edilmektedir. Yazılım seçilen depoya, dağıtım veya toplama yapılacak toplam miktara ve araç kapasitesine göre rotaları; rotalara bağlı olarak mesafeyi ve kullanılacak araç sayısını belirlemektedir. Yazılım 10 haftalık verilere uygulanmış ve sonuçlar mevcut durumla kat edilen yol, kullanılan araç sayısı ve maliyet açısından karşılaştırılmıştır.

Simultaneous pick-up and delivery decision support systems of Transportation Command shuttle tour's

In this study, in order to satisfy transportation demands with cheapest cost, a decision support application relying on a simultaneous pick-up and delivery type vehicle routing models and algorithms, is used. Since the demand parameters are variable, a decision support coding (VRP 2.0) is constructed to simplify routing problem in a dynamic way. In this coding, interfaces are written in Visual Basic 6.0, and computations are executed by a program coded in C++ 6.0. On point of travel distance, numbers of vehicles used and their respective costs are determined; results are compared with the current transportation systems used.

___

  • 1. Toth, P. and Vigo, D., The Vehicle Routing Problem, Philadelphia, SIAM, 2002.
  • 2. Bachem A., Hochstattler, W. and Malich, M., “The Simulated Trading Heuristic for Solving Vehicle Routing Problems”, Report No 93.139 Mathematisches Institut Universit at zu Koln, 1993.
  • 3. Casco, D., Golden, L. and Wasil, E.A., Vehicle Routing: Methods and Studies, Elsevier- Amsterdam 1988.P4. Dantzig, G.B. and Ramser, Jh., “The Truck Dispatching Problem”, Management Science, 6, 80–91, 1959.
  • 5. Anily, S. and Mosheıov, G., “The Traveling Salesman Problem with Delivery and Backhauls”, Operations Research Letters, 16, 11–18, 1994.
  • 6. Dumas,Y., Desrosiers, J. Vd., “The Pick Up And Delivery Problem ith Time Windows”, European Journal Of Operation Research, 54, 7-22,1991.
  • 7. Gendreau M., G. Laporte and Vigo, D., “Heuristics for the Traveling Salesman Problem with Pickup and Delivery”, Computers & Operations Research, 26, 699-714, 1999.
  • 8. Mosheiov G., “The Travelling Salesman Problem with Pick-Up and Delivery”, European Journal of Operational Research, 79, 299–310, 1994.
  • 9. Nagy, G., Salhi, S., “Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries”, European Journal of Operational Research, 162, 126–141, 2005.
  • 10. Golden B.L., Baker E. K., Alfaro J. L. and Schaffer J. R., “The Vehicle Routing Problem with Backhauling: Two Approaches”, Working Paper, University of Maryland,College Park, 17, 1985.
  • 11. Salhi, S., Nagy, G., “A Cluster İnsertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling”, Journal of the Operational Research Society 50, 1034–1042, 1999.
  • 12. Min, H., “The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points”, Transportation Research, 23A, 377-386, 1989.
  • 13. Salhi, E., Nagy, D., “The Vehicle Routing Problem with Simultaneous Pick Up and Delivery”, European Journal of Operation Research, IX, 3, 84-102, 2002.
  • 14. Dethloff, J., “Vehicle Routing And Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-Up”, OR Spektrum, 23, 79-96, 2001.
  • 15. Gökçen, H., Yönetim Bilgi Sistemleri, Ankara, Epi Yayıncılık, 2002.