The Basic Gene Expression Algorithm
The fundamental steps of the basic gene expression algorithm are listed below in pseudocode:
- 1. Select function set;
- 2. Select terminal set;
- 3. Load dataset for fitness evaluation;
- 4. Create chromosomes of initial population randomly;
- 5. For each program in population:
- a) Express chromosome;
- b) Execute program;
- c) Evaluate fitness;
- 6. Verify stop condition;
- 7. Select programs;
- 8. Replicate selected programs to form the next population;
- 9. Modify chromosomes using genetic operators;
- 10. Go to step 5.
The first four steps prepare all the ingredients that are needed for the iterative loop of the algorithm (steps 5 through 10). Of these preparative steps, the crucial one is the creation of the initial population, which is created randomly using the elements of the function and terminal sets.
Read more about this topic: Gene Expression Programming
Famous quotes containing the words basic and/or expression:
“There’s one basic rule you should remember about development charts that will save you countless hours of worry.... The fact that a child passes through a particular developmental stage is always more important than the age of that child when he or she does it. In the long run, it really doesn’t matter whether you learn to walk at ten months or fifteen months—as long as you learn how to walk.”
—Lawrence Kutner (20th century)
“... if the Settlement seeks its expression through social activity, it must learn the difference between mere social unrest and spiritual impulse.”
—Jane Addams (1860–1935)