KAPASİTELİ TEK ATAMALI YEŞİL ANADAĞITIM ÜSSÜ KAPSAMA AKIŞ PROBLEMİ
Öz
Anahtar Kelimeler
Kaynakça
- Alumur Alev, S., & Yetis Kara, B. (2009). A Hub Covering Network Design Problem for Cargo Applications in Turkey. The Journal of the Operational Research Society, 60(10), 1349-1359.
- Beasley, J. E. (1990). OR-Library.
- Calik, H., Alumur Alev, S., Yetis Kara, B., & Karasan, O. E. (2009). A Tabu-Search based Heuristic for the Hub Covering Problem over Incomplete Hub Networks . Computers & Operations Research , 36(12), 3088-3096.
- Campbell, J. F. (1994). Integer Programming Formulations of Discrete Hub Location Problems. European Journal of Operational Research, 72(2), 387-405.
- Correia, I., Nickel, S., & Saldanha-da-Gama, F. (2014). Multi-Product Capacitated Single-Allocation Hub Location Problems: Formulations and Inequalities. Networks and Spatial Economics, 14(1), 1-25.
- Dukkanci, O., Peker, M., & Kara, B. Y. (2019). Green hub location problem. Transportation Research Part E: Logistics and Transportation Review, 125, 116-139.
- Karimia, H., Bashiri, M., & Nickel, S. (2016). Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search. International Journal of Engineering, 29(6), 797-808.
- Lowe, T. J., & Sim, T. (2013). The hub covering flow problem. The Journal of the Operational Research Society, 64(7), 973-981.
Ayrıntılar
Birincil Dil
Türkçe
Konular
Üretim ve Hizmet Sistemleri , Üretimde Optimizasyon
Bölüm
Araştırma Makalesi
Yazarlar
Nazmi Şener
*
0000-0002-4027-5143
Türkiye
Yayımlanma Tarihi
3 Aralık 2023
Gönderilme Tarihi
7 Ağustos 2023
Kabul Tarihi
6 Eylül 2023
Yayımlandığı Sayı
Yıl 2023 Cilt: 26 Sayı: 4