Research Article
A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem
Algorithm 1
A cooperative coevolutionary cuckoo search algorithm (minimum).
Begin | Initializing population with organizations, and each organization has one member; | ; | While (the termination criteria are not reached) do | Begin | For each organization in , if the number of it more than 20, performing the splitting | operator on it, deleting it from , and adding the child organizations into ; | While (the number of organizations in is greater than 1) do | Begin | Randomly selecting two parent organizations and from ; | Performing the CS and selecting their leaders; | If rand < 0.5 | Annexing operator; | Else | Cooperating operator; | If and | ; | ; | End | adding the child organizations into ; | End | Deleting and form ; | End | Deleting the organizations form ; | % is the child number of join organizations | ; | ; | End | output the best solution in | End |
|