Impact of diversity on bounded archives for multi-objective local search

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Coco, Amadeu A., Borée, Cyprien, Baste, Julien, Jourdan, Laetitia, Mousin, Lucien
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914305817968640
author Coco, Amadeu A.
Borée, Cyprien
Baste, Julien
Jourdan, Laetitia
Mousin, Lucien
author_facet Coco, Amadeu A.
Borée, Cyprien
Baste, Julien
Jourdan, Laetitia
Mousin, Lucien
contents This work tackles two critical challenges related to the development of metaheuristics for Multi-Objective Optimization Problems (MOOPs): the exponential growth of non-dominated solutions and the tendency of metaheuristics to disproportionately concentrate their search on a subset of the Pareto Front. To counteract the first, bounded archives are employed as a strategic mechanism for effectively managing the increasing number of non-dominated solutions. Addressing the second challenge involves an in-depth exploration of solution diversity algorithms found in existing literature. Upon recognizing that current approaches predominantly center on diversity within the objective space, this research introduces innovative methods specifically designed to enhance diversity in the solution space. Results demonstrate the efficacy of the Hamming Distance Archiving Algorithm, one of the newly proposed algorithms for multi-objective local search, surpassing the performance of the Adaptive Grid Archiving and the Hypervolume Archiving, both drawn from the literature. This outcome suggests a promising avenue for enhancing the overall efficiency of metaheuristics employed for solving MOOPs.
format Preprint
id arxiv_https___arxiv_org_abs_2602_04745
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Impact of diversity on bounded archives for multi-objective local search
Coco, Amadeu A.
Borée, Cyprien
Baste, Julien
Jourdan, Laetitia
Mousin, Lucien
Neural and Evolutionary Computing
This work tackles two critical challenges related to the development of metaheuristics for Multi-Objective Optimization Problems (MOOPs): the exponential growth of non-dominated solutions and the tendency of metaheuristics to disproportionately concentrate their search on a subset of the Pareto Front. To counteract the first, bounded archives are employed as a strategic mechanism for effectively managing the increasing number of non-dominated solutions. Addressing the second challenge involves an in-depth exploration of solution diversity algorithms found in existing literature. Upon recognizing that current approaches predominantly center on diversity within the objective space, this research introduces innovative methods specifically designed to enhance diversity in the solution space. Results demonstrate the efficacy of the Hamming Distance Archiving Algorithm, one of the newly proposed algorithms for multi-objective local search, surpassing the performance of the Adaptive Grid Archiving and the Hypervolume Archiving, both drawn from the literature. This outcome suggests a promising avenue for enhancing the overall efficiency of metaheuristics employed for solving MOOPs.
title Impact of diversity on bounded archives for multi-objective local search
topic Neural and Evolutionary Computing
url https://arxiv.org/abs/2602.04745