A. Naanaa

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

Scheduled

FA2 Heuristics 1
June 11, 2021  9:15 AM
2 - LV Kantorovich


Latest news

  • 6/5/21
    Conference abstract book

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.