Problem-independent schema synthesis for genetic algorithms

DOI10.1007/3-540-45105-6_120MaRDI QIDQ4436940zbMATH OpenFDO

Authors Yong-Hyuk Kim, Yung-Keun Kwon, Byung-Ro Moon

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27231112.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1488084
• Isomorphisms of genetic algorithms
• Ordering genetic algorithm genomes with reconstructability analysis
• Reconstructability analysis detection of optimal gene order in genetic algorithms
• Genetic algorithm based on schema comparison

Cited in

(3)

• Moving clusters within a memetic algorithm for graph partitioning
• A mathematical design of genetic operators on \(\mathrm{GL}_n(\mathbb Z_2)\)
• Genetic algorithm based on schema comparison

This page was built for publication: Problem-independent schema synthesis for genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436940)