L. Amorosi, J. Puerto, C. Valverde Martín
This paper considers the optimization problems that arise to coordinate a tandem between a mothership vehicle and a fleet of drones. Each drone can be launched from the mothership to perform an operation. After completing the operations, the drones return to the mothership to recharge the batteries and to be ready for a new operation. Operations consist on (partially) visiting graphs with a given length to deliver some services or to perform some surveillance/inspection activity. The goal is to minimize the overall time of travelling made by the mothership while satisfying some requirements in terms of fractions
of visits to the target graphs. In all cases, we develop exact formulations resorting to mixed integer second-order cone programs that are compared on a testbed of instances to assess their performance. We also develop a matheuristic algorithm that provides reasonable solutions. Computational experiments show the usefulness of our methodology in different scenarios.
Palabras clave: Arc Routing Problems, Networks, Drones, Conic Programming
Programado
GT01 Localización II. Diseño de Redes
7 de junio de 2022 18:40
A15
