Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
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, the authors 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.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/1793974
-
Supplemental Notes:
- © 2020 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
-
Authors:
- Park, Youngsoo
- Nielsen, Peter
- Moon, Ilkyeong
-
0000-0002-7072-1351
- Publication Date: 2020-7
Language
- English
Media Info
- Media Type: Web
- Features: Appendices; Figures; References; Tables;
- Pagination: 104936
-
Serial:
- Computers & Operations Research
- Volume: 119
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0305-0548
- Serial URL: https://www.sciencedirect.com/journal/computers-and-operations-research
Subject/Index Terms
- TRT Terms: Branch and bound algorithms; Drones; Emergency communication systems; Unmanned aircraft systems; Wireless communication systems
- Subject Areas: Aviation; Data and Information Technology; Security and Emergencies;
Filing Info
- Accession Number: 01839771
- Record Type: Publication
- Files: TRIS
- Created Date: Mar 24 2022 3:24PM