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

Add to your list(s) Download to your calendar using vCal

• Assoc. Prof. Anton Eremeev (Omsk Branch of Sobolev Institute of Mathematics, Russia)
• Monday 27 November 2017, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Hector Basevi.

Host: Dr Per Kristian Lehre

Speaker’s website: http://iitam.omsk.net.ru/~eremeev/index_e.htm

Abstract: The talk 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 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.

This talk is part of the Artificial Intelligence and Natural Computation seminars series.

This talk is included in these lists:

• Artificial Intelligence and Natural Computation seminars
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• computer sience

Note that ex-directory lists are not shown.