المؤلف
Huang, M., Smilowitz, K. R., Koyuncu, Burcu Balçık
تاريخ النشر
2013-04
مكان النشر
-
Elsevier
الموضوع
Vehicle routing, Continuous approximation, Disaster relief, Needs assessment
النوع
دورية
اللغة
الإنجليزية
رقمي
نعم
مخطوط
لا
المكتبة
جامعة اوزيجين
معرف أصل المكتبة
0191-2615
رقم السجل
df0e5ab7-59ea-441a-b089-60cc06867bca
موقع المكتبة
Industrial Engineering
التاريخ
2013-04
ملاحظات
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
نص عينة
In this paper, we focus on the assessment routing problem which routes teams to different communities to assess damage and relief needs following a disaster. To address time-sensitivity, the routing problem is modeled with the objective of minimizing the sum of arrival times to beneficiaries. We propose a continuous approximation approach which uses aggregated instance data to develop routing policies and cost approximations. Numerical tests are performed that demonstrate the effectiveness of the cost approximations at predicting the true implementation costs of the policies and compare the policies against more complex solution approaches. The continuous approximation approach yields solutions which can be easily implemented; further, this approach reduces the need for detailed data and the computational requirements to solve the problem.
DOI
10.1016/j.trb.2013.01.005
Cilt
50
