Genetic Algorithm And Its Application To The Graph Theory & Programming Model

Although genetic algorithms is widely used in many areas and has its powerful performance in all-sided optimization, but it has disadvantages in theoretical development and applications. We research on deceptive problem of genetic algorithms and Theory&Programming Model based on it.As to the deceptive problem, we first analyze the theory basis of deceptive problem polynomial evaluation and propose the fast decision theorem to compute a function optimized. Then, we prove that linear fitness scaling has no influence on the deceptive degree of a function, and get that the deceptive degree of the sum function of some uncorrelated functions is equal to the maximal of their deceptive degrees. Finally, we propose a fast algorithm to compute nominal deceptive degree and analyze its complexity.In the research on applications of the Theory&Programming Model, we first specify the application preponderance to solve it, and propose the general thought. We design the algorithms based on genetic algorithms for bigraph programming model and weightless bigraph model, the online lease problem of DVDs and the students reviewing problem, respectively. Finally, we verify the feasibility and efficiency of genetic algorithms in solving such models.