Publication
Title
Higher epistasis in genetic algorithms
Author
Abstract
We study the k-epistasis of a fitness function over a search space. This concept is a natural generalization of that of epistasis, previously considered by Davidor, Suys and Verschoren and Van Hove and Verschoren [Y.Davidor, in: Foundations of genetic algorithms, Vol. 1, (1991), pp. 2325; D. Suys and A. Verschoren, Proc Int. Conf. on Intelligent Technologies in Human-Related Sciences (ITHURS96), Vol. II (1996), pp. 251258; H. Van Hove and A. Verschoren ,Comput. Artificial Intell. 14 (1994), 271277], for example. We completely characterize fitness functions whose k-epistasis is minimal: these are exactly the functions of order k. We also obtain an upper bound for the k-epistasis of nonnegative fitness functions.
Language
English
Source (journal)
Bulletin of the Australian Mathematical Society. - Brisbane
Publication
Brisbane : 2008
ISSN
0004-9727
Volume/pages
77:2(2008), p. 225-243
ISI
000257504100004
Full text (Publisher's DOI)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 25.05.2009
Last edited 16.09.2017
To cite this reference