Path relinking on many-objective NK-landscapes

Authors:
Joseph M. Pasia;Hernán Aguirre;Kiyoshi Tanaka
Affiliations:
Faculty of Engineering, Shinshu University, Nagano, Japan and Institute of Mathematics, University of the Philippines-Diliman, Quezon City, Philippines;Faculty of Engineering, Shinshu University, Nagano, Japan;Faculty of Engineering, Shinshu University, Nagano, Japan
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 4
Cited 1

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
Performance scaling of multi-objective evolutionary algorithms

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Local search guided by path relinking and heuristic bounds

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

A study on adaptive ε-ranking and tabu moves in random one-bit climbers for many-objective optimization

International Journal of Hybrid Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Path relinking is a population-based heuristic that explores the trajectories in decision space between two elite solutions. It has been successfully used as a key component of several multi-objective optimizers, especially for solving bi-objective problems. In this paper, we focus on the behavior of pure path relinking, propose several variants of the path relinking that vary on their selection strategies, and analyze its performance using several many-objective NK-landscapes as instances. The study shows that the path relinking becomes more effective in improving the convergence of the algorithm as the number of objectives increases. It also shows that the selection strategy associated to path relinking plays an important role to emphasize either convergence or spread of the algorithm.