Analysis of Complexity Drift in Genetic Programming
نویسنده
چکیده
One serious problem of standard Genetic Programming (GP) is that evolved structures appear to drift towards large and slow forms on average. This paper presents a novel analysis of the role played by variable complexity in the selection and survival of GP expressions. It deenes a particular property of GP representations, called rooted tree-schema, that sheds light on the role of variable complexity of evolved structures. A rooted tree-schema is a relation on the space of tree-shaped structures which provides a quantiiable partitioning of the search space. The paper analyzes the in-uence of parsimony pressure on selection and growth of structures. Experimental evidence connrms theoretical predictions.
منابع مشابه
A Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes
In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کاملA Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کاملComplexity Drift in Evolutionary Computation with Tree Representations
One serious problem of standard Genetic Programming (GP) is that evolved expressions appear to drift towards large and slow forms on average. This report presents a novel analysis of the role played by variable complexity in the selection and survival of GP expressions. It deenes a particular property of GP representations, called rooted tree-schema, that sheds light on the role of variable com...
متن کاملFrequency domain analysis of transient flow in pipelines; application of the genetic programming to reduce the linearization errors
The transient flow analyzing by the frequency domain method (FDM) is computationally much faster than the method of characteristic (MOC) in the time domain. FDM needs no discretization in time and space, but requires the linearization of governing equations and boundary conditions. Hence, the FDM is only valid for small perturbations in which the system’s hydraulics is almost linear. In this st...
متن کاملBankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach
In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...
متن کامل