Por favor, use este identificador para citar o enlazar este ítem:
http://cimat.repositorioinstitucional.mx/jspui/handle/1008/630| Improved MaxiMin Selection for Well Spread Pareto Fronts | |
| SERGIO IVVAN VALDEZ PEÑA | |
| Acceso Abierto | |
| Atribución-NoComercial | |
| Algorítmos | |
| An algorithm to achieve maximal spread and almost perfectly distributed Pareto fronts is presented. The MaxiMin algorithm add points to the archive of selected individuals one by one, each point which is added maximizes the distance from the current selected points. This method is independent of the evolutionary operators used to perform the search. This work explains how to combine the MaxiMin selection with state of the art multi-objective algorithms, such as NSGA-II, SPEA2, and DEMO. Experiments were ran with and without MaxiMin for comparison purposes. ε -MOEA is used as reference. Performance metrics and graphical results are shown for comparison. | |
| Centro de Investigación en Matemáticas AC | |
| 16-02-2007 | |
| Reporte | |
| Inglés | |
| Investigadores | |
| LENGUAJES ALGORÍTMICOS | |
| Versión publicada | |
| publishedVersion - Versión publicada | |
| Aparece en las colecciones: | Reportes Técnicos - Ciencias de la Computación |
Cargar archivos:
| Fichero | Tamaño | Formato | |
|---|---|---|---|
| I-07-02.pdf | 564.9 kB | Adobe PDF | Visualizar/Abrir |