Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
The Theory of Virtual Alphabets
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence (Studies in Computational Intelligence)
An introduction to simulated evolutionary optimization
IEEE Transactions on Neural Networks
A neuro-computational intelligence analysis of the global consumer software piracy rates
Expert Systems with Applications: An International Journal
An MDL approach to efficiently discover communities in bipartite network
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Hi-index | 0.00 |
Gene Expression Programming (GEP) is a new technique of evolutionary algorithm that implements genome/phoneme representation in computing programs. Due to its power in global search, it is widely applied in symbolic regression. However, little work has been done to apply it to real parameter optimization yet. This paper proposes a real parameter optimization method named Uniform-Constants based GEP (UC-GEP). In UC-GEP, the constant domain directly participates in the evolution. Our research conducted extensive experiments over nine benchmark functions from the IEEE Congress on Evolutionary Computation 2005 and compared the results to three other algorithms namely Meta-Constants based GEP (MC-GEP), Meta-Uniform-Constants based GEP (MUC-GEP), and the Floating Point Genetic Algorithm (FP-GA). For simplicity, all GEP methods adopt a one-tier index gene structure. The results demonstrate the optimal performance of our UC-GEP in solving multimodal problems and show that at least one GEP method outperforms FP-GA on all test functions with higher computational complexity.