Research Article
A Novel Hybrid Bat Algorithm with Harmony Search for Global Numerical Optimization
Algorithm 1
Harmony search algorithm.
Begin | Step 1: Set the parameters and initialize the HM. | Step 2: Evaluate the fitness for each individual in HM | Step 3: while the halting criteria is not satisfied do | for : do | if rand < HMCR then // memory consideration | where | if rand < PAR then // pitch adjustment | | endif | else // random selection | | endif | endfor | Update the HM as , if (minimization objective) | Update the best harmony vector found so far | Step 4: end while | Step 5: Post-processing the results and visualization. | End. |
|