Genetic Algorithms and Simulated Annealing

Abstract

This chapter introduces the basic concepts and notation of genetic algorithms and simulated annealing, which are two basic search methodologies that can be used for modelling and simulation of complex non-linear dynamical systems. Since both techniques can be considered as general purpose optimization methodologies, we can use them to find the mathematical model which minimizes the fitting errors for a specific problem. On the other hand, we can also use any of these techniques for simulation if we exploit their efficient search capabilities to find the appropriate parameter values for a specific mathematical model. We also describe in this chapter the application of genetic algorithms to the problem of finding the best neural network or fuzzy system for a particular problem. We can use a genetic algorithm to optimize the weights or the architecture of a neural network for a particular application. Alternatively, we can use a genetic algorithm to optimize the number of rules or the membership functions of a fuzzy system for a specific problem. These are two important application of genetic algorithms, which will be used in later chapters to design intelligent intelligent systems for controlling real world dynamical systems.