Chaotic guided local search algorithm for solving global optimization and engineering problems

Anis Naanaa ()
Additional contact information
Anis Naanaa: University of Tunis El Manar

Journal of Combinatorial Optimization, 2025, vol. 49, issue 4, No 3, 21 pages

Abstract: Abstract Chaos optimization algorithm (COA) is 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. GLS is a metaheuristic optimization algorithm that combines elements of local search with strategic guidance to efficiently explore the solution space. This study proposes a chaotic guided local search algorithm to search for global solutions. The proposed algorithm, namely COA-GLS, contributes to optimization problems by providing a balance between quick convergence and good solution quality. Its combination of local refinement, strategic guidance, diversification strategies, and adaptability makes it a powerful metaheuristic capable of efficiently navigating complex solution spaces and finding high-quality solutions in a relatively short amount of time. Simulation results show that the present algorithms significantly outperform the existing methods in terms of convergence speed, numerical stability, and a better optimal solution than other algorithms.

Keywords: Chaos theory; Metaheuristics; Guided local search; Combinatorial optimization; Hybrid methods (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01281-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01281-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01281-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().