Abstract
Some results about the computation time of evolutionary algorithms are obtained in this paper. First, some exact analytic expressions of the mean first hitting times of evolutionary algorithms infinite search spaces are acquired theoretically by using the properties of Markov chain associated with evolutionary algorithms considered here. Then, by introducing drift analysis and applying Dynkin's formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are estimated
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
