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

Ö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

1. Dantzig G.B., Ramser J.H., “The Truck
2. Dispatching Problem”, Management Science, 6,
3. -91, 1959.
4. Toth P., Vigo D., The Vehicle Routing
5. Problem, Siam, 2002.
6. Savelsbergh M.W.P., “Local Search In Routing
7. Problems With Time Windows”, Annals of
8. Operations Research, 4, 285-305, 1985.

9. Solomon M.M., “Algorithms For The Vehicle
10. Routing And Scheduling Problems With Time
11. Window Constrains”, Operations Research, 35,
12. , 254-265, 1987.
13. Solomon M.M., Desrosier J., “Survey Paper: The
14. Time Constrained Routing and Scheduling
15. Problems”, Transportation Science, 22, 1, 1988.
16. Pullen H.., Webb M., “A Computer Application
17. To A Transport Scheduling Problem”, Computer
18. Journal,10:10-13,1967.
19. Knight K., Hofer J., “Vehicle Scheduling With
20. Timed and Connected Calls: A Case Study”,
21. Operational Research Quarterly, 19: 299-310,
22. -
23. Madsen O.B.G., Optimal Scheduling of Trucks-
24. A routing Problem With Tight Due Times For
25. Delivery. In H. Strobel, R. Genser, M.
26. Etschmaier, editors, Optimization Applied to
27. Transportation Systems, IIASA, International
28. Institute for Applied System Analysis,
29. Luxemburg, Austria, 126-136, 1976.
30. Bouthillier A., Crainic T.G., “A Cooperative
31. Parallel Meta Heuristic For The Vehicle Routing
32. Problem With Time Windows”, Computers &
33. Operations Research, 32, 1685-1708, 2005.
34. Dondo R., Cerda J., “A Cluster –Based
35. Optimization Approach For The Multi-Depot
36. Heterogeneous Fleet Vehicle Routing Problem
37. With Time Windows”, European Journal of
38. Operation Research, 176, 1478-1507, 2007.
39. Calvete H.I., Gale C., Oliveros M., Sanchez-
40. Valverde B., “A Goal Programming Approach
41. To Vehicle Routing Problems With Soft Time
42. Windows”, European Journal of Operation
43. Research, 177, 1720-1733, 2007.
44. Savelsbergh M., Sol M., “The General Pick Up
45. And Delivery Problem”, Transportation
46. Science, 29, 1, 107-121, 1995.
47. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis,
48. C. T. “Hybrid Metaheuristic Algorithm For The
49. Vehicle Routing Problem With Simultaneous
50. Delivery And Pick-Up Service”, Expert System
51. with Applications, 36, 1070-1081,2009
52. Min, H., “The Multiple Vehicle Routing Problem
53. With Simultaneous Delivery and Pick-up Points”,
54. Transportation Research, 23A, 377-386, 1989.
55. Dethloff, J., “Vehicle Routing And Reverse
56. Logistics: The Vehicle Routing Problem With
57. Simultaneous Delivery and Pick-Up”, OR
58. Spectrum, 23, 79-96, 2001.
59. Montane F.A.T, Galvao RD., “A Tabu Search
60. Algorithm For the Vehicle Routing Problem
61. With Simultaneous Pick Up And Delivery
62. Service”, Computers & Operations Research,
63. , 595-619, 2006.
64. Nagy, G. & Salhi, S. “Heuristic Algorithms For
65. Single And Multiple Depot Vehicle Routing
66. Problems With Pickups And Deliveries”,
67. European Journal Of Operational Research,
68. , 1, 126-141, 2005.
69. Bianchessi, N., Righini, G., “Heuristic
70. Algorithms For The Vehicle Routing Problem
71. With Simultaneous Pick-Up And Delivery”,
72. Computers & Operations Research, 34, 578-
73. , 2009
74. Gajpal, Y., Abad, P., “An Ant Colony System
75. (ACS) For Vehicle Routing Problem With
76. Simultaneous Delivery And Pick Up”,
77. Computers & Operations Research, 36, 3215-
78. , 2009.
79. Ai, T. & Kachitvichyanukul, V., “A Particle
80. Swarm Optimization For The Vehicle Routing
81. Problem With Simultaneous Pickup And
82. Delivery”, Computers & Operations Research,
83. , 1693-1702, 2009.
84. YAŞA Ö, Ulaştırma Komutanlığı Ring
85. Seferlerinin Eş Zamanlı Dağıtım Toplama
86. Karar Destek Sistemi, Yüksek Lisans Tezi,
87. KHO Savunma Bilimleri Enstitüsü, 2006.
88. ÖZKÜTÜK E., Heterojen Araç Filolu Eş
89. Zamanlı Dağıtım-Toplamalı Rotalama
90. Problemin Çözümü İçin Sezgisel Bir
91. Algoritma ve Uygulamalı Bir Karar Destek
92. Sistem, Yüksek Lisans Tezi, KHO Savunma
93. Bilimleri Enstitüsü, 2008
94. Salhi S., Nagy G., “A Cluster Insertion Heuristic
95. For Single And Multi Depot Vehicle Routing
96. Problems With Backhauling”, Journal of the
97. Operation Research Society, 50, 1034-1042,
98. -