Araştırma Makalesi

Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul

Cilt: 10 Sayı: 4 30 Aralık 2022
PDF İndir
EN

Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul

Öz

With the increase in the consumption of petroleum and petroleum products, these limited resources must be provided efficiently, accurately, and with minimal damage. Therefore, the accurate and effective distribution of petroleum, and related problems with petroleum distribution have attracted much attention among the practitioners and optimization working researchers over the years. The petroleum distribution problem, as a version of the Vehicle Routing Problem (VRP), deals with the planning of petroleum distribution from the depot(s) to the petrol stations safely and quickly. In this study, the petrol station replenishment problem (PSRP) is handled and a case study is presented for a public company located in İstanbul. The problem is considered as a time-dependent VRP with time windows. A novel mixed integer mathematical model is proposed for the problem. In order to handle the proposed time-dependent problem in a more realistic way, variable tanker speeds are considered based on traffic density. The optimum route is determined in which risks such as environment and marine pollution may occur in case of possible accidents, and these risks are minimized by the proposed mathematical model considering the factors as traffic, vehicle speed, road structure, the road's proximity to the sea and living areas

Anahtar Kelimeler

Kaynakça

  1. [1] X. H. Qiu, Z. Wang, and Q. Xue, “Investment in deepwater oil and gas exploration projects: a multi-factor analysis with a real options model,” Pet. Sci., vol. 12, no. 3, pp. 525–533, Aug. 2015, doi: 10.1007/s12182-015-0039-4.
  2. [2] H. Li, R. J. Sun, K. Y. Dong, X. C. Dong, Z. Bin Zhou, and X. Leng, “Selecting China’s strategic petroleum reserve sites by multi-objective programming model,” Pet. Sci., vol. 14, no. 3, pp. 622–635, Aug. 2017, doi: 10.1007/s12182-017-0175-0.
  3. [3] X. Pan, F. Teng, Y. Tian, and G. Wang, “Countries’ emission allowances towards the low-carbon world: A consistent study,” Appl. Energy, vol. 155, pp. 218–228, Oct. 2015, doi: 10.1016/j.apenergy.2015.06.011.
  4. [4] E. Erkut and A. Ingolfsson, “Catastrophe avoidance models for hazardous materials route planning,” Transp. Sci., vol. 34, no. 2, pp. 165–179, May 2000, doi: 10.1287/trsc.34.2.165.12303.
  5. [5] B. Y. Kara and V. Verter, “Designing a road network for hazardous materials transportation,” Transp. Sci., vol. 38, no. 2, pp. 188–196, 2004, doi: 10.1287/trsc.1030.0065.
  6. [6] E. Erkut and F. Gzara, “Solving the hazmat transport network design problem,” Comput. Oper. Res., vol. 35, no. 7, pp. 2234–2247, Jul. 2008, doi: 10.1016/j.cor.2006.10.022.
  7. [7] K. G. Zografos and K. N. Androutsopoulos, “A decision support system for integrated hazardous materials routing and emergency response decisions,” Transp. Res. Part C Emerg. Technol., vol. 16, no. 6, pp. 684–703, Dec. 2008, doi: 10.1016/j.trc.2008.01.004.
  8. [8] P. Leonelli, S. Bonvicini, and G. Spadoni, “Hazardous materials transportation: A risk-analysis-based routing methodology,” J. Hazard. Mater., vol. 71, no. 1–3, pp. 283–300, Jan. 2000, doi: 10.1016/S0304-3894(99)00084-9.

Ayrıntılar

Birincil Dil

İngilizce

Konular

Mühendislik

Bölüm

Araştırma Makalesi

Yayımlanma Tarihi

30 Aralık 2022

Gönderilme Tarihi

19 Temmuz 2022

Kabul Tarihi

5 Kasım 2022

Yayımlandığı Sayı

Yıl 2022 Cilt: 10 Sayı: 4

Kaynak Göster

APA
Ayyıldız, E., & Taşkın Gümüş, A. (2022). Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul. Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji, 10(4), 925-939. https://doi.org/10.29109/gujsc.1145730
AMA
1.Ayyıldız E, Taşkın Gümüş A. Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul. GUJS Part C. 2022;10(4):925-939. doi:10.29109/gujsc.1145730
Chicago
Ayyıldız, Ertuğrul, ve Alev Taşkın Gümüş. 2022. “Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul”. Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji 10 (4): 925-39. https://doi.org/10.29109/gujsc.1145730.
EndNote
Ayyıldız E, Taşkın Gümüş A (01 Aralık 2022) Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul. Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji 10 4 925–939.
IEEE
[1]E. Ayyıldız ve A. Taşkın Gümüş, “Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul”, GUJS Part C, c. 10, sy 4, ss. 925–939, Ara. 2022, doi: 10.29109/gujsc.1145730.
ISNAD
Ayyıldız, Ertuğrul - Taşkın Gümüş, Alev. “Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul”. Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji 10/4 (01 Aralık 2022): 925-939. https://doi.org/10.29109/gujsc.1145730.
JAMA
1.Ayyıldız E, Taşkın Gümüş A. Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul. GUJS Part C. 2022;10:925–939.
MLA
Ayyıldız, Ertuğrul, ve Alev Taşkın Gümüş. “Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul”. Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji, c. 10, sy 4, Aralık 2022, ss. 925-39, doi:10.29109/gujsc.1145730.
Vancouver
1.Ertuğrul Ayyıldız, Alev Taşkın Gümüş. Mixed Integer Programming Formulation for Time-Dependent Petrol Station Replenishment Problem: A Real-Life Case in İstanbul. GUJS Part C. 01 Aralık 2022;10(4):925-39. doi:10.29109/gujsc.1145730

Cited By

                                     16168      16167     16166     21432        logo.png   


    e-ISSN:2147-9526