Sectorization problems have significant challenges arising from the many objectives that must be optimised simultaneously. Several methods exist to deal with these many-objective optimisation problems, but each has its limitations. This paper analyses an application of Preference Inspired Co-Evolutionary Algorithms, with goal vectors (PICEA-g) to sectorization problems. The method is tested on instances of different size difficulty levels and various configurations for mutation rate and population number. The main purpose is to find the best configuration for PICEA-g to solve sectorization problems. Performance metrics are used to evaluate these configurations regarding the solutions’ spread, convergence, and diversity in the solution space. Several test trials showed that big and medium-sized instances perform better with low mutation rates and large population sizes. The opposite is valid for the small size instances.
An Application of Preference-Inspired Co-Evolutionary Algorithm to Sectorization
Lect.Notes Mechanical Engineering
International Conference Innovation in Engineering ; 2022 ; Minho, Portugal June 28, 2022 - June 30, 2022
2022-06-21
12 pages
Article/Chapter (Book)
Electronic Resource
English
Contributions to Airspace Sectorization
Wiley | 2013
|Airspace Sectorization by Dynamic Density
AIAA | 2009
|Airspace Sectorization by Dynamic Density
British Library Conference Proceedings | 2009
|Future Airspace Design by Dynamic Sectorization
British Library Conference Proceedings | 2019
|Efficient Air Traffic Management without Sectorization
British Library Conference Proceedings | 2009
|