A robust optimization approach to volunteer management in humanitarian crises

被引:45
作者
Lassiter, Kyle [1 ]
Khademi, Amin [1 ]
Taaffe, Kevin M. [1 ]
机构
[1] Clemson Univ, Dept Ind Engn, Clemson, SC 29631 USA
关键词
Volunteer management model; Humanitarian relief organization; Volunteer training; Humanitarian crisis scenarios; Robust optimization; NETWORK FLOW MODEL; EVACUATION; LOGISTICS;
D O I
10.1016/j.ijpe.2015.02.018
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In the aftermath of a disaster, humanitarian organizations quickly assemble a workforce that can immediately serve a community's needs. However, these needs change over time, and the volunteer base (and their skill sets) also changes over time. In this paper, we develop a flexible optimization framework to dynamically allocate volunteers in order to minimize the cumulative unmet demand and maximize volunteers' preference. We use a robust optimization approach to handle the uncertainty in task demands because in the scenarios of interest it is unlikely that demand distributions are available for decision makers. We consider maximizing volunteers' preference by introducing a constraint into the model which enables decision makers to derive Pareto optimality and allocation decisions for any degree of conservativeness. Our numerical results show that volunteer managers should consider matching volunteers to their task assignment preferences up to a critical percentage, above which needs fulfillment decrease quickly due to overly strict adherence to volunteer task assignment preferences. Moreover, one can estimate the complete price of volunteers' preference by a difference between the objective function when the matching threshold is 1 and 0. Our sensitivity analyses shed light on the effect of conservativeness in the objective function and allocation decisions as well as the model's tractability. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:97 / 111
页数:15
相关论文
共 36 条
  • [1] [Anonymous], 2011, Approximate Dynamic Programming: Solving the Curses of Dimensionality
  • [2] [Anonymous], 2013, Annual Report
  • [3] Last mile distribution in humanitarian relief
    Balcik, Burcu
    Beamon, Benita M.
    Smilowitz, Karen
    [J]. JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2008, 12 (02) : 51 - 63
  • [4] A two-stage stochastic programming framework for transportation planning in disaster response
    Barbarosoglu, G
    Arda, Y
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (01) : 43 - 53
  • [5] The task assignment problem for unrestricted movement between workstation groups
    Bard, JF
    Wan, L
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (04) : 315 - 341
  • [6] Beamon B.M., 2006, INT J LOGIST-RES APP, V9, P1, DOI DOI 10.1080/13675560500453667
  • [7] Robust convex optimization
    Ben-Tal, A
    Nemirovski, A
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) : 769 - 805
  • [8] BenTal A, 2009, PRINC SER APPL MATH, P1
  • [9] Robust discrete optimization and network flows
    Bertsimas, D
    Sim, M
    [J]. MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) : 49 - 71
  • [10] Theory and Applications of Robust Optimization
    Bertsimas, Dimitris
    Brown, David B.
    Caramanis, Constantine
    [J]. SIAM REVIEW, 2011, 53 (03) : 464 - 501