An adaptive local search with prioritized tracking for Dynamic Environments

Dynamic Optimization Problems (DOPs) have attracted a growing interest in recent years. This interest is mainly due to two reasons: their closeness to practical real conditions and their high complexity. The majority of the approaches proposed so far to solve DOPs are population-based methods, because it is usually believed that their higher diversity allows a better detection and tracking of changes. However, recent studies have shown that trajectory-based methods can also provide competitive results. This work is focused on this last type of algorithms. Concretely, it proposes a new adaptive local search for continuous DOPs that incorporates a memory archive. The main novelties of the proposal are two-fold: the prioritized tracking, a method to determine which solutions in the memory archive should be tracked first; and an adaptive mechanism to control the minimum step-length or precision of the search. The experimentation done over the Moving Peaks Problem (MPB) shows the benefits of the prioritized tracking and the adaptive precision mechanism. Furthermore, our proposal obtains competitive results with respect to state-of-the-art algorithms for the MPB, both in terms of performance and tracking ability