AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS

The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods are developed, and then for each variant, the performance of ten different chaotic maps is investigated to identify the most powerful variant. A comparison of these variants and the standard CSS demonstrates the superiority and suitability of the selected variants for the benchmark mathematical optimization problems.