ULUSLARARASI TAŞIMA YAPAN BİR LOJİSTİK FİRMASI İÇİN ARAÇ ROTALARININ VE YAKIT İKMAL NOKTALARININ BELİRLENMESİ

Abstract

Uluslararası taşıma yapan lojistik firmaları için araçlarının rotalarının yanı sıra yakıt ikmal noktalarının ve her noktada ne kadar yakıt alınacağının belirlenmesi de önemli bir problemdir. Ülkelerin ve hatta bir ülke içerisindeki şehirlerin yakıt fiyatları değişkenlik gösterdiğinden iyi bir planlama ile yakıt maliyetlerinin kayda değer miktarda azaltılabilmesi mümkün olabilmektedir. Uluslararası taşımacılıkta bir diğer önemli konu da geçiş yapılacak ülkelerdeki bürokratik işlemlerden kaynaklanan bekleme sürelerinin mümkün olduğunca azaltılmasıdır. Bu çalışmada hem toplam yakıt maliyetinin hem de bürokratik süreçlerden kaynaklanan beklemelerin enküçüklendiği iki amaçlı bir matematiksel model önerilmiştir. Erişilebilen literatür dikkate alındığında, bu çalışma, hem yakıt ikmalinin dikkate alınmadığı pek çok çalışmadan farklılaşmaktadır hem de bir aracın seyahat boyunca giriş yapılan ülkelerdeki bekleme süreleri toplamının enküçüklenmesine odaklanan ilk çalışmadır. Önerilen matematiksel model bir lojistik firmasında uygulanmış ve toplam yakıt maliyetinde %57’ye bürokratik süreçlerden kaynaklanan beklemelerde ise %25’e kadar iyileştirme fırsatları sunmuştur.

Keywords

• Araç rotalama problemi
• yakıt ikmal noktalarının belirlenmesi
• iki amaçlı programlama
• tamsayılı programlama
• epsilon kısıt

Determination of Vehicle Routes and Refueling Points for A Logistics Company Operating in International Transportation

Abstract

Determining the routes of vehicles as well as the refueling points and how much fuel to buy at each point is also an important problem for logistics companies operating in international transportation. Since fuel prices of countries and even cities within a country vary, it is possible to reduce fuel costs significantly with good planning. Another important issue in international transportation is reducing the waiting times resulting from bureaucratic procedures in the countries to be transited as much as possible. In this study, a bi-objective mathematical model is proposed in which both the total fuel cost and the waiting times resulting from bureaucratic procedures are minimized. Considering the accessible literature, this study differs from many studies that do not take refueling into account and is the first study that focuses on minimizing the total waiting times of a vehicle in the countries it enters during its journey. The proposed mathematical model was applied in a logistics company and provided improvement opportunities up to 57% in total fuel costs and 25% in waiting times due to bureaucratic processes.

Keywords

• Vehicle routing problem
• determination of refueling points
• bi-objective programming
• Integer programming
• epsilon constraint

References

1. Behnamian, J., Ghadimi, M. ve Farajiamiri, M. (2023) Data mining-based firefly algorithm for green vehicle routing problem with heterogeneous fleet and refueling constraint, Artificial Intelligence Review, 56(7), 6557-6589. doi:10.1007/s10462-022-10336-9
2. Bousonville, T., Hartmann, A., Melo, T. ve Kopfer, H. (2011) Vehicle routing and refueling: the impact of price variations on tour length, Herausforderungen, Chancen und Lösungen Band II, 83.
3. Cuate, O., Belmont, R., Uribe, L., Villamar, G. P., GP, I. ve Nava, C. S. S. (2024) Backup Solutions for the Refueling Problem in Foreign Transportation: A Case Study in Mexico, In Mexican International Conference on Artificial Intelligence, Springer Nature Switzerland.
4. Khuller, S., Malekian, A. ve Mestre, J. (2011) To fill or not to fill: The gas station problem, ACM Transactions on Algorithms (TALG), 7(3), 1-16. doi:10.1145/1978782.1978791
5. Li, L., Liang, H., Fan, P., Li, T., Xiong, S. X., Li, Y. ve Mao, Y. (2021) Joint optimization and online algorithms of fuel-aware multi-objective routing for autonomous vehicles, IEEE Transactions on Intelligent Transportation Systems, 23(7), 9294-9300. doi:10.1109/TITS.2021.3086154
6. Li, Y., Yang, Z., Zhang, S. ve Liu, W. (2024) A study of the capacitated vehicle routing problem with time-window and three-dimensional loading constraints in land–sea transport, Sustainability, 16(23), 2071-1050. doi:10.3390/su162310272
7. Madankumar, S. ve Rajendran, C. (2018) Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain, Computers & Operations Research, 89, 183-192. doi:10.1016/j.cor.2016.03.013
8. Mavrotas, G. (2009) Effective implementation of the ε-constraint method in multi-objective mathematical programming problems, Applied Mathematics and Computation, 213(2), 455-465. doi:10.1016/j.amc.2009.03.037

