Authors:
Meghana Kshirsagar
1
;
Rushikesh Jachak
2
;
Purva Chaudhari
2
and
Conor Ryan
1
Affiliations:
1
Biocomputing Developmental Systems, University of Limerick, Irland
;
2
Department of Computer Science, Government College of Engineering, Aurangabad, India
Keyword(s):
Evolutionary Computation, Memory Optimization, Grammatical Evolution, Multi-Objective Optimization, Autoregressive Time Series Forecasting.
Abstract:
In Grammatical Evolution (GE) individuals occupy more space than required, that is, the Actual Length of the individuals is longer than their Effective Length. This has major implications for scaling GE to complex problems that demand larger populations and complex individuals. We show how these two lengths vary for different sizes of population, demonstrating that Effective Length is relatively independent of population size, but that the Actual Length is proportional to it. We introduce Grammatical Evolution Memory Optimization (GEMO), a two-stage evolutionary system that uses a multi-objective approach to identify the optimal, or at least, near-optimal, genome length for the problem being examined. It uses a single run with a multi-objective fitness function defined to minimize the error for the problem being tackled along with maximizing the ratio of Effective to Actual Genome Length leading to better utilization of memory and hence, computational speedup. Then, in Stage 2, stand
ard GE runs are performed restricting the genome length to the length obtained in Stage 1. We demonstrate this technique on different problem domains and show that in all cases, GEMO produces individuals with the same fitness as standard GE but significantly improves memory usage and reduces computation time.
(More)