The Location-Allocation Problem of Drone Base Stations

Abstract

In this study, we consider the 3D location problem of multiple Drone Base Stations (DBSs) together with the allocation of the resources to serve the users in a wireless communication network. The problem is formulated as a dynamic capacitated single-source location-allocation problem. The capacity of a DBS is a non-linear function of the distance and the amount of resource received from terrestrial base stations. Furthermore, data rate, which is the service level, is a non-linear function of both the distance and the amount of the allocated resource. As a consequence, the optimization model is formulated as a Mixed Integer Non-Linear Program (MINLP), which has a higher complexity compared to many existing problems in the literature. We propose a novel heuristic algorithm for the efficient solution of the problem. The performance of the proposed heuristic is evaluated through an extensive computational study where the MINLP formulation is solved by the BARON solver. Computational results show that the proposed heuristic yields promising performance in terms of both CPU efficiency and solution accuracy. We also provide managerial insights about integrating DBSs into communication networks. (C) 2019 Elsevier Ltd. All rights reserved.