期刊
COMPUTERS & OPERATIONS RESEARCH
卷 119, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2020.104936
关键词
Disaster management; Emergency wireless network; Unmanned aerial vehicle; Set covering problem; Branch-and-price
类别
资金
- National Research Foundation of Korea (NRF) - Ministry of Science, ICT & Future Planning [NRF-2019R1A2C2084616]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据