Huang, M.Smilowitz, K. R.Koyuncu, Burcu Balçık2014-07-072014-07-072013-040191-2615http://hdl.handle.net/10679/457https://doi.org/10.1016/j.trb.2013.01.005Due 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.engrestrictedAccessarticle50204100031780320000210.1016/j.trb.2013.01.005Vehicle routingContinuous approximationDisaster reliefNeeds assessment2-s2.0-84874422734