Randomized Local Search with Frequency Fitness Assignment (FRLS)
Randomized local search (RLS) is maybe the simplest local search algorithm. It maintains one single best-so-far solution and in each step, it samples one new solution by applying the unary search operator to it. It will accept the new solution as the current solution if it is not worse. If we plug Frequency Fitness Assignment (FFA) into this algorithm, we obtain the FRLS.
Plugging Frequency Fitness Assignment into Metaheuristics
Frequency Fitness Assignment (FFA) is a technique that fundamentally changes how (metaheuristic) optimization algorithms work. The goal of this post is to explore how this technique can be plugged into an existing algorithm. We first discuss optimization and the general pattern of metaheuristics in general. We then discuss the simplest local search algorithm – randomized local search, or RLS for short. We plug FFA into this algorithm and obtain the FRLS. We finally list some properties of FRLS as well as some related works.