Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 119, Issue -, Pages -Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2020.104936
Keywords
Disaster management; Emergency wireless network; Unmanned aerial vehicle; Set covering problem; Branch-and-price
Categories
Funding
- National Research Foundation of Korea (NRF) - Ministry of Science, ICT & Future Planning [NRF-2019R1A2C2084616]
Ask authors/readers for more resources
This paper models the problem of providing an unmanned aerial vehicle (UAV)-based wireless network in a disaster area as a set covering problem that takes into consideration the operational constraints and benefits of UAVs. The research presents a branch-and-price algorithm and two approximation models of the quadratic coverage radius constraint in a simple discretization and a linear pairwise-conflict constraint based on Jung's theorem. In computational experiments, we found that the exact branch-and-price algorithm and two approximation models are applicable for realistic-scaled problems with up to 100 demand points and 2,000 m of coverage radius. (C) 2020 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available