Genetic algorithm operations

Herrera, E, Lozano, M. Verdegay, J. L. 1998. Tackling real-coded genetic algorithms operators and tools for behavioral Ataiysis. Artificial Intelligence Review, 12(4) 265-319. 

Bierwirth C (1995) A generalized permutation approach to job shop scheduling with genetic algorithms. Oper Res Spectr 17(2-3) 87-92... 

The evolutionary process of a genetic algorithm is accomplished by genetic operators which translate the evolutionary concepts of selection, recombination or crossover, and mutation into data processing to solve an optimization problem dynamically. Possible solutions to the problem are coded as so-called artificial chromosomes, which are changed and adapted throughout the optimization process until an optimrun solution is obtained. 

Goldberg, D.E. (1983) Computer-aided gas pipeline operation using genetic algorithms and rule learning (Doctoral dissertation. University of Michigan). Dissertation Abstracts International, 44(10), p. 3174B (University Microfilms No. 8402282). 

Table 11.3 One pass (read left to right) through the step.s of a basic genetic algorithm scheme to maximize the fitness function f x) = using a population of six 6-bit chromosomes. The crossover notation aina2) means that chromosomes Ca, and Ca2 exchange bits beyond the bit. The underlined bits in the Mutation Operation column are the only ones that have undergone random mutation. See text for other details.

In the present study, we propose a tuning method for PID controllers and apply the method to control the PBL process in LG chemicals Co. located in Yeochun. In the tuning method proposed in the present work, we first find the approximated process model after each batch by a closed-loop Identification method using operating data and then compute optimum tuning parameters of PID controllers based on GA (Genetic Algorithm) method. 

In any genetic algorithm application, the physical problem must be translated into a form suitable for manipulation by the evolutionary operators. Choice of coding is an important part of this process. 

After the chosen number of cycles has passed, the genetic algorithm is applied to the set of classifiers. The fitness of each classifier may be related directly to its strength, or the fitness may be determined by combining classifier strength with other factors, such as the specificity. The usual GA operators are applied to create a new population of classifiers, which is then given the opportunity to control the environment for many cycles. The process continues until overall control is judged to be adequate under all circumstances. 

ISI can be used also as an objective function in computerized process synthesis. Process synthesis can be considered as an optimization task. Because the model is uncontinuous, ordinary optimization methods could not be used, but a genetic algorithm was employed instead. In a genetic algorithm the structure of the process was represented as a string of integers, which describes the operations required and how they are connected together. 

Steps 4 through 6 are the scatter search counterparts to the crossover and mutation operators in genetic algorithms, and the reference set corresponds to the GA... 

Lohl, T. C. Schulz and S. Engell. Sequencing of Batch Operations for Highly Coupled Production Process Genetic Algorithms Versus Mathematical Programming. Comput Chem Eng 22 S579-585 (1998). 

---