Abstract
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.
Original language | English |
---|---|
Article number | 104936 |
Journal | Computers and Operations Research |
Volume | 119 |
ISSN | 0305-0548 |
DOIs | |
Publication status | Published - Jul 2020 |
Keywords
- Branch-and-price
- Disaster management
- Emergency wireless network
- Set covering problem
- Unmanned aerial vehicle