A chaos-based evolutionary algorithm for general nonlinear programming problems. (April 2016)

• Record Type: Journal Article
• Authors: El-Shorbagy, M.A.; Mousa, A.A.; Nasr, S.M.
• Is Part Of: Chaos, solitons and fractals. Volume 85(2016)
• Page Start: 8
• Page End: 21
• Publication Date: 2016-04
• Subjects: Nonlinear programming -- Evolutionary algorithm -- Chaos theory -- Local search; Chaotic behavior in systems -- Periodicals; Solitons -- Periodicals; Fractals -- Periodicals; Chaotic behavior in systems; Fractals; Solitons; Periodicals; 003.7
• DOI: 10.1016/j.chaos.2016.01.007
• Languages: English
• ISSNs: 0960-0779

Abstract

Abstract: In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC'2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.