Hitting times of local and global optima in genetic algorithms with very high selection pressure | Zendy

Anton V. Eremeev | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hitting times of local and global optima in genetic algorithms with very high selection pressure

Author(s) -

Anton V. Eremeev

Publication year - 2017

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor160318016e

Subject(s) - local optimum , selection (genetic algorithm) , bounded function , mathematical optimization , mutation , range (aeronautics) , mathematics , genetic algorithm , upper and lower bounds , constant (computer programming) , algorithm , computer science , artificial intelligence , biology , genetics , mathematical analysis , materials science , composite material , gene , programming language

The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds do not require the probability of fitness-decreasing mutation to be bounded by a constant which is less than one

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research