Research Article
An Improved Cuckoo Search Optimization Algorithm for the Problem of Chaotic Systems Parameter Estimation
Algorithm 1
Basic cuckoo search algorithm.
| Begin | | Generate iteration time | | Initialized with random vector values and parameters | | Evaluate the fitness of each individual (nest) and determine the best individual with the best fitness value | | While (stopping criterion is not met or t < MaxGeneration) | | Get a Cuckoo randomly by local random walk or Lévy Flights | | Evaluate its fitness | | Choose a nest among (say, ) randomly | | If () | | replace by the new nest | | End If | | A fraction () of worse nests are abandoned and new ones are built | | Keep the best nests with quality solutions | | Rank the solutions and find the current best | | Update the generation number | | End while | | End |
|