3-D dynamic UAV base station location problem

DOI10.1287/IJOC.2020.1034MaRDI QIDQ5085461zbMATHOpenAlexFDO

Authors Cihan Tugrul Cicek, Hakan Gultekin, Bulent Tavli, Zuo-Jun (Max) Shen

Publication date 27 June 2022

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.04909

zbMATH Keywords

nonlinear optimizationcontinuum approximationdynamic locationLagrangean decompositionUAV base station

Mathematics Subject Classification ID

Nonlinear programming (90C30) Mixed integer programming (90C11) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Abstract: We address a dynamic covering location problem of an Unmanned Aerial Vehicle Base Station (UAV-BS), where the location sequence of a single UAV-BS in a wireless communication network is determined to satisfy data demand arising from ground users. This problem is especially relevant in the context of smart grid and disaster relief. The vertical movement ability of the UAV-BS and non-convex covering functions in wireless communication restrict utilizing classical planar covering location approaches. Therefore, we develop new formulations to this emerging problem for a finite time horizon to maximize the total coverage. In particular, we develop a mixed-integer non-linear programming formulation which is non-convex in nature, and propose a Lagrangean Decomposition Algorithm (LDA) to solve this formulation. Due to high complexity of the problem, the LDA is still unable to find good local solutions to large-scale problems. Therefore, we develop a Continuum Approximation (CA) model and show that CA would be a promising approach in terms of both computational time and solution accuracy. Our numerical study also shows that the CA model can be a remedy to build efficient initial solutions for exact solution algorithms.

Recommendations

• The location-allocation problem of drone base stations
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
• Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue
• Location coverage models with demand originating from nodes and paths: Application to cellular network design
• Modelling the mobile target covering problem using flying drones

Cites work

• A continuous model for production-distribution system design
• Ambulance location and relocation models.
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• DC programming: overview.
• Generalized coverage: new developments in covering location models
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• Reliable facility location design under the risk of disruptions
• The location-allocation problem of drone base stations

Cited in

(5)

• The location-allocation problem of drone base stations
• The role of drones in disaster response: a literature review of operations research applications
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
• Scalable vertiport hub location selection for air taxi operations in a metropolitan region
• Facility location decisions for drone delivery: a literature review

This page was built for publication: 3-D dynamic UAV base station location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085461)