Markov Chain Analyses of Random Local Search and Evolutionary Algorithm
Theoretical studies of evolutionary algorithms (EAs) have been developed by researchers whose main interests are convergence properties of algorithms. In this paper, we report the computational complexity of an algorithm that is a variant of (1+1) EA, called Random Local Search (RLS). While a standa...
Main Authors: | Hiroshi Furutani, Hiroki Tagami, Makoto Sakamoto, Yifei Du |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2014-12-01
|
Series: | Journal of Robotics, Networking and Artificial Life (JRNAL) |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/14958.pdf |
Similar Items
-
Analysis of Asymmetric Mutation Model in Random Local Search
by: Hiroshi Furutani, et al.
Published: (2015-04-01) -
PSEUDO-EXHAUSTIVE MEMORY DEVICES TESTING BASED ON MULTIPLE MARCH TESTS 1
by: V. N. Yarmolik, et al.
Published: (2018-03-01) -
An Evaluation Method for Visual Search Stability in Urban Tunnel Entrance and Exit Sections Based on Markov Chain
by: Zhiwen Zhou, et al.
Published: (2020-01-01) -
An application of Markov chains
by: Stevens, Roger T.
Published: (2017) -
A Markov chain Monte Carlo algorithm for Bayesian policy search
by: Vahid Tavakol Aghaei, et al.
Published: (2018-01-01)