Zaman bağımlı eş zamanlı topla dağıt araç rotalama problemi için bir matematiksel model

Gözde Can Atasagun, İsmail KARAOĞLAN
129 28

Öz


Bu çalışmada zaman bağımlı araç rotalama problemi (ZBARP) ve topla-dağıt araç rotalama problemi (TDARP) birlikte ele alınmıştır. Literatürde henüz çalışılmamış olan ve topla-dağıt araç rotalama probleminin çeşitlerinin daha genel bir hali olarak kabul edilen eş zamanlı topla-dağıt araç rotalama problemi ile zaman bağımlı araç rotalama problemlerini birlikte çözebilmek için zaman bağımlı eş zamanlı topla-dağıt araç rotalama problemi için “ilk giren ilk çıkar (FIFO)” özelliğini sağlayan, zamana bağlı hız fonksiyonunu göz önüne alan ve doğrusal yapıya sahip yeni bir karma tam sayılı matematiksel model geliştirilerek literatürdeki mevcut test problemleri ile deneysel çalışmalar yapılmış ve yorumlanmıştır. Modelin performansı en iyi çözüme ulaşma zamanı ve en iyi çözümden yüzde sapma değeri açısından değerlendirilmiştir.


Anahtar kelimeler


Araç rotalama problemi; Eş zamanlı topla dağıt araç rotalama problemi; Zaman bağımlı araç rotalama problemi

Tam metin:

PDF


Referanslar


Koç, Ç. and I. Karaoğlan, A mathematical model for the time-dependent vehicle routing problem. Journal of the Faculty of Engineering and Architecture of Gazi University, 2014. 29(3): p. 549-558.

Malandraki, C., Time dependent vehicle routing problem: Formulations, solution algorithms and computations experiments. Northwestern University. USA., 1989.

Malandraki, C. and M.S. Daskin, Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Science, 1992. 26(3): p. 185-200.

Hill, A.V. and W.C. Benton, Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems. The Journal of the Operational Research Society, 1992. 43(4): p. 343-351.

Malandraki, C. and R.B. Dial, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research, 1996. 90(1): p. 45-55.

Park, Y.-B., A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds. Computers & Industrial Engineering, 2000. 38(1): p. 173-187.

Jung, S. and A. Haghani, Genetic algorithm for the time-dependent vehicle routing problem. Transportation Network Modeling 2001, 2001(1771): p. 164-171.

Ichoua, S., M. Gendreau, and J.-Y. Potvin, Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 2003. 144(2): p. 379-396.

Fleischmann, B., M. Gietz, and S. Gnutzmann, Time-varying travel times in vehicle routing. Transportation Science, 2004. 38(2): p. 160-173.

Haghani, A. and S. Jung, A dynamic vehicle routing problem with time-dependent travel times. Computers & Operations Research, 2005. 32(11): p. 2959-2986.

Chen, H.K., C.F. Hsueh, and M.S. Chang, The real-time time-dependent vehicle routing problem. Transportation Research Part E-Logistics and Transportation Review, 2006. 42(5): p. 383-408.

Woensel, T., et al., A Queueing Framework for Routing Problems with Time-dependent Travel Times. Journal of Mathematical Modelling and Algorithms, 2007. 6(1): p. 151-173.

Van Woensel, T., et al., Vehicle routing with dynamic travel times: A queueing approach. European Journal of Operational Research, 2008. 186(3): p. 990-1007.

Xin, Z., G. Goncalves, and R. Dupas. A genetic approach to solving the vehicle routing problem with time-dependent travel times. in 2008 Mediterranean Conference on Control and Automation - Conference Proceedings, MED'08. 2008.

Hashimoto, H., M. Yagiura, and T. Ibaraki, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization, 2008. 5(2): p. 434-456.

Kuo, Y.Y., C.C. Wang, and P.Y. Chuang, Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds. Computers & Industrial Engineering, 2009. 57(4): p. 1385-1392.

Soler, D., J. Albiach, and E. Martínez, A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows. Operations Research Letters, 2009. 37(1): p. 37-42.

Jabali, O., et al., Time-dependent vehicle routing subject to time delay perturbations. Iie Transactions, 2009. 41(12): p. 1049-1066.

Kuo, Y., Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers and Industrial Engineering, 2010. 59(1): p. 157-165.

Figliozzi, M.A., 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, 2011. 19(5): p. 766-778.

Figliozzi, M.A., 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, 2012. 48(3): p. 616-636.

Kritzinger, S., et al., Using traffic information for time-dependent vehicle routing. Seventh International Conference on City Logistics, 2012. 39: p. 217-229.

