Introduction to evolutionary computing techniques

There is a tremendous interest in the development of the theory and applications of evolutionary computing techniques both in industry and universities. Evolutionary computation is the name given to collection of algorithms based on the evolution of a population towards a solution of a certain problem. These algorithms are used successfully in many applications requiring the optimization of a certain multidimensional function. The population of possible solutions evolves from one generation to the next, ultimately arriving at a satisfactory solution to the problem. These algorithms differ in the way a new population is generated from the present one and in the way the members are represented within the algorithm. Three types of evolutionary computing techniques are widely reported recently. These are genetic algorithms (GAs), genetic programming (GP) and evolutionary algorithms (EAs). The EAs can be divided into evolutionary strategies (ES) and evolutionary programming (EP). All three of these algorithms in some way are modelled after the evolutionary processes occurring in nature.<<ETX>>

[1]  Richard Lippmann,et al.  Using genetic algorithms to select and create features for pattern classification , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[2]  John R. Koza,et al.  Performance improvement of machine learning via automatic discovery of facilitating functions as applied to a problem of symbolic system identification , 1993, IEEE International Conference on Neural Networks.

[3]  Stephen F. Smith,et al.  A Genetic System for Learning Models of Consumer Choice , 1987, ICGA.

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

[5]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[6]  Donald R. Jones,et al.  Solving Partitioning Problems with Genetic Algorithms , 1991, International Conference on Genetic Algorithms.

[7]  David E. Goldberg,et al.  Genetic and evolutionary algorithms come of age , 1994, CACM.

[8]  John R. Koza.  Simultaneous discovery of detectors and a way of using the detectors via genetic programming , 1993, IEEE International Conference on Neural Networks.

[9]  Kazuhiko Kawamura,et al.  Managing genetic search in job shop scheduling , 1993, IEEE Expert.

[10]  Craig Caldwell,et al.  Tracking a Criminal Suspect Through "Face-Space" with a Genetic Algorithm , 1991, ICGA.

[11]  Scott Austin,et al.  Genetic solutions to XOR problems , 1990 .

[12]  Lawrence Davis,et al.  Genetic Algorithms and Communication Link Speed Design: Constraints and Operators , 1987, ICGA.

[13]  John R. Koza.  Hierarchical Automatic Function Definition in Genetic Programming , 1992, FOGA.

[14]  John J. Grefenstette,et al.  Test and evaluation by genetic algorithms , 1993, IEEE Expert.

[15]  Kazuhiko Kawamura,et al.  Exploring Problem-Specific Recombination Operators for Job Shop Scheduling , 1991, ICGA.

[16]  Gunar E. Liepins,et al.  A Classifier Based System for Discovering Scheduling Heuristics , 1987, ICGA.

[17]  Lawrence Davis,et al.  Genetic Algorithms and Communication Link Speed Design: Theoretical Considerations , 1987, ICGA.

[18]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.