Nearest-Better Network for Fitness Landscape Analysis of Continuous Optimization Problems
Fitness landscape analysis (FLA) is quite important in evolutionary computation. In this article, we propose a novel FLA method, the nearest-better network (NBN), which uses the nearest-better relationship to simplify the original fitness landscape of continuous optimization problems. We introduce an efficient algorithm to calculate NBN for continuous problems. We also propose four numerical measurements and a 3-D visualization method based on NBN. Experiments show that compared to the other main FLA methods, the four numerical measurements proposed here can effectively measure the four intended features: 1) neutrality; 2) ruggedness; 3) modality; and 4) Basin of Attraction, respectively, and common features of the fitness landscape can be maintained in 3-D NBN visualization, regardless of the scale of the problem. NBN also provides a view of how algorithms search in high-dimensional problems with the help of the 3-D NBN visualization.
Authors
- Shengxiang Yang (ORCID: https://orcid.org/0000-0001-7222-4917)
- Yiya Diao (ORCID: https://orcid.org/0000-0002-1685-7469)
- Sanyou Zeng (ORCID: https://orcid.org/0000-0002-0795-9092)
- Carlos A. Coello Coello (ORCID: https://orcid.org/0000-0002-8435-680X)
- Changhe Li (ORCID: https://orcid.org/0000-0001-9222-0702)
Institutions
- Anhui University (CN)
- China University of Geosciences (CN)
- De Montfort University (GB)
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional (MX)
Publication Details
- Journal
- IEEE Transactions on Evolutionary Computation
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/tevc.2024.3478825
- Citations
- 2
- Primary Topic
- Traffic Prediction and Management Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.53
Funders
- National Natural Science Foundation of China