Genetic Heuristic for Search Space Exploration
Abstract
This paper deals with the way dual genetic algorithms (dga), an extension of the standard ones, explore the search space. After a brief introduction presenting genetic algorithms and dualism, the fitness distance correlation is discussed in the context of dualism. From this discussion, a conjecture is made about the genetic heuristic used by dual genetic algorithms to explore the search space. This conjecture is reinforced by the visualization of the population centroid trajectories in the plane fitness distance. These trajectories help to point out "leg-up" behaviors, which allow the dual genetic algorithm to reach the global optimum from walks on deceptive paths. 1 Introduction 1.1 Genetic algorithms Genetic algorithms are adaptive systems inspired from Darwin's theories on natural evolution. Their fundamental bases were defined twenty five years ago by Holland ( [ Holland, 1975 ] ) in his book on natural and artificial adaptation. Much works have been done since, i...
Cite
Text
Clergue and Collard. "Genetic Heuristic for Search Space Exploration." International Joint Conference on Artificial Intelligence, 1999.Markdown
[Clergue and Collard. "Genetic Heuristic for Search Space Exploration." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/clergue1999ijcai-genetic/)BibTeX
@inproceedings{clergue1999ijcai-genetic,
title = {{Genetic Heuristic for Search Space Exploration}},
author = {Clergue, Manuel and Collard, Philippe},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1999},
pages = {1218-1226},
url = {https://mlanthology.org/ijcai/1999/clergue1999ijcai-genetic/}
}