Improvement in the performance of island based genetic algorithms through path relinking

Authors:
Luis delaOssa;José A. Gámez;José M. Puerta
Affiliations:
Intelligent Systems and Data Mining Group, Computer Systems Department, University of Castilla-La Mancha, Albacete, Spain;Intelligent Systems and Data Mining Group, Computer Systems Department, University of Castilla-La Mancha, Albacete, Spain;Intelligent Systems and Data Mining Group, Computer Systems Department, University of Castilla-La Mancha, Albacete, Spain
Venue:
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Year:
2006

Citing 11
Cited 0

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Scatter search and path relinking

New ideas in optimization
Efficient and Accurate Parallel Genetic Algorithms

Efficient and Accurate Parallel Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An Analysis of Synchronous and Asynchronous Parallel Distributed Genetic Algorithms with Structured and Panmictic Islands

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Island Model genetic Algorithms and Linearly Separable Problems

Selected Papers from AISB Workshop on Evolutionary Computing
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model

Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
A path relinking algorithm for the generalized assignment problem

Metaheuristics
The influence of migration sizes and intervals on island models

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Are multiple runs of genetic algorithms better than one?

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Quantified Score

Hi-index	0.00

Visualization

Abstract

In island based genetic algorithms, the population is splitted into subpopulations which evolve independently and ocasionally communicate by sending some individuals. This way, several zones of the landscape are explored in parallel and solutions with different features can be discovered. The interchange of information is a key point for the performance of these algorithms, since the combination of those solutions usually produces better ones. In this work, it is proposed a method based in path relinking which makes the combination process more effective.