A tight lower bound on the expected runtime of standard steady state genetic algorithms.
Pietro S. OlivetoDirk SudholtCarsten WittPublished in: GECCO (2020)
Keyphrases
- steady state
- lower bound
- upper bound
- markov chain
- genetic algorithm
- product form
- operating conditions
- np hard
- worst case
- objective function
- neural network
- explicit expressions
- queue length
- state dependent
- queueing model
- queueing networks
- steady states
- optimal solution
- arrival rate
- heavy traffic
- feedback loop
- service times
- artificial neural networks
- random walk
- scheduling problem
- variance estimator
- special case