Using reliability analysis to estimate the number of generations to convergence in genetic algorithms
From MaRDI portal
Publication:685512
DOI10.1016/0020-0190(93)90027-7zbMath0776.68100OpenAlexW2029246659MaRDI QIDQ685512
D. Ghosh Dastidar, Uday Kumar Chakraborty
Publication date: 17 October 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90027-7
Related Items (5)
A branching process model for genetic algorithms ⋮ The multifactor nature of the volatility of futures markets ⋮ Metaheuristics: A bibliography ⋮ A simpler derivation of schema hazard in genetic algorithms ⋮ Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem
Cites Work
This page was built for publication: Using reliability analysis to estimate the number of generations to convergence in genetic algorithms
