Hyperheuristics for a Dynamic-Mapped Multi-Objective Island-Based Model

Authors:
Coromoto León;Gara Miranda;Carlos Segura
Affiliations:
Dpto. Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain 38271;Dpto. Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain 38271;Dpto. Estadística, I.O. y Computación, Universidad de La Laguna, La Laguna, Spain 38271
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Year:
2009

Citing 6
Cited 1

Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Statistical Comparisons of Classifiers over Multiple Data Sets

The Journal of Machine Learning Research
Handbook of Parametric and Nonparametric Statistical Procedures

Handbook of Parametric and Nonparametric Statistical Procedures
A scalable multi-objective test problem toolkit

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Considerations in engineering parallel multiobjective evolutionary algorithms

IEEE Transactions on Evolutionary Computation

A multi-objective hyper-heuristic based on choice function

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a set of improvements and a performance analysis for a previously designed multi-objective optimisation parallel model. The model is a hybrid algorithm that combines a parallel island-based scheme with a hyperheuristic approach in order to grant more computational resources to those schemes that show a more promising behaviour. The main aim is to raise the level of generality at which most current evolutionary algorithms operate. This way, a wider range of problems can be tackled since the strengths of one algorithm can compensate for the weaknesses of another. A contribution-based hyperheuristic previously presented in the literature is compared with a novel hypervolume-based hyperheuristic. The computational results obtained for some tests available in the literature demonstrate the superiority of the hypervolume-based hyperheuristic when compared to the contribution-based hyperheuristic and to other standard parallel models.