A capacitated mobile facility location problem with mobile demand: Recurrent service provision to en route refugees | Kütüphane.osmanlica.com

A capacitated mobile facility location problem with mobile demand: Recurrent service provision to en route refugees

İsim A capacitated mobile facility location problem with mobile demand: Recurrent service provision to en route refugees
Yazar Pashapour, A., Danış, Dilek Günneç, Salman, F. S., Yücel, E.
Basım Tarihi: 2022
Basım Yeri - OpenProceedings.org
Konu Benders decomposition, Capacitated mobile facility location, En route refugees, Humanitarian logistics, Matheuristic, Mobile demand
Tür Belge
Dil İngilizce
Dijital Evet
Yazma Hayır
Kütüphane: Özyeğin Üniversitesi
Demirbaş Numarası 2367-2005
Kayıt Numarası ab8c5719-b736-47a5-89d1-22a24c5c0993
Lokasyon Industrial Engineering
Tarih 2022
Notlar TÜBİTAK
Örnek Metin In this paper, we help humanitarian organizations provide service via mobile facilities (MFs) to migrating refugees, who attempt to cross international borders. Over a planning horizon, we aim to optimize number and routes and relocations of the MFs over a planning horizon. The problem is represented on a network where several refugee groups relocate in their predetermined paths throughout the periods. To incorporate continuity of service, each refugee group should be served at least once every fixed consecutive periods via capacitated MFs. We aim to minimize the total cost, consisting of fixed, service provision, and MF relocation costs, while ensuring the service continuity requirement. We formulate a mixed integer linear programming (MILP) model for this problem. We develop a matheuristic and an accelerated Benders decomposition algorithm as an exact solution method. The proposed model and solution methods are investigated over instances we extracted from the 2020 Honduras migration crisis.
DOI 10.48786/inoc.2022.16
Cilt 2022
Kaynağa git Özyeğin Üniversitesi Özyeğin Üniversitesi
Özyeğin Üniversitesi Özyeğin Üniversitesi
Kaynağa git

A capacitated mobile facility location problem with mobile demand: Recurrent service provision to en route refugees

Yazar Pashapour, A., Danış, Dilek Günneç, Salman, F. S., Yücel, E.
Basım Tarihi 2022
Basım Yeri - OpenProceedings.org
Konu Benders decomposition, Capacitated mobile facility location, En route refugees, Humanitarian logistics, Matheuristic, Mobile demand
Tür Belge
Dil İngilizce
Dijital Evet
Yazma Hayır
Kütüphane Özyeğin Üniversitesi
Demirbaş Numarası 2367-2005
Kayıt Numarası ab8c5719-b736-47a5-89d1-22a24c5c0993
Lokasyon Industrial Engineering
Tarih 2022
Notlar TÜBİTAK
Örnek Metin In this paper, we help humanitarian organizations provide service via mobile facilities (MFs) to migrating refugees, who attempt to cross international borders. Over a planning horizon, we aim to optimize number and routes and relocations of the MFs over a planning horizon. The problem is represented on a network where several refugee groups relocate in their predetermined paths throughout the periods. To incorporate continuity of service, each refugee group should be served at least once every fixed consecutive periods via capacitated MFs. We aim to minimize the total cost, consisting of fixed, service provision, and MF relocation costs, while ensuring the service continuity requirement. We formulate a mixed integer linear programming (MILP) model for this problem. We develop a matheuristic and an accelerated Benders decomposition algorithm as an exact solution method. The proposed model and solution methods are investigated over instances we extracted from the 2020 Honduras migration crisis.
DOI 10.48786/inoc.2022.16
Cilt 2022
Özyeğin Üniversitesi
Özyeğin Üniversitesi yönlendiriliyorsunuz...

Lütfen bekleyiniz.