UAV Set Covering Problem for Emergency Network - Advances in Production Management Systems
Conference Papers Year : 2019

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.
Fichier principal
Vignette du fichier
489108_1_En_10_Chapter.pdf (213.64 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02460476 , version 1 (30-01-2020)

Licence

Identifiers

Cite

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⟩
84 View
60 Download

Altmetric

Share

More