A Novel Mechanism for Efficient the Search Optimization of Genetic Algorithm
Open Access
- 2 January 2016
- journal article
- research article
- Published by Atlantis Press SARL in International Journal of Computational Intelligence Systems
- Vol. 9 (1) , 57-64
Abstract
This paper proposes a Social Genetic Algorithm (SGA) that includes a transformation function that has ability to improve search efficiency. The SGA is different from the Traditional Genetic Algorithm (TGA) approaches, as it allows refinement of the TGA parameters for the selections of operators in each generation with two functions: optimization of crossover rate and optimization of mutation rate. In this paper, a new function that optimizes gene relationship has been introduced to advance the evolution capability and flexibility of SGA in searching complex and large solution space. Our proposed approach has been evaluated using simulation models. The simulation results have shown that SGA outperforms TGA in improving search efficiency. The contribution of the proposed approach is a dynamic and adaptive methodology, which has ability to improve efficiency.Keywords
This publication has 15 references indexed in Scilit:
- A survey of methods and approaches for reliable dynamic service compositionsService Oriented Computing and Applications, 2014
- Integration of business process modeling and Web services: a surveyService Oriented Computing and Applications, 2013
- Exploring how inter-organizational relational benefits affect information sharing in supply chainsInformation Technology and Management, 2013
- A genetic optimization algorithm and perceptron learning rules for a bi-criteria parallel machine schedulingJournal of the Chinese Institute of Industrial Engineers, 2012
- A comparative study of genetic operators for controller parameter optimisationControl Engineering Practice, 2009
- Parameter Control in Evolutionary Algorithms2007
- Parameter Setting in EAs: a 30 Year Perspective2007
- A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimizationInformation Sciences, 2006
- An Experimental Study of Benchmarking Functions for Genetic AlgorithmsInternational Journal of Computer Mathematics, 2002
- Adaptive probabilities of crossover and mutation in genetic algorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1994