Please use this identifier to cite or link to this item:
|Title:||Chaos theory in metaheuristics||Authors:||Türkoğlu, B.
|Issue Date:||2023||Publisher:||Elsevier||Abstract:||Metaheuristic optimization is the technique of finding the most suitable solution among the possible solutions for a particular problem. We encounter many problems in the real world, such as timetabling, path planning, packing, traveling salesman, trajectory optimization, and engineering design problems. The two main problems faced by all metaheuristic algorithms are being stuck in local optima and early convergence. To overcome these problems and achieve better performance, chaos theory is included in the metaheuristic optimization. The chaotic maps are employed to balance the exploration and exploitation efficiently and improve the performance of algorithms in terms of both local optima avoidance and convergence speed. The literature shows that chaotic maps can significantly boost the performance of metaheuristic optimization algorithms. In this chapter, chaos theory and chaotic maps are briefly explained. The use of chaotic maps in metaheuristic is presented, and an enhanced version of GSA with chaotic maps is shown as an application. © 2023 Elsevier Inc. All rights reserved.||URI:||https://doi.org/10.1016/B978-0-323-91781-0.00001-6
|Appears in Collections:||Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections|
Show full item record
checked on Dec 2, 2023
checked on Dec 4, 2023
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.