Heterojen Araç Filolu Zaman Pencereli Eş Zamanlı Dağıtım-Toplamalı Araç Rotalama Problemleri: Matematiksel Model
Abstract
Bu çalışmada heterojen araç filolu kesin zaman pencereli eş zamanlı dağıtım-toplamalı araç rotalama problemleri (HKZP_EZDT_ARP) tanımlamaktadır. Tanımlanan problem için matematiksel model önerilmiş ve literatürde yer alan Solomon test problemleri talep açısından düzenlenerek; 5,10,15,20 müşterili örnekler için denenmiştir. Ayrıca modelin amaç fonksiyonu literatürden farklı olarak maliyet ya da mesafe minimizasyonu yerine zaman penceresinden kaynaklanan beklemelerin en azlanması olarak ele alınmıştır.
Keywords
References
- 1. Dantzig, G.B., Ramser, J.H.,1959, “The truck dispatching problem”, Management Science , 6-80. 2. Toth P. Vigo D.,2002, “The vehicle routing problem” Society for Industrial and Applied Mathematics 1-23. 3. Savelsbergh M.W.P., 1985, “Local search in routing problems with time windows”, Annals of Operations Research, 4, 285-305. 4. Solomon M.M.,1987, “Algorithms for the vehicle routing and scheduling problems with time window constrains”, Operations Research, 35, 2, 254-265. 5. Solomon M.M., Desrosier J.,1988, “Survey Paper: The time constrained routing and scheduling problems”, Transportation Science, 22, 1. 6. Çetin, S.,Gencer, C., 2010 “Kesin zaman pencereli eş zamanlı dağıtım toplamalı araç rotalama problemleri: Matematiksel Model”, Gazi Üniv.Müh.Mim. Fak. Der., 25(3),579-585. 7. Pullen H.., Webb M.,1967, “A computer application to a transport scheduling problem”, Computer Journal,10:10-13. 8. Knight K., Hofer J.,1968, “Vehicle scheduling with timed and connected calls: a case study”, Operational Research Quarterly, 19: 299-310. 9. Madsen O.B.G.,1976, 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. 10. El-Sherbeny, N.A.,2010, “Vehicle routing with time windows: An overview of exact, heuristic, metaheuristic methods”, Journal of King Saud University (Science). 11. Eksioglu, B., Vural A.V., Reisman A.,2009, “The vehicle routing problem: A taxonomic review”, Computers &Industrial Engineering, 57: 1472-1483. 12. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C. T. ,2009, “Hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service”, Expert System with Applications, 36: 1070-1081. 13. Ganesh K., Narendran T.T., 2008, “TASTE: A two- phase heuristic to solve a routing problem wiyh simultaneous delivery and pick-up”, International Journal Adv. Manufacturing Technology, 37:12221-1231. 14. Karaoğlan, İ., 2009, “Dağıtım ağları tasarımında yer seçimi ve eşzamanlı topla-dağıt araç rotalama problemleri”, Doktora Tezi, Gazi Üniversitesi Fen Bilimleri Enstitüsü, Ankara. 15. Min, H., 1989, “The multiple vehicle-routing problem with simultaneous delivery and pick-up points”, Transportation research. Part A, Policy and practice, 23(5): 377–386 . 16. Dethloff, J.,2001, “Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up”, OR Spektrum, 23(1): 79-96. 17. Nagy, G. & Salhi, S.2005, “Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries”, European Journal Of Operational Research, 162(1): 126-141. 18. Tang F.A., Galvao R.D., 2002, “Vehicle routing problem with simultaneous pick-up and delivery service”, Journal of the Operational Research Society of India, 39:19 -33. 19. DellAmico, M., Righini, G., Salani, M., 2006,“A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection”, Transportation science, 40(2): 235- 247 20. Ai, T., Kachitvichyanukul, V., “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery”, Computers & Operations Research, 36: 1693-1702 (2009). 21. Choi,E. ,Tcha, D.W., “A column generation approach to the heterogeneous fleet vehicle routing problem”, Computers & Operations Research, baskıda. 22. Sodouni, K.,2006, “Heterogeneous fleet vehicle routing problem with time windows and nonlinearly penalized delays”, Journal of applied Sciences, 6(9),1969-1973. 23. Baldacci, R., Batarra, M., Vigo, D.,2008, “Routing a heterogeous fleet of vehicles” The Vehicle Routing Problem, golden B., raghavan, S., Wasil, E., Edt., Springer. 24. Liu, F.H., Shen S.Y., 1999, “The fleet size and mix vehicle routing problem with time windows”, Journal of Operation Research Society, 50,7221-732. 25. Liu, F.H., Shen S.Y.,1999, “A method for vehicle routing problem with multiple vehicle types and time windows”, Proc. Natl. Sci. Conc. 23(4),526-536. 26. Dondo R., Cerda J.,2007, “A cluster based optimization approach for the multi depot heterogeneous fleet vehicle routing problem with time windows”, European Journal of Operation Research, 176(3), 1478-1507. 27. Salhi S, Nagy G.,1999, “A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling”, Journal of the Operational Research Society, 50(10):1034–1042.