Research Article
Year 2024,
Volume: 35 Issue: 1, 92 - 114, 30.04.2024
Abstract
Bu çalışmada, bir limana gelen petrol tankerlerinin gemi-iskele programının optimize edilmesi amaçlanmaktadır. Problemin çözümü için limana yanaşan üç yüz adet geminin verisi toplanmıştır. İncelenen problem literatürde dinamik ve ayrık rıhtım tahsis problemi olarak geçmektedir. Rıhtım tahsis probleminin temel amaçlarından biri de gemilerin limanda bekleme süresini en küçükleyecek şekilde gemilerin rıhtıma yanaşma sırasını belirlemektir. Bu amaçla tam sayılı doğrusal programlama modeli kullanılmıştır. Modelde, rıhtıma yanaştırılacak gemilerin tonaj ve draft kısıtları da göz önünde bulundurulmuştur. Ek olarak, büyük boyutlu problemlerde en iyi çözüme makul bir sürede yakınsayan bir metasezgisel algoritma geliştirilmiştir. Tam sayılı doğrusal programlama modeli küçük boyutlu örnek grubunu sorunsuzca çözmüştür. Tam sayılı doğrusal programlama modelinin çözümü ile karşılaştırıldığında, büyük boyutlu örnek setleri için geliştirilen tavlama benzetimi algoritmasının aynı sonuçları daha kısa sürede çözdüğü görülmüştür. Küçük boyutlu problemlerde her iki yöntemin de, güçlü ve planlama ufkuna bağlı olarak uygulanabilir olduğu anlaşılmıştır. Büyük boyutlu problemlerde ise tavlama benzetimi algoritmasının uygulanabilir olduğu tespit edilmiştir.
References
- Adrian, F. ve Simatupang, T.M. (2014), Crude oil supply chain optimization at PT Pertamina Indonesia. 6th International Conference on Operations and Supply Chain Management, 1161-1172, Bali-Indonesia.
- Cordeau, J.F., Laporte, G., Legato, P. ve Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39(4), 526–538. Doi: https://doi.org/10.1287/trsc.1050.0120
- Feng, X., Hu, S., Gu, W., Jin, X. ve Lu, Y. (2020). A simulation-based approach for assessing seaside infrastructure improvement measures for large marine crude oil terminals. Transportation Research Part E: Logistics and Transportation Review, 142(10), 1-20. Doi: https://doi.org/10.1016/j.tre.2020.102051
- Golias, M.M., Boile, M. ve Theofanis, S. (2010). Discrete berth-scheduling problem: Toward a unified mathematical formulation. Journal of the Transportation Research Board, 2168(1), 1–8. Doi: https://doi.org/10.3141/2168-01
- Güden, H., Vakvak, B., Özkan, B.E., Altıparmak, F. ve Dengiz, B. (2005). Genel amaçlı arama algoritmaları ile benzetim eniyilemesi: En iyi kanban sayısının bulunması. Endüstri Mühendisliği, 16(1), 2-15.
- Gülsün, B., Tuzkaya, G. ve Bildik, E. (2008). Reverse logistics network design: A simulated annealing approach. Journal of Engineering and Natural Sciences, 26(1), 68-80.
- Imai, A., Nagaiwa, K. ve Tat, C.W. (1997). Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation, 31(1), 75-94. Doi: https://doi.org/10.1002/atr.5670310107
- Imai, A., Nishimura, E. ve Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35(4), 401-417. Doi: https://doi.org/10.1016/S0191-2615(99)00057-0
- Kavoosi, M., Dulebenets, M. A., Abioye, O., Pasha, J., Theophilus, O., Wang, H., ... & Mikijeljević, M. (2019). Berth scheduling at marine container terminals: A universal island-based metaheuristic approach. Maritime Business Review, 5(1), 30-66.
- Kim, K.H. ve Moon, K.C. (2003). Berth scheduling by simulated annealing. Transportation Research Part B: Methodological, 37(6) 541–560. Doi: https://doi.org/10.1016/S0191-2615(02)00027-9
- Kirkpatrick, S., Gelatt, C.D. ve Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. DOI: 10.1126/science.220.4598.6
- Lin, S.W. ve Ting, C.J. (2013). Solving the dynamic berth allocation problem by simulated annealing. Engineering Optimization, 46(3), 308-327. Doi: https://doi.org/10.1080/0305215X.2013.768241
- Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. ve Teller, E. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087-1092. Doi: https://doi.org/10.1063/1.1699114
- Rodrigues, I.B.G., Rosa, R.A., Gomes, T.C. ve Riberio, G.M. (2016). Mathematical model for the berth allocation problem in ports with cargo operation limitations along the pier. Gest. Prod., São Carlos, 23(4), 771-786. Doi: https://doi.org/10.1590/0104-530X2266-15
- Rosa, R.A., Riberio, G.M., Mauri, G.R. ve Fracaroli, W. (2017). Planning the berth allocation problem in developing countries with multiple cargos and cargo priority by a mathematical model and a clustering search metaheuristic. International Journal of Logistics Systems and Management, 28(4), 397-418. Doi: https://doi.org/10.1504/IJLSM.2017.087785
- Taş, O. (2007). Havayolu şirketlerinde uçuşların atanması probleminin tavlama benzetimi ile çözülmesi (Yüksek lisans tezi), Çukurova Üniversitesi Fen Bilimleri Enstitüsü, Adana. Erişim adresi: https://acikbilim.yok.gov.tr/handle/20.500.12812/148996
- Ting, C.J., Wu, K.C. ve Chou, H. (2014). Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications, 41(4), 1543–1550. Doi: https://doi.org/10.1016/j.eswa.2013.08.051
- TÜBİTAK Vizyon 2023 Teknoloji Öngörüleri Projesi. (2002). TÜSSİDE, 8-9 Kasım 2002, Gebze-Kocaeli.
- Xu, Y., Xue, K. ve Du, Y. (2018). Berth scheduling problem considering traffic limitations in the navigation channel. Sustainability, 10(12), 4795-4816. Doi: https://doi.org/10.3390/su10124795
Year 2024,
Volume: 35 Issue: 1, 92 - 114, 30.04.2024
Abstract
References
- Adrian, F. ve Simatupang, T.M. (2014), Crude oil supply chain optimization at PT Pertamina Indonesia. 6th International Conference on Operations and Supply Chain Management, 1161-1172, Bali-Indonesia.
- Cordeau, J.F., Laporte, G., Legato, P. ve Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39(4), 526–538. Doi: https://doi.org/10.1287/trsc.1050.0120
- Feng, X., Hu, S., Gu, W., Jin, X. ve Lu, Y. (2020). A simulation-based approach for assessing seaside infrastructure improvement measures for large marine crude oil terminals. Transportation Research Part E: Logistics and Transportation Review, 142(10), 1-20. Doi: https://doi.org/10.1016/j.tre.2020.102051
- Golias, M.M., Boile, M. ve Theofanis, S. (2010). Discrete berth-scheduling problem: Toward a unified mathematical formulation. Journal of the Transportation Research Board, 2168(1), 1–8. Doi: https://doi.org/10.3141/2168-01
- Güden, H., Vakvak, B., Özkan, B.E., Altıparmak, F. ve Dengiz, B. (2005). Genel amaçlı arama algoritmaları ile benzetim eniyilemesi: En iyi kanban sayısının bulunması. Endüstri Mühendisliği, 16(1), 2-15.
- Gülsün, B., Tuzkaya, G. ve Bildik, E. (2008). Reverse logistics network design: A simulated annealing approach. Journal of Engineering and Natural Sciences, 26(1), 68-80.
- Imai, A., Nagaiwa, K. ve Tat, C.W. (1997). Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation, 31(1), 75-94. Doi: https://doi.org/10.1002/atr.5670310107
- Imai, A., Nishimura, E. ve Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35(4), 401-417. Doi: https://doi.org/10.1016/S0191-2615(99)00057-0
- Kavoosi, M., Dulebenets, M. A., Abioye, O., Pasha, J., Theophilus, O., Wang, H., ... & Mikijeljević, M. (2019). Berth scheduling at marine container terminals: A universal island-based metaheuristic approach. Maritime Business Review, 5(1), 30-66.
- Kim, K.H. ve Moon, K.C. (2003). Berth scheduling by simulated annealing. Transportation Research Part B: Methodological, 37(6) 541–560. Doi: https://doi.org/10.1016/S0191-2615(02)00027-9
- Kirkpatrick, S., Gelatt, C.D. ve Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. DOI: 10.1126/science.220.4598.6
- Lin, S.W. ve Ting, C.J. (2013). Solving the dynamic berth allocation problem by simulated annealing. Engineering Optimization, 46(3), 308-327. Doi: https://doi.org/10.1080/0305215X.2013.768241
- Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. ve Teller, E. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087-1092. Doi: https://doi.org/10.1063/1.1699114
- Rodrigues, I.B.G., Rosa, R.A., Gomes, T.C. ve Riberio, G.M. (2016). Mathematical model for the berth allocation problem in ports with cargo operation limitations along the pier. Gest. Prod., São Carlos, 23(4), 771-786. Doi: https://doi.org/10.1590/0104-530X2266-15
- Rosa, R.A., Riberio, G.M., Mauri, G.R. ve Fracaroli, W. (2017). Planning the berth allocation problem in developing countries with multiple cargos and cargo priority by a mathematical model and a clustering search metaheuristic. International Journal of Logistics Systems and Management, 28(4), 397-418. Doi: https://doi.org/10.1504/IJLSM.2017.087785
- Taş, O. (2007). Havayolu şirketlerinde uçuşların atanması probleminin tavlama benzetimi ile çözülmesi (Yüksek lisans tezi), Çukurova Üniversitesi Fen Bilimleri Enstitüsü, Adana. Erişim adresi: https://acikbilim.yok.gov.tr/handle/20.500.12812/148996
- Ting, C.J., Wu, K.C. ve Chou, H. (2014). Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications, 41(4), 1543–1550. Doi: https://doi.org/10.1016/j.eswa.2013.08.051
- TÜBİTAK Vizyon 2023 Teknoloji Öngörüleri Projesi. (2002). TÜSSİDE, 8-9 Kasım 2002, Gebze-Kocaeli.
- Xu, Y., Xue, K. ve Du, Y. (2018). Berth scheduling problem considering traffic limitations in the navigation channel. Sustainability, 10(12), 4795-4816. Doi: https://doi.org/10.3390/su10124795
There are 19 citations in total.
Details
| Primary Language | Turkish |
|---|---|
| Subjects | Industrial Engineering |
| Journal Section | Research Articles |
| Authors | |
| Early Pub Date | April 21, 2024 |
| Publication Date | April 30, 2024 |
| Acceptance Date | April 5, 2024 |
| Published in Issue | Year 2024 Volume: 35 Issue: 1 |
