A Unified Markov Chain Approach to Analysing Randomised Search Heuristics

Abstract

The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics. This paper presents a unified Markov chain approach to studying them. Using the approach, the sufficient and necessary conditions of convergence in distribution are established. Then the average convergence rate is introduced… (More)

Topics

5 Figures and Tables

Cite this paper

@article{He2013AUM, title={A Unified Markov Chain Approach to Analysing Randomised Search Heuristics}, author={Jun He and Feidun He and Xin Yao}, journal={CoRR}, year={2013}, volume={abs/1312.2368} }