遗传算法介绍英文版.pptVIP

Optimization withGenetic Algorithms Walter Reade October 31, 2002 TAG Meeting Outline Background on Optimization Introduction to Genetic Algorithms Using GAs to Solve Difficult Problems A MatLab Implementation Summary / Questions How Do We Find the Minimum? Gradient Methods(Steepest Descent) Move in the direction of steepest gradient. Simple to implement, guaranteed convergence. Must know something about the derivative. Can easily get stuck in a local minimum. Stochastic Methods Heuristic Using “Rules of Thumb” Metaheuristic A framework of heuristics used to update a set of solutions during a search. Simulated Annealing Tabu Search Ant Colony Systems Genetic Algorithms Use a population of possible solutions to the search space. Each solution is encoded in a string called a chromosome (or genome). Chromosomes are evaluated for fitness each generation (iteration); chromosomes that are more fit have a high probability of surviving. Genetic Algorithms (cont.) Once the surviving population is chosen, different “parent” chromosomes are combined to form “child” chromosomes. Chromosomes may undergo mutation. A new generation is formed, the process is repeated. By selection, cross-over, and mutation, GAs search the solution space while creating stronger solutions over each generation. Fitness and Selection Roulette Wheel Competition Etc. Cross-Over Replaces two parent solutions with two children solutions. Mechanism for covering large area of search space. Mutation Operates on a single chromosome. Mechanism to improve local search space. Advantages to using GAs Flexible and adaptive to a wide variety of problems. Robust, global search capability. Does not require the solution space to be smooth, continuous, or differentiable. Can be used in permutation problems. No practical drawbacks. Slow local convergence Perceived learning overhead Applications Function optimization Job shop scheduling Process planning Assembly line optim. Process control Airplane landing Nested de