TY - JOUR
T1 - Drone logistics for uncertain demand of disaster-impacted populations
AU - Ghelichi, Zabih
AU - Gentili, Monica
AU - Mirchandani, Pitu B.
N1 - Funding Information:
This work has been partially supported by the Logistics and Distribution Institute at the University of Louisville.
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/8
Y1 - 2022/8
N2 - The paper introduces a stochastic optimization-based approach to address the logistics for the timely delivery of aid packages to disaster-affected areas utilizing a fleet of drones when the set of demand points is unknown. The major problem addressed is to locate a set of drone take-off platforms so that with a specified probability α, the maximum total disutility (or cost) under all realizations of the demand locations is minimized. A set of discrete scenarios defines the uncertainty set of the demand points. A Chance Constrained Programming (CCP) formulation is developed to select a set of platform locations whose disutility distribution produces minimum α percentile. For each platform location set, and each demand scenario, the total disutility is defined as the total delivery time for serving the demand points plus a penalty for unvisited demand points. For every set of drone platform locations, referred to as a candidate combination of platforms, the resultant disutility distribution is obtained by solving a space-time drone scheduling subproblem for all possible demand scenarios. The drone scheduling subproblem optimally schedules and sequences a set of trips for each drone so that the total disutility is minimized. Owing to the computational complexity of the proposed approach, an approximation method is developed that decomposes the problem into three tractable stages. The first stage identifies a set of most preferable platform combinations. The second stage develops an approximation algorithm based on a greedy approach to mitigate the extensive computational requirements for solving the large number of drone scheduling subproblems. The last stage builds upon the properties of a Sample Average Approximation (SAA) method and of the CCP formulation to select the optimum set of platforms. Finally, the performance of the proposed stochastic approach is evaluated through a series of computational experiments and a case study of Central Florida. The results reveal interesting insights and demonstrate the effectiveness of the proposed logistics system for drone delivery of humanitarian aid packages.
AB - The paper introduces a stochastic optimization-based approach to address the logistics for the timely delivery of aid packages to disaster-affected areas utilizing a fleet of drones when the set of demand points is unknown. The major problem addressed is to locate a set of drone take-off platforms so that with a specified probability α, the maximum total disutility (or cost) under all realizations of the demand locations is minimized. A set of discrete scenarios defines the uncertainty set of the demand points. A Chance Constrained Programming (CCP) formulation is developed to select a set of platform locations whose disutility distribution produces minimum α percentile. For each platform location set, and each demand scenario, the total disutility is defined as the total delivery time for serving the demand points plus a penalty for unvisited demand points. For every set of drone platform locations, referred to as a candidate combination of platforms, the resultant disutility distribution is obtained by solving a space-time drone scheduling subproblem for all possible demand scenarios. The drone scheduling subproblem optimally schedules and sequences a set of trips for each drone so that the total disutility is minimized. Owing to the computational complexity of the proposed approach, an approximation method is developed that decomposes the problem into three tractable stages. The first stage identifies a set of most preferable platform combinations. The second stage develops an approximation algorithm based on a greedy approach to mitigate the extensive computational requirements for solving the large number of drone scheduling subproblems. The last stage builds upon the properties of a Sample Average Approximation (SAA) method and of the CCP formulation to select the optimum set of platforms. Finally, the performance of the proposed stochastic approach is evaluated through a series of computational experiments and a case study of Central Florida. The results reveal interesting insights and demonstrate the effectiveness of the proposed logistics system for drone delivery of humanitarian aid packages.
KW - Chance constrained optimization
KW - Drone delivery
KW - Humanitarian logistics
KW - Stochastic optimization
UR - http://www.scopus.com/inward/record.url?scp=85131827074&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85131827074&partnerID=8YFLogxK
U2 - 10.1016/j.trc.2022.103735
DO - 10.1016/j.trc.2022.103735
M3 - Article
AN - SCOPUS:85131827074
SN - 0968-090X
VL - 141
JO - Transportation Research Part C: Emerging Technologies
JF - Transportation Research Part C: Emerging Technologies
M1 - 103735
ER -