ONMCGP: Orthogonal Neighbourhood Mutation Cartesian Genetic Programming for Evolvable Hardware

2nd International Conference on Mathematical Modeling in Physical Sciences 2013

物理学;数学

Fuchuan, N.I.^1,2 ; Yuanxiang, L.I.^1 ; Peng, K.E.^1

State Key Lab of Software Engineering, Wuhan, China^1

Department of Computer Science, Huazhong Agricultural University, Wuhan, China^2

关键词: Algorithm convergence;    Cartesian genetic programming;    Differential evolution strategy;    Evolvable hardware;    Local optima;    Neighbourhood;    Neighbourhood search;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/490/1/012194/pdf
DOI  :  10.1088/1742-6596/490/1/012194

来源: IOP

【 摘 要 】

Evolvable Hardware is facing the problems of scalability and stalling effect. This paper proposed a novel Orthogonal Neighbourhood Mutation (ONM) operator in Cartesian genetic programming (CGP), to reduce the stalling effect in CGP and improve the efficiency of the algorithms.The method incorporates with Differential Evolution strategy. Demonstrated by experiments on benchmark, the proposed Orthogonal Neighbourhood Search can jump out of Local optima, reduce the stalling effect in CGP and the algorithm convergence faster.