Chaotic golden ratio guided local search for big data optimization

Abstract

Biological systems where order arises from disorder inspires for many metaheuristic optimization techniques. Self-organization and evolution are the common behaviour of chaos and optimization algorithms. Chaos can be defined as an ordered state of disorder that is hypersensitive to initial conditions. Therefore, chaos can help create order out of disorder. In the scope of this work, Golden Ratio Guided Local Search method was improved with inspiration by chaos and named as Chaotic Golden Ratio Guided Local Search (CGRGLS). Chaos is used as a random number generator in the proposed method. The coefficient in the equation for determining adaptive step size was derived from the Singer Chaotic Map. Performance evaluation of the proposed method was done by using CGRGLS in the local search part of MLSHADE-SPA algorithm. The experimental studies carried out with the electroencephalographic signal decomposition-based optimization problems, named as Big Data optimization problem (Big-Opt), introduced at the Congress on Evolutionary Computing Big Data Competition (CEC’2015). Experimental results have shown that the local search method developed using chaotic maps has an effect that increases the performance of the algorithm.

Keywords

• Big Data Optimization
• Local search
• Golden ratio
• Chaotic map
• Memetic algorithm