Constrained genetic algorithm-based computer-aided control system design-fixed versus variable size population

This paper shows how the desired shape of the system response can be used to define the fitness of a design. The paper also shows that the GA can be used to solve practically constrained optimization problems. The technique is applied to the design of proportional and/or integral and/or derivative behavior controllers for a DC servomechanism system, which is also used as an example to demonstrate this approach of generalized fitness function specification. GAs allow more realistic and more easily understood definitions of constrained optimization algorithms. The constraints are expressed in a general explicit language. The optimal solution obtained by combining partial information from all the population is the foundation of GA theory, therefore, the infeasible solutions should provide information and not just be thrown away. Yahiaoui and Hamam (1997) present some results with a fixed population. In this paper we propose a new extension using a variable population. The first results of this extension are very promising despite some problems resulting from unregulated increase of our population in certain cases.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  S. Forrest,et al.  Use of a Genetic Algorithm to Analyze Robust Stability Problems , 1991, 1991 American Control Conference.

[3]  Yskandar Hamam,et al.  Genetic strategy with gate change function , 1993, Proceedings of IEEE Systems Man and Cybernetics Conference - SMC.

[4]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.

[5]  Chelsea C. White,et al.  Multiobjective intelligent computer-aided design , 1991, IEEE Trans. Syst. Man Cybern..

[6]  J. Stender Principle-based engineering and economic modelling , 1992 .

[7]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[8]  Yun Li,et al.  Specification of a control system fitness function using constraints for genetic algorithm based design methods , 1995 .

[9]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[11]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[12]  Jean-Michel Renders,et al.  Genetic Algorithms and Their Potential for Use in Process Control: A Case Study , 1991, ICGA.

[13]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[14]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[15]  David E. Goldberg,et al.  Genetic Algorithms and Rules Learning in Dynamic System Control , 1985, ICGA.

[16]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[17]  Michael de la Maza,et al.  Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .