Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem

Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem

The maximum diversity problem (MDP) aims to select a subset with a predetermined number of elements from a given set, maximizing the diversity among them. This NP-hard problem requires efficient algorithms that can generate high-quality solutions within reasonable computational time. In this study,...

Full description

Bibliographic Details
Main Authors: Geiza Silva, André Leite, Raydonal Ospina, Víctor Leiva, Jorge Figueroa-Zúñiga, Cecilia Castro
Format: Article
Language:English
Published: MDPI AG 2023-07-01
Series:Mathematics
Subjects:
biological diversity conservation
evolutionary algorithms
computational simulations
random-key genetic algorithm
Online Access:https://www.mdpi.com/2227-7390/11/14/3072

Internet

https://www.mdpi.com/2227-7390/11/14/3072

Similar Items