Dabia, S., et al., Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows. Transportation Science, 2013. 47(3): p. 380-396.

Mousavipour, S. and S.M.H. Hojjati, A particle swarm optimisation for time-dependent vehicle routing problem with an efficient travel time function. International Journal of Operational Research, 2014. 20(1): p. 109-120.

Zhang, T., W.A. Chaovalitwongse, and Y.J. Zhang, Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. Journal of Combinatorial Optimization, 2014. 28(1): p. 288-309.

Johar, F., C. Potts, and J. Bennell, 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, 2015. 1643: p. 751-757.

Gendreau, M., G. Ghiani, and E. Guerriero, Time-dependent routing problems: A review. Computers & Operations Research, 2015. 64(Supplement C): p. 189-197.

Parragh, S., K. Doerner, and R. Hartl, A survey on pickup and delivery problems. Journal für Betriebswirtschaft, 2008. 58(1): p. 21-51.

Ropke, S. and D. Pisinger, A unified heuristic for a large class of Vehicle Routing Problems with Backhauls. European Journal of Operational Research, 2006. 171(3): p. 750-775.

Karaoglan, I., Dağıtım Ağları Tasarımında Yer Seçimi ve Eşzamanlı Topla-Dağıt Araç Rotalama Problemleri, in Endüstri Mühendisliği Bölümü. 2009, Gazi Universitesi, Doktora Tezi.

Min, H.K., The Multiple Vehicle-Routing Problem with Simultaneous Delivery and Pick-up Points. Transportation Research Part a-Policy and Practice, 1989. 23(5): p. 377-386.

Halse, K., Modeling and solving complex vehicle routing problems. 1992, Institute of Mathematical Statistics and Operations Research (IMSOR), Technical University of Denmark, Ph.D. thesis.

Dethloff, J., Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. Or Spektrum, 2001. 23(1): p. 79-96.

Nagy, G. and S.d. Salhi, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 2005. 162(1): p. 126-141.

Crispim, J. and B. J., Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhauls, in MIC, 4th Metaheuristic International Conference. 2001: Porto, Portugal.

Chen, J.F. and T.H. Wu, Vehicle Routing Problem with Simultaneous Deliveries and Pickups. The Journal of the Operational Research Society, 2006. 57(5): p. 579-587.

Montane, F.A.T. and R.D. Galvao, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research, 2006. 33(3): p. 595-619.

Bianchessi, N. and G. Righini, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research, 2007. 34(2): p. 578-594.

Ai, T.J. and V. Kachitvichyanukul, A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 2009. 36(5): p. 1693-1702.

Zachariadis, E.E., C.D. Tarantilis, and C.T. Kiranoudis, A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems with Applications, 2009. 36(2): p. 1070-1081.

Gajpal, Y. and P. Abad, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research, 2009. 36(12): p. 3215-3223.

Zachariadis, E.E., C.D. Tarantilis, and C.T. Kiranoudis, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research, 2010. 202(2): p. 401-411.

Subramanian, A., et al., Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Operations Research Letters, 2011. 39(5): p. 338-341.

Zachariadis, E.E. and C.T. Kiranoudis, A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Systems with Applications, 2011. 38(3): p. 2717-2726.

Fan, J., The Vehicle Routing Problem with Simultaneous Pickup and Delivery Based on Customer Satisfaction. Procedia Engineering, 2011. 15: p. 5284-5289.

Wang, H.-F. and Y.-Y. Chen, A genetic algorithm for the simultaneous delivery and pickup problems with time window. Computers & Industrial Engineering, 2012. 62(1): p. 84-95.

Tasan, A.S. and M. Gen, A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers and Industrial Engineering, 2012. 62(3): p. 755-761.

Zachariadis, E.E. and C.T. Kiranoudis, An effective local search approach for the Vehicle Routing Problem with Backhauls. Expert Systems with Applications, 2012. 39(3): p. 3174-3184.

Goksal, F.P., I. Karaoglan, and F. Altiparmak, A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers & Industrial Engineering, 2013. 65(1): p. 39-53.

Liu, R., et al., Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. European Journal of Operational Research, 2013. 230(3): p. 475-486.

Koç, Ç. and G. Laporte, Vehicle routing with backhauls: Review and research perspectives. Computers & Operations Research, 2018. 91(Supplement C): p. 79-91.

Miller, C.E., A.W. Tucker, and R.A. Zemlin, Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 1960. 7(4): p. 326-329.

Kulkarni, R. and P.R. Bhave, Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 1985. 20(1): p. 58-67.

Solomon, M.M., Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, 1987. 35(2): p. 254-265.

Angelelli, E., Mansini, R., 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, 2002.




Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.