Generalised Adaptive Harmony Search: A Comparative Analysis of Modern Harmony Search

Figure 7

This graph traces the convergence of the GAHS algorithm over 500,000 iterations as it minimises Ackley’s function. The fitness value, which is simply the candidate evaluated using Ackley’s function, of the best and worst candidates in the HM is indidcated at the end of each iteration. The best candiate is the HM minimum indicated by the blue line; the worst candidate is the HM maximum indicated by the red line.