A decomposition based metaheuristic approach for solving rapid needs assessment routing problem

Name: A decomposition based metaheuristic approach for solving rapid needs assessment routing problem
Author: Mıhçıoğlu, Yurtsev, Albey, Erinç

İsim	A decomposition based metaheuristic approach for solving rapid needs assessment routing problem
Yazar	Mıhçıoğlu, Yurtsev, Albey, Erinç
Basım Tarihi:	2021-09
Basım Yeri	- Elsevier
Konu	Routing, Site selection, Needs assessment, Tabu search, Decomposition
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0360-8352
Kayıt Numarası	67a6c434-bdce-4a01-b1ae-57982aaa0798
Lokasyon	Industrial Engineering
Tarih	2021-09
Örnek Metin	This paper proposes a decomposition based tabu search algorithm for solving multi-cover routing problem in the case of rapid need assessment. Rapid needs assessment aims to evaluate impact of a disaster at different sites to determine the needs of different community groups. Since the assessment process during a disaster is time critical, the focus in this paper is given to developing a solution approach, which aims to find high quality solutions in short period of time. The proposed algorithm focuses on a three-stage decomposition, where stages involve site selection, team assignment and routing of teams. Performance of the proposed algorithm is evaluated with respect to benchmark algorithms under different instances. The results indicate that the proposed algorithm can achieve high-quality solutions expeditiously, providing better results, on the average, when compared to the best-known solution approaches in the literature.
DOI	10.1016/j.cie.2021.107528
Cilt	159

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

A decomposition based metaheuristic approach for solving rapid needs assessment routing problem

Yazar Mıhçıoğlu, Yurtsev, Albey, Erinç

Basım Tarihi 2021-09

Basım Yeri - Elsevier

Konu Routing, Site selection, Needs assessment, Tabu search, Decomposition

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0360-8352

Kayıt Numarası 67a6c434-bdce-4a01-b1ae-57982aaa0798

Lokasyon Industrial Engineering

Tarih 2021-09

Örnek Metin This paper proposes a decomposition based tabu search algorithm for solving multi-cover routing problem in the case of rapid need assessment. Rapid needs assessment aims to evaluate impact of a disaster at different sites to determine the needs of different community groups. Since the assessment process during a disaster is time critical, the focus in this paper is given to developing a solution approach, which aims to find high quality solutions in short period of time. The proposed algorithm focuses on a three-stage decomposition, where stages involve site selection, team assignment and routing of teams. Performance of the proposed algorithm is evaluated with respect to benchmark algorithms under different instances. The results indicate that the proposed algorithm can achieve high-quality solutions expeditiously, providing better results, on the average, when compared to the best-known solution approaches in the literature.

DOI 10.1016/j.cie.2021.107528

Cilt 159