A multi-population harmony search algorithm with external archive for dynamic optimization problems

Dynamic optimization problems present great challenges to the research community because their parameters are either revealed or changed during the course of an ongoing optimization process. These problems are more challenging than static problems in real-world applications because the latter are usually dynamic, with the environment constantly subjected to change or the size of a problem increasing sporadically. In solving dynamic optimization problems in the real world, proposed solutions should be able to monitor the movement of the optimal point and the changes in the landscape solutions. In this paper, a multi-population harmony search algorithm with external archive for dynamic optimization problems is proposed. Harmony search algorithm is a population-based meta-heuristic optimization technique that is similar to a musical process when a musician is attempting to find a state of harmony. To tackle the problem of dynamism, the population of solutions is divided into several sub-populations such that each sub-population takes charge exploring or exploiting the search space. To enhance the algorithm performance further, an external archive is used to save the best solutions for later use. These solutions will then be used to replace redundant solutions in the harmony memory. The proposed algorithm is tested on the Moving Peak Benchmark. Empirical results show that the proposed algorithm produces better results than several of the current state-of-the-art algorithms