Genetic algorithm process

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. 

The descriptor set can then be reduced by eliminating candidates that show such bad characteristics. Optimization techniques such as genetic algorithms (see Section 9.7) are powerful means of automating this selection process. 

Concomitantly with the increase in hardware capabilities, better software techniques will have to be developed. It will pay us to continue to learn how nature tackles problems. Artificial neural networks are a far cry away from the capabilities of the human brain. There is a lot of room left from the information processing of the human brain in order to develop more powerful artificial neural networks. Nature has developed over millions of years efficient optimization methods for adapting to changes in the environment. The development of evolutionary and genetic algorithms will continue. 

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. 

Evolutionary computation which is learned by watching population dynamics the most important programming are genetic algorithms which are inspired by the evolutionary processes of mutation, recombination, and natural selection in biology. 

The advantage of Genetic Algorithms, in contrast to the traditional optimization methods, is the fact that a large number of variables can be included into the process. Also in the presence of local optima, GA can find rapidly the global optimum. 

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. 

Morad, N. and Zalzala, A. (1999) Genetic algorithms in integrated process... 

Keywords inherent safety, process plant design, safety analysis, case-based reasoning, genetic algorithm... 

A new approach for computerized Inherent Safety Index is also presented. The index is used for the synthesis of inherently safer processes by using the index as a fitness function in the optimization of the process structure by an algorithm that is based on the combination of an genetic algorithm and case-based reasoning. Two case studies on the synthesis of inherently safer processes are given in the end. 

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. 

Hurme, M., 1996. Separation Process Synthesis with Genetic Algorithm. Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications. In Alander, J.T. (Ed.). Vaasa. Pp. 219-224. Proceedings of the University of Vaasa, No. 11. 

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). 

Sen, S. S. Narasimhan and K. Deb. Sensor Network Design of Linear Processes Using Genetic Algorithms. Comput Chem Eng 22 385-390 (1998). 

---