Improved time complexity analysis of the simple genetic algorithm
type: Item
instance of: scholarly article
title: Improved time complexity analysis of the simple genetic algorithm
zbMATH Open document ID: 1330.68120
author: Pietro S. Oliveto
author: Carsten Witt
published in: Theoretical Computer Science
publication date: 2015-10-30T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6502576
zbMATH Keywords: simple genetic algorithm
zbMATH Keywords: crossover
zbMATH Keywords: runtime analysis
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.01.002
OpenAlex ID: W2082931571
Wikidata QID: Q57200573
cites work: Q5306039
cites work: Optimizing expected path lengths with ant colony optimization using fitness proportional update
cites work: Q5624436
cites work: Q4692508
cites work: Hitting-time and occupation-time bounds implied by drift analysis with applications
cites work: Analyzing evolutionary algorithms. The computer science perspective.
cites work: Real royal road functions -- where crossover provably is essential
cites work: Black-box search by unbiased variation
cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
cites work: Simplified drift analysis for proving lower bounds in evolutionary computation
cites work: On the runtime analysis of the simple genetic algorithm
cites work: Probability with Martingales
DOI: 10.1016/J.TCS.2015.01.002
DBLP publication ID: journals/tcs/OlivetoW15
description: scientific article; zbMATH DE number 6502576