The examination of time-complexity is an important topic in Evolutionary Algorithms (EAs).
To calculate the mean EA hitting time, examine the idea of take-overtime. i.e., rather than a single operator pick, the concept of takeover time is broadened.
The generalisation is used to solve benchmark problems such as N-Bit parity. The time complexity in terms of number of generations is estimated for various input sizes N.
A statistical tool is used to create an empirical model for the suggested EA.
To determine the take-overtime, use the suitable selection procedure.
Author (S) Details
G. V. R. Sagar
G Pulla Reddy Engineering College (Autonomous), Kurnool, India.
Department of Electrical and Electronics, G. Pulla Reddy Engineering College Kurnool, AP., India.
View Book :- https://stm.bookpi.org/NAER-V14/article/view/3521