Chaotic harmony search algorithms

By Bilal Alatas. Applied Mathematics and Computation, 2010

304 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Chaos-enhanced accelerated particle swarm optimization (2013, methodology): “Previously, chaotic sequences have been used together with some heuristic optimization algorithms to produce hybrid algorithms, and such hybridization has been successful in combination with GA [6], harmony search (HS) [7], simulated annealing (SA) [8], imperialist competitive algorithm [9] and fire”
Firefly algorithm with chaos (2013, methodology): “Previously, Chaotic sequences have been used together with some heuristic optimization algorithms such as genetic algorithms [8], harmony search [9], simulated annealing [10], particle swarm optimization [11], Imperialist Competitive Algorithm [12], ant and bee colony optimization [13,14] and Big Ba”
A survey on new generation metaheuristic algorithms (2019, methodology): “Lee et al. (2005) propose an efficient optimization algorithm for structures with discrete variables HS. Alatas (2010) proposes HS algorithms with chaotic maps to tune parameters and improve the convergence properties to prevent the HS to get stuck into local optima.”
Chaos Game Optimization: a novel metaheuristic algorithm (2020, background): “2013a), Chaotic Whale Optimization Algorithm (C-WOA) (Kaur and Arora 2018), Chaotic Harmony Search (C-HS) (Alatas 2010), Chaotic Grey Wolf Optimizer (C-GWO) (Yu et al.”