Genetic Heuristic for Search Space Exploration
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Search. Pages 1218-1225.
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, th e fitness distance correlation is discussed in the context of dualism. From this discussion , a conjecture is mad e about the gen et ic heuri st ic used by dual genetic algorithms to explore the search space. This conjecture is reinforced by the visualization of the population centroid traje ct ories in the plane fitness distance. Th ese trajectories help to point out "leg-up" behaviors, which allow the dual gen et ic algorithm to reach the global optimum from walks on deceptive p aths .
@inproceedings{ijcai1999p173,
title = {Genetic Heuristic for Search Space Exploration},
author = {Clergue, Manuel and Collard, Philippe},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1218--1225},
year = {1999},
note = {Search},
url = {https://ijcai.org/proceedings/1999/173},
}
TY - CPAPER TI - Genetic Heuristic for Search Space Exploration AU - Clergue, Manuel AU - Collard, Philippe T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1218 EP - 1225 UR - https://ijcai.org/proceedings/1999/173 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
