Teo, Jason Tze Wi and Nor Rafidah Mohamad, (2007) Hybridizing adaptive and non-adaptive mutation for cooperative exploration of complex multimodal search space. In: 3rd IASTED International Conference on Advances in Computer Science and Technology, (ACST 2007), 2-4 April 2007, Phuket, Thailand.
Full text not available from this repository.
Official URL: http://portal.acm.org/citation.cfm?id=1322538
One of the most efficient Real-Coded Genetic Algorithms (RCGAs) for function optimization currently is the G3-PCX (Parent-Centric Crossover) algorithm. However, its performance for solving complex multimodal problems with highly deceptive fitness landscapes is known to be poor compared with its performance for unimodal problems. The problem primarily stems from premature convergence to local rather than global optima due to lack of explorative capabilities of the algorithm. In this study, a hybrid approach combining both adaptive as well as non-adaptive mutation in a cooperative manner is investigated in the hope of improving the explorative capabilities of the G3-PCX algorithm for solving complex multimodal problems. The proposed algorithm is called G3HM (G3-PCX with Hybrid Mutation) and empirical tests on four benchmark complex multimodal test problems have shown highly competitive performance. In two of the four problems, G3HM dramatically outperformed the standard G3-PCX algorithm in terms of solution quality. Thus, the concept of combining adaptive with non-adaptive mutation as a hybrid genetic operator is shown to have beneficial effects for cooperatively exploring complex multimodal search spaces.
|Item Type:||Conference Paper (UNSPECIFIED)|
|Uncontrolled Keywords:||Evolutionary computation, Function optimization, G3-PCX, Real-coded genetic algorithms|
|Subjects:||?? QA150-272.5 ??|
|Divisions:||SCHOOL > School of Engineering and Information Technology|
|Deposited By:||IR Admin|
|Deposited On:||20 May 2011 16:44|
|Last Modified:||29 Dec 2014 16:55|
Repository Staff Only: item control page