is technique that used in computing field for propose search to find the best solution that are known as exact or approximate solution to approve the optimization and search problems.
The objective of this paper is to improve a developed Real Coded Genetic Algorithm
and Efficient Genetic Algorithm
to hunt out the most effective or near best sequence in flowshop environment by minimizing makespan.
Adaptive mechanism in genetic algorithm
is a suitable approach for it allows fitness monitoring in each generation [6, 7].
The Genetic Algorithm
approach is selected for the following reasons
For the optimization of complex systems, many scholars have used different approaches, for example, the adaptive genetic algorithm
[17-18], improved genetic algorithm
[19-21], and multi-objective genetic algorithm
How to find out relationship between individual coding length and classification accuracy and the convergence speed in theory, and thus more effectively adjust the individual coding length of the classifier of the genetic algorithm
, has become an urgent problem to be solved which can be modelling as formula 10.
The genetic algorithm
has already shown itself to be robust approaches to determining the functional form.
Evaluation of crossover techniques in genetic algorithm
based optimum structural design.
Another extension of previous work is the genetic algorithm
parameter tunning, presented bellow.
In paper "Optimizing the performance of a Formula One car using a Genetic Algorithm
"  is described the use of a genetic algorithm
to optimize 66 setup parameters (i.
This approach provides a smoother selection probability curve than conventional genetic algorithm
systems, where a parent's chance to be chosen for reproduction is proportional to its fitness.
The stacking ensemble learning using genetic algorithm
as the meta-learner is shown in figure 2.