Akademik Veri Yönetim Sistemi
INFORMS Annual Meeting 2024, Washington, Amerika Birleşik Devletleri, 20 - 23 Ekim 2024, ss.82
Recently, drones have gained popularity in the fields of delivery, logistics, and surveillance operations. Researchers have focused on route planning to improve the effectiveness of drones in these fields. While several studies have been conducted on drone routing, a substantial percentage of them have addressed this problem as node-based routing. Only a small number of studies in the literature define this problem as edge-based routing. This study describes an edge-based drone routing problem by taking surveillance drones into account. In this case, there are multiple depots and more than one drone in each depot. Drones have limited energy capacity and must perform edge monitoring operations with their limited energy capacity. The objective of this problem is to obtain optimal drone routes that minimize the total distance traveled. However, it is not mandatory to use all the depots in the problem. Therefore, in addition to getting the optimal drone routes, it is necessary to determine which depots to use. We refer to this problem as the Multi-Depot Drone Arc Routing Problem. We developed a mixed-integer mathematical model to obtain the optimal solution to this challenging problem. Furthermore, we used a metaheuristic algorithm to handle especially large-sized problems in reasonable computation time. The algorithm's local search operators were specifically tailored to the problem. Real test problems of different sizes were generated in order to evaluate the performance of these solution methods. A comprehensive analysis of the computational results is presented.