Metaheuristic Algorithms for UAV Trajectory Optimization in Mobile Networks

被引:0
作者
Cacchiani, Valentina [1 ]
Ceschia, Sara [2 ]
Mignardi, Silvia [1 ]
Buratti, Chiara [1 ]
机构
[1] Univ Bologna, DEI, Viale Risorgimento 2, I-40136 Bologna, Italy
[2] Univ Udine, DPIA, Via Sci 206, I-33100 Udine, Italy
来源
METAHEURISTICS, MIC 2022 | 2023年 / 13838卷
关键词
Unmanned aerial vehicles; Mobile networks; Genetic algorithm; Local search; Simulated annealing; AERIAL VEHICLES UAVS; COMMUNICATION; DESIGN;
D O I
10.1007/978-3-031-26504-4_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider a mobile network in which traditional static terrestrial base stations are not capable of completely serving the existing user demand, due to the huge number of connected devices. In this setting, an equipped Unmanned Aerial Vehicle (UAV) can be employed to provide network connection where needed in a flexible way, thereby acting as an unmanned aerial base station. The goal is to determine the best UAV trajectory in order to serve as many users as possible. The UAV can move at different speeds and can serve users within its communication range, although the data rate depends on the positions of UAV and users. In addition, each user has a demand (e.g., the number of bits the user wants to download/upload from/to the network) and a time window during which requires the service. We propose a Biased Random-Key Genetic Algorithm (BRKGA) and a Simulated Annealing Algorithm (SAA), and compare them on realistic instances with more than 500 users in different settings.
引用
收藏
页码:30 / 44
页数:15
相关论文
共 24 条
[1]   The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications [J].
Andrade, Carlos E. ;
Toso, Rodrigo F. ;
Goncalves, Jose F. ;
Resende, Mauricio G. C. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (01) :17-30
[2]  
[Anonymous], 2010, Experimental Methods for the Analysis of Optimization Algorithms
[3]   Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem [J].
Ceschia, Sara ;
Di Gaspero, Luca ;
Rosati, Roberto Maria ;
Schaerf, Andrea .
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2022, 10
[4]   EASYLOCAL++: an object-oriented framework for the flexible design of local-search algorithms [J].
Di Gaspero, L ;
Schaerf, A .
SOFTWARE-PRACTICE & EXPERIENCE, 2003, 33 (08) :733-765
[5]   Revisiting simulated annealing: A component-based analysis [J].
Franzin, Alberto ;
Stutzle, Thomas .
COMPUTERS & OPERATIONS RESEARCH, 2019, 104 :191-206
[6]   Biased random-key genetic algorithms for combinatorial optimization [J].
Goncalves, Jose Fernando ;
Resende, Mauricio G. C. .
JOURNAL OF HEURISTICS, 2011, 17 (05) :487-525
[7]   Orienteering Problem: A survey of recent variants, solution approaches and applications [J].
Gunawan, Aldy ;
Lau, Hoong Chuin ;
Vansteenwegen, Pieter .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (02) :315-332
[8]  
Hammersley JM., 1964, Methuen's monographs on applied probability and statistics
[9]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[10]   Unmanned Aerial Base Stations for NB-IoT: Trajectory Design and Performance Analysis [J].
Mignardi, Silvia ;
Mikhaylov, Konstantin ;
Cacchiani, Valentina ;
Verdone, Roberto ;
Buratti, Chiara .
2020 IEEE 31ST ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (IEEE PIMRC), 2020,