Skip to Main content Skip to Navigation
Conference papers

UAV Set Covering Problem for Emergency Network

Abstract : Recent technology allows UAVs to be implemented not only in fields of military, videography, or logistics but also in a social security area, especially for disaster management. UAVs can mount a router and provide a wireless network to the survivors in the network-shadowed area. In this paper, a set covering problem reflecting the characteristics of UAV is defined with a mathematical formulation. An extended formulation and branch-and-price algorithm are proposed for efficient computation. We demonstrated the capability of the proposed algorithm with a computational experiment.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-02460476
Contributor : Hal Ifip <>
Submitted on : Thursday, January 30, 2020 - 10:13:54 AM
Last modification on : Thursday, January 30, 2020 - 10:22:51 AM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Youngsoo Park, Ilkyeong Moon. UAV Set Covering Problem for Emergency Network. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2019, Austin, TX, United States. pp.84-90, ⟨10.1007/978-3-030-29996-5_10⟩. ⟨hal-02460476⟩

Share

Metrics

Record views

87