9. Neves-Moreira, F., Amorim-Lopes, M. ve Amorim, P. (2020) The multi-period vehicle routing problem with refueling decisions: Traveling further to decrease fuel cost? Transportation Research Part E: Logistics and Transportation Review, 133, 101817. doi:10.1016/j.tre.2019.11.011
10. Sadati, M. E. H. ve Çatay, B. (2021) A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem, Transportation Research Part E: Logistics and Transportation Review, 149, 102293. doi:10.1016/j.tre.2021.102293
11. Saraç, T.ve Özçelik, F. (2023) A matheuristic algorithm for multi-objective unrelated parallel machine scheduling problem, Journal of the Faculty of Engineering and Architecture of Gazi University, 38(3). doi:10.17341/gazimmfd.873295
12. Sundar, K., Venkatachalam, S. ve Rathinam, S. (2016) Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem, In 2016 American Control Conference (ACC), 6489-6494.
13. Suzuki, Y. (2009) A decision support system of dynamic vehicle refueling, Decision Support Systems, 46(2), 522-531. doi:10.1016/j.dss.2008.09.005
14. Suzuki, Y. (2011) A new truck-routing approach for reducing fuel consumption and pollutants emission, Transportation Research Part D: Transport and Environment, 16(1), 73-77. doi:10.1016/j.trd.2010.08.003
15. Suzuki, Y. (2012) A decision support system of vehicle routing and refueling for motor carriers with time-sensitive demands, Decision Support Systems, 54(1), 758-767. doi:10.1016/j.dss.2012.09.004
16. Suzuki, Y. (2014) A variable-reduction technique for the fixed-route vehicle-refueling problem, Computers & Industrial Engineering, 67, 204-215. doi:10.1016/j.cie.2013.11.007
17. Suzuki, Y. ve Dai, J. (2013) Decision support system of truck routing and refueling: A dual-objective approach, Decision Sciences, 44(5), 817-842. doi:10.1111/deci.12029
18. Suzuki, Y. ve Lan, B. (2018) Cutting fuel consumption of truckload carriers by using new enhanced refueling policies, International Journal of Production Economics, 202, 69-80. doi:10.1016/j.ijpe.2018.05.007
19. Suzuki, Y., Montabon, F. ve Lu, S. H. (2014) DSS of vehicle refueling: A new enhanced approach with fuel weight considerations, Decision Support Systems, 68, 15-25. doi:10.1016/j.dss.2014.10.005
20. Xiao, Y., Zhao, Q., Kaku, I. ve Xu, Y. (2012) Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Computers & Operations Research, 39(7), 1419-1431. doi:10.1016/j.cor.2011.08.013
21. Zhang, J., Ye, J. X., Lin, J. ve Song, H. B. (2024) A discrete Jaya algorithm for vehicle routing problems with uncertain demands, Systems Science & Control Engineering, 12(1), 2350165. doi:10.1080/21642583.2024.2350165
22. Zhang, S., Gajpal, Y. ve Appadoo, S. S. (2018) A meta-heuristic for capacitated green vehicle routing problem, Annals of Operations Research, 269, 753-771. doi:10.1007/s10479-017-2567-3
23. Zhao, S., Nandy, A., Choset, H., Rathinam, S. ve Ren, Z. (2025) Heuristic Search for Path Finding with Refuelling, IEEE Robotics and Automation Letters, 10(4), 3230-3237. doi: 10.1109/LRA.2025.3540736