T. C. Selçuk üNİversitesi fen biLİmleri enstiTÜSÜ
Yüklə 421,94 Kb.
|
- Bu səhifədəki naviqasiya:
- 5.2 Öneriler
- ÖZGEÇMİŞ
5.1 SonuçlarBu tez çalışmasında ARP kavramı ve çeşitleri genel olarak açıklanmış, ZB_ETD_ARP ayrıntılı olarak incelenerek tanımlanmış ve literatürde bu problem türleri için yapılmış çalışmalar kapsamlı bir şekilde araştırılarak her bir çalışmanın özellikleri detaylı olarak açıklanmıştır. İlk olarak, zamana bağlı hız fonksiyonu özelliğini göz önüne alarak “ilk giren ilk çıkar (FIFO)” yaklaşımını sağlayan, doğrusal yapıya sahip ve kesin hesaplama gerçekleştiren yeni bir karma tamsayılı matematiksel model geliştirilmiştir. Literatürde henüz çalışılmamış olan bu problemi test etmek için Solomon’un (1987) 25 müşterilik test kümesi ve Ichoua ve ark. (2003) tarafından kullanılan seyahat hızı matrisi göz önüne alınarak ZB_ETD_ARP için toplamda 112 tane yeni test problemi türetilmiştir. Test problemlerinin yalnızca 3 adedinde optimal sonuca ulaşılırken ortalama YSD %20.25 olarak hesaplanmıştır. Optimal sonuca ulaşılan 3 probleminde RC1 tipinde olması bazı müşterilerin rassal bazı müşterilerin belli bölgelerde kümelendiği durumların yerleşim açısından daha başarılı olduğu sonucunu vermektedir. 1. tip problemlerin YSD sonuçları ise 2. tip problemlere göre daha düşük çıkmıştır. Dolayısıyla dağıtım ve toplama talepleri birbirine ne kadar yakın ise elde edilen sonuç da o kadar iyi olacaktır. Önerilen matematiksel model ile bu problemler üzerinde gerçekleştirilen deneysel çalışmalar ile elde edilen sonuçlar sunulmuş ve yorumlanmıştır. 5.2 ÖnerilerNP-Zor sınıfında yer alan ve dolayısıyla çözümü oldukça zor olan ZB_ETD_ARP için önerilen matematiksel modeller ile orta ve büyük boyutlu problemlerde en iyi çözümlere ulaşmak mümkün değildir. Bu nedenle, daha sonraki çalışmalarda çok kısa sürelerde iyi çözümler sunacak sezgisel/meta-sezgisel yöntemler geliştirilebilir. Sonraki aşamada, en iyi çözümleri elde edebilmek amacıyla, önerilen matematiksel model, sezgisel yöntem ve geçerli eşitsizlikler (valid inequalities) yardımıyla bir kesin algoritma geliştirilebilir. KAYNAKLAR Ahn, B.-H. ve Shin, J.-Y., 1991, Vehicle-routeing with time windows and time-varying congestion, Journal of the Operational Research Society, 42 (5), 393-400. Ai, T. J. ve Kachitvichyanukul, V., 2009, A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery, Computers & Operations Research, 36 (5), 1693-1702. Alkan, A., 2003, Lojistik Yönetiminde Filo Yönetim Sistemleri, Yıldız Teknik Üniversitesi. Angelelli, E., Mansini, R., 2002, Quantitative Approaches to Distribution Logistics and Supply Chain Management, Editörler: Klose, A., Speranza, M. G., Van Wassenhove, L. N., , Springer-Verlag, Berlin, 249-267. Badeau, P., Guertin, F., Gendreau, M., Potvin, J.-Y. ve Taillard, E., 1997, A parallel tabu search heuristic for the vehicle routing problem with time windows, Transportation Research Part C: Emerging Technologies, 5 (2), 109-122. Balseiro, S. R., Loiseau, I. ve Ramonet, J., 2011, An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows, Computers & Operations Research, 38 (6), 954-966. Bianchessi, N. ve Righini, G., 2007, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Computers & Operations Research, 34 (2), 578-594. Chen, H. K., Hsueh, C. F. ve Chang, M. S., 2006, The real-time time-dependent vehicle routing problem, Transportation Research Part E-Logistics and Transportation Review, 42 (5), 383-408. Chen, J. F. ve Wu, T. H., 2006, Vehicle Routing Problem with Simultaneous Deliveries and Pickups, The Journal of the Operational Research Society, 57 (5), 579-587. Crispim, J. ve J., B., 2001, Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhauls. MIC, 4th Metaheuristic International Conference. Porto, Portugal. Çatay, B., 2010, A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery, Expert Systems with Applications, 37 (10), 6809-6817. Dabia, S., Ropke, S., van Woensel, T. ve De Kok, T., 2013, Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows, Transportation Science, 47 (3), 380-396. Dantzig, G. B. ve Ramser, J. H., 1959, The Truck Dispatching Problem, Management Science, 6 (1), 80-91. Desrochers, M. ve Laporte, G., 1991, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Operations Research Letters, 10 (1), 27-36. Dethloff, J., 2001, Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up, Or Spektrum, 23 (1), 79-96. Donati, A. V., Montemanni, R., Casagrande, N., Rizzoli, A. E. ve Gambardella, L. M., 2008, Time dependent vehicle routing problem with a multi ant colony system, European Journal of Operational Research, 185 (3), 1174-1191. Duan, Z. Y., Yang, D. Y. ve Wang, S., 2010, An improved genetic algorithm for time dependent vehicle routing problem, Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, V1835-V1839. Dursun, P., 2009, Zaman Pencereli Araç Rotalama Problemi’nin Genetik Algoritma İle Modellenmesi, İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, Yüksek Lisans Tezi. Ekizler, H., 2011, Araç Rotalama Probleminin Çözümünde Karınca Kolonisi Optimizasyonu Algoritmasının Kullanılması, İstanbul Üniversitesi, Fen Bilimleri Enstitüsü, Yüksek Lisans Tezi. Fan, J., 2011, The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction, Procedia Engineering, 15, 5284-5289. Figliozzi, M. A., 2011, The impacts of congestion on time-definitive urban freight distribution networks CO2 emission levels: Results from a case study in Portland, Oregon, Transportation Research Part C: Emerging Technologies, 19 (5), 766-778. Figliozzi, M. A., 2012, The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics, Transportation Research Part E-Logistics and Transportation Review, 48 (3), 616-636. Fleischmann, B., Gietz, M. ve Gnutzmann, S., 2004, Time-varying travel times in vehicle routing, Transportation Science, 38 (2), 160-173. Gajpal, Y. ve Abad, P., 2009, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, Computers & Operations Research, 36 (12), 3215-3223. Goksal, F. P., Karaoglan, I. ve Altiparmak, F., 2013, A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery, Computers & Industrial Engineering, 65 (1), 39-53. Haghani, A. ve Jung, S., 2005, A dynamic vehicle routing problem with time-dependent travel times, Computers & Operations Research, 32 (11), 2959-2986. Halse, K., 1992, Modeling and solving complex vehicle routing problems, Institute of Mathematical Statistics and Operations Research (IMSOR), Technical University of Denmark, Ph.D. thesis. Hashimoto, H., Yagiura, M. ve Ibaraki, T., 2008, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Discrete Optimization, 5 (2), 434-456. Hemmelmayr, V. C., Doerner, K. F. ve Hartl, R. F., 2009, A variable neighborhood search heuristic for periodic routing problems, European Journal of Operational Research, 195 (3), 791-802. Hill, A. V. ve Benton, W. C., 1992, Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems, The Journal of the Operational Research Society, 43 (4), 343-351. Ho, W., Ho, G. T. S., Ji, P. ve Lau, H. C. W., 2008, A hybrid genetic algorithm for the multi-depot vehicle routing problem, Engineering Applications of Artificial Intelligence, 21 (4), 548-557. Ichoua, S., Gendreau, M. ve Potvin, J.-Y., 2003, Vehicle dispatching with time-dependent travel times, European Journal of Operational Research, 144 (2), 379-396. Jabali, O., Van Woensel, T., De Kok, A. G., Lecluyse, C. ve Peremans, H., 2009, Time-dependent vehicle routing subject to time delay perturbations, Iie Transactions, 41 (12), 1049-1066. Johar, F., Potts, C. ve Bennell, J., 2015, Solving the Time Dependent Vehicle Routing Problem by Metaheuristic Algorithms, 2nd Ism International Statistical Conference 2014 (Ism-Ii): Empowering the Applications of Statistical and Mathematical Sciences, 1643, 751-757. Jung, S. ve Haghani, A., 2001, Genetic algorithm for the time-dependent vehicle routing problem. Transportation Research Record: 164-171. Kara, I., Laporte, G., Bektas, T., 2004, A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem, European Journal of Operational Research, 158, 793-795. Karaoglan, I., 2009, Dağıtım Ağları Tasarımında Yer Seçimi ve Eşzamanlı Topla-Dağıt Araç Rotalama Problemleri, Gazi Universitesi, Doktora Tezi. Koç, Ç., 2012, Zaman bağımlı araç rotalama problemi, Selçuk Üniversitesi Fen Bilimleri Enstitüsü. Koç, Ç. ve Karaoʇlan, I., 2014, A mathematical model for the time-dependent vehicle routing problem, Journal of the Faculty of Engineering and Architecture of Gazi University, 29 (3), 549-558. Kritzinger, S., Doerner, K. F., Hartl, R. F., Kiechle, G., Stadler, H. ve Manohar, S. S., 2012, Using traffic information for time-dependent vehicle routing, Seventh International Conference on City Logistics, 39, 217-229. Kulkarni, R. V. ve Bhave, P. R., 1985, Integer programming formulations of vehicle routing problems, European Journal of Operational Research, 20 (1), 58-67. Kuo, Y., 2010, Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem, Computers and Industrial Engineering, 59 (1), 157-165. Kuo, Y. Y., Wang, C. C. ve Chuang, P. Y., 2009, Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds, Computers & Industrial Engineering, 57 (4), 1385-1392. Laporte, G., 1992, The Vehicle-Routing Problem - an Overview of Exact and Approximate Algorithms, European Journal of Operational Research, 59 (3), 345-358. Larsen, A., 2001, The Dynamic Vehicle Routing Problem, Technical University of Denmark, Department of Mathematical Modelling (IMM),Ph.D. Thesis. Li, F., Golden, B. ve Wasil, E., 2007, The open vehicle routing problem: Algorithms, large-scale test problems, and computational results, Computers & Operations Research, 34 (10), 2918-2930. Liu, R., Xie, X., Augusto, V. ve Rodriguez, C., 2013, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, European Journal of Operational Research, 230 (3), 475-486. Liu, Y. Q., Chang, Q. ve Xiong, H. G., 2011, An Improved Ant Colony Algorithm for the Vehicle Routing Problem in Time-Dependent Networks, IEICE Transactions on Communications, E94B (5), 1506-1510. Malandraki, C., 1989, Time dependent vehicle routing problem: Formulations, solution algorithms and computations experiments, Northwestern University. USA. Malandraki, C. ve Daskin, M. S., 1992, Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms, Transportation Science, 26 (3), 185-200. Malandraki, C. ve Dial, R. B., 1996, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European Journal of Operational Research, 90 (1), 45-55. Miller, C. E., Tucker, A. W. ve Zemlin, R. A., 1960, Integer Programming Formulation of Traveling Salesman Problems, J. ACM, 7 (4), 326-329. Min, H. K., 1989, The Multiple Vehicle-Routing Problem with Simultaneous Delivery and Pick-up Points, Transportation Research Part a-Policy and Practice, 23 (5), 377-386. Montane, F. A. T. ve Galvao, R. D., 2006, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Computers & Operations Research, 33 (3), 595-619. Montemanni, R., Gambardella, L. M., Rizzoli, A. E. ve Donati, A. V., 2002, A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale. Mousavipour, S. ve Hojjati, S. M. H., 2014, A particle swarm optimisation for time-dependent vehicle routing problem with an efficient travel time function, International Journal of Operational Research, 20 (1), 109-120. Nagy, G. ve Salhi, S. d., 2005, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, European Journal of Operational Research, 162 (1), 126-141. Park, Y.-B., 2000, A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds, Computers & Industrial Engineering, 38 (1), 173-187. Parragh, S., Doerner, K. ve Hartl, R., 2008, A survey on pickup and delivery problems, Journal für Betriebswirtschaft, 58 (1), 21-51. Ropke, S. ve Pisinger, D., 2006, A unified heuristic for a large class of Vehicle Routing Problems with Backhauls, European Journal of Operational Research, 171 (3), 750-775. Santos, L., Coutinho-Rodrigues, J. ve Current, J. R., 2010, An improved ant colony optimization based algorithm for the capacitated arc routing problem, Transportation Research Part B: Methodological, 44 (2), 246-266. Soler, D., Albiach, J. ve Martínez, E., 2009, A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows, Operations Research Letters, 37 (1), 37-42. Solomon, M. M., 1987, Algorithms for the vehicle routing and scheduling problems with time window constraints, Oper. Res., 35 (2), 254-265. Subramanian, A., Drummond, L. M. A., Bentes, C., Ochi, L. S. ve Farias, R., 2010, A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery, Computers & Operations Research, 37 (11), 1899-1911. Subramanian, A., Uchoa, E., Pessoa, A. A. ve Ochi, L. S., 2011, Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery, Operations Research Letters, 39 (5), 338-341. Tasan, A. S. ve Gen, M., 2012, A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries, Computers and Industrial Engineering, 62 (3), 755-761. Toth, P. ve Vigo, D., 2002a, 1. An Overview of Vehicle Routing Problems, In: The Vehicle Routing Problem, Eds, p. 1-26. Van Woensel, T., Kerbache, L., Peremans, H. ve Vandaele, N., 2008, Vehicle routing with dynamic travel times: A queueing approach, European Journal of Operational Research, 186 (3), 990-1007. Wang, H.-F. ve Chen, Y.-Y., 2012, A genetic algorithm for the simultaneous delivery and pickup problems with time window, Computers & Industrial Engineering, 62 (1), 84-95. Woensel, T., Kerbache, L., Peremans, H. ve Vandaele, N., 2007, A Queueing Framework for Routing Problems with Time-dependent Travel Times, Journal of Mathematical Modelling and Algorithms, 6 (1), 151-173. Xin, Z., Goncalves, G. ve Dupas, R., 2008, A genetic approach to solving the vehicle routing problem with time-dependent travel times, 2008 Mediterranean Conference on Control and Automation - Conference Proceedings, MED'08, 413-418. Zachariadis, E. E., Tarantilis, C. D. ve Kiranoudis, C. T., 2009, A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service, Expert Systems with Applications, 36 (2), 1070-1081. Zachariadis, E. E., Tarantilis, C. D. ve Kiranoudis, C. T., 2010, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, European Journal of Operational Research, 202 (2), 401-411. Zachariadis, E. E. ve Kiranoudis, C. T., 2011, A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries, Expert Systems with Applications, 38 (3), 2717-2726. Zachariadis, E. E. ve Kiranoudis, C. T., 2012, An effective local search approach for the Vehicle Routing Problem with Backhauls, Expert Systems with Applications, 39 (3), 3174-3184. Zhang, T., Zhang, Y. J., Lai, W. W. ve Hu, J. Y., 2009, Research on time dependent vehicle routing problem with simultaneous delivery and pickup, 5th International Conference on Natural Computation, ICNC 2009, 66-70. Zhang, T., Chaovalitwongse, W. A. ve Zhang, Y. J., 2014, Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, Journal of Combinatorial Optimization, 28 (1), 288-309. ÖZGEÇMİŞKİŞİSEL BİLGİLER
EĞİTİM
İŞ DENEYİMLERİ
UZMANLIK ALANI Matematiksel Modelleme, Araç Rotalama Problemleri, Programlama Dilleri YABANCI DİLLER İngilizce Yüklə 421,94 Kb. Dostları ilə paylaş:
|