Genetic algorithms and their testing

DOI10.1063/1.58247zbMATH Open1308.68106OpenAlexW2008788717MaRDI QIDQ3022151FDOQ3022151

Authors: Jiří Kubalík, Jiri Lazansky 

Publication date: 22 June 2005

Published in: The second international conference on computing anticipatory systems, CASYS’98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.58247

Recommendations

• scientific article; zbMATH DE number 710383
• scientific article; zbMATH DE number 4104744
• scientific article; zbMATH DE number 2014469
• On benchmarking functions for genetic algorithms
• scientific article; zbMATH DE number 1857678

zbMATH Keywords

genetic algorithmsdeceptioninitialisationsearch space

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (5)

• A test of genetic algorithms in relevance feedback
• Title not available (Why is that?)
• An Experimental Study of Benchmarking Functions for Genetic Algorithms
• On benchmarking functions for genetic algorithms
• Test driving three 1995 genetic algorithms: New test functions and geometric matching

This page was built for publication: Genetic algorithms and their testing

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