The Problem of Locating and Routing Unmanned Aerial Vehicles

Abstract

In this chapter, locating and routing of a UAV fleet is discussed. Since the research in the location and routing of UAVs is very limited, the related problems are reviewed. A basic problem and its extended version found in the literature are redefined along with their MILP formulation. Both of the problems are characterized by a prize collecting objective function and a homogeneous fleet of fixed number of UAVs based on naval platforms. The aim is described as maximization of the collected importance value associated to interest points. A solution method that is based on ACO is discussed. The usage of this robust method for both the basic and the extended versions of the problem is explained. The improvement room in the present solution method and future research directions are also discussed.