Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA
type: Item
instance of: scholarly article
title: Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA
zbMATH Open document ID: 1433.68653
author: Yuan Zhang
author: Xiaofeng Qin
author: Qinglian Ma
author: Satoru Hiwa
author: Tomoyuki Hiroyasu
author: Hiroshi Furutani
author: MingHao Zhao
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 68W50
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 62G32
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7191329
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: OneMax problem
zbMATH Keywords: Gumbel function
zbMATH Keywords: coupon collector's problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2020.03.007
OpenAlex ID: W3011708793
cites work: Q5306039
cites work: Q3224102
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: A study of drift analysis for estimating computation time of evolutionary algorithms
cites work: Towards an analytic framework for analysing the computation time of evolutionary algorithms
cites work: Q3876725
cites work: Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
cites work: Q5485944
cites work: Q3224100
cites work: Q3285941
cites work: Q4094202
cites work: Q3259350
DOI: 10.1016/J.TCS.2020.03.007
description: scientific article; zbMATH DE number 7191329