Performance Analysis of MADO Dynamic Optimization Algorithm
Julien Lepagnot, Amir Nakib, Hamouche Oulhadj, Patrick Siarry · 2009
Many real-world problems are dynamic and require an optimization algorithm that is able to continuously track a changing optimum over time. In this paper, a new multiagent algorithm for solving dynamic problems is studied. This algorithm, called MADO, is analyzed using the Moving Peaks Benchmark, and its performances are compared to those of competing dynamic optimization algorithms on several instances of this benchmark. The obtained results show the efficiency of MADO, even in multimodal environments.