Chaotic guided local search algorithm for solving optimization problems
Chaos optimization algorithm (COA) can be an interesting alternative in a global optimization problem. Due to the non-repetition and ergodicity of chaos, it can explore the global search space at higher speeds than stochastic searches that depend on probabilities. To adjust the solution obtained by COA, guided local search algorithm (GLS) is integrated with COA to form a hybrid algorithm. The results show that the present algorithms significantly outperforms the existing methods in terms of convergence speed, numerical stability and a better optimal
solution than other algorithms.
Keywords: Chaos theory; Guided local search; Metaheuristics; Combinatorial optimization; Hybrid methods
