Akademik Veri Yönetim Sistemi
Transportation Letters, 2026 (SCI-Expanded, SSCI, Scopus)
This paper deals with the maximum coverage facility location problem with drones. The problem can be defined as determining the locations of facilities with known capacities to maximize customer service coverage within specific drone range constraints. In order to tackle the complex structure of the problem, we develop a hybrid hyper-heuristic algorithm that combines a greedy constructive heuristic with an adaptive simulated annealing framework including six distinct neighborhood operators. We conduct extensive computational experiments on benchmark instances from the literature and compare the performance of the algorithm with state-of-the-art methods. We also perform sensitivity analyses to evaluate the effects of the cooling schedule, selection function, neighborhood structures, initial temperature and cooling ratio. The results show that the algorithm effectively solves the problem, achieving superior maximum and average coverage while finding new best solutions within reasonable computational times.