Evolutionary-Algorithms
合集下载
相关主题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
7
Selecting and Stopping
• Once a decision is made the survivors comprise the next generation (Pop(t+1)). • This process of selecting parents based on their fitness, allowing them to create offspring, and replacing weaker members of the population is repeated for a user specified number of cycles. • Stopping conditions for evolutionary search could be:
• • • •
Aircraft Design, Routing in Communications Networks, Tracking Windshear, Game Playing (Checkers [Fogel])
2
Introduction to Evolutionary Computation (Applications cont.)
• These books not only fueled interest in EC but they also were instrumental in bringing together the EP, ES, and GA concepts together in a way that fostered unity and an explosion of new and exciting forms of EC.
• • •
Evolutionary Programming (Lawrence Fogel, 1962), Genetic Algorithms (Holland, 1962) Evolution Strategies (Rechenberg, 1965 & Schwefel, 1968),
9
A Brief History of Evolutionary Computation (cont.)
• • • • • • • • • Robotics, Air Traffic Control, Design, Scheduling, Machine Learning, Pattern Recognition, Job Shop Scheduling, VLSI Circuit Layout, Strike Force Allocation,
4
Example of Evolutionary Algorithm
• An Example Evolutionary Computation
Procedure EC{ t = 0; Initialize Pop(t); Evaluate Pop(t); While (Not Done) { Parents(t) = Select_Parents(Pop(t)); Offspring(t) = Procreate(Parents(t)); Evaluate(Offspring(t)); Pop(t+1)= Replace(Pop(t),Offspring(t)); t = t + 1; }
6
Parents and Generations
1. The selected parents are then allowed to create a set of offspring which are evaluated and assigned a fitness using the same evaluation function defined by the user. 2. Finally, a decision must be made as to which individuals of the current population and the offspring population should be allowed to survive.
Genetic Algorithms
Sources
Jaap Hofstede Beasly, Bull, Martin
Introduction to Evolutionary Computation
• Evolutionary Computation is the field of study devoted to the design, development, and analysis is problem solvers based on natural selection (simulated evolution). • Evolution has proven to be a powerful search process. • Evolutionary Computation has been successfully applied to a wide range of problems including:
• • • • •
The discovery of an optimal or near optimal solution Convergence on a single solution or set of similar solutions, When the EC detects the problem has no feasible solution, After a user-specified threshold has been reached, or After a maximum number of cycles.
8
A Brief History of Evolutionary Computation
• The idea of using simulated evolution to solve engineering and design problems have been around since the 1950’s (Fogel, 2000).
• The designers of each of the EC techniques saw that their particular problems could be solved via simulated evolution.
•
Байду номын сангаас
Fogel was concerned with solving prediction problems. Rechenberg & Schwefel were concerned with solving parameter optimization problems. Holland was concerned with developing robust adaptive systems.
11
A Brief History of Evolutionary Computation (cont.)
• However, a number of other books helped fuel the growing interest in EC:
• • • •
Lawrence Davis’, “Handbook of Genetic Algorithms”, (1991), Zbigniew Michalewicz’ book (1992), “Genetic Algorithms + Data Structures = Evolution Programs. John R. Koza’s “Genetic Programming” (1992), and D. B. Fogel’s 1995 book entitled, “Evolutionary Computation: Toward a New Philosophy of Machine Intelligence.
•
•
10
A Brief History of Evolutionary Computation (cont.)
• Each of these researchers successfully developed appropriate ECs for their particular problems independently. • In the US, Genetic Algorithms have become the most popular EC technique due to a book by David E. Goldberg (1989) entitled, “Genetic Algorithms in Search, Optimization & Machine Learning”. • This book explained the concept of Genetic Search in such a way the a wide variety of engineers and scientist could understand and apply.
1.
The evaluation function is used to determine the ‘goodness’ of a CS.
3. A number of individuals are then selected to be parents based on their fitness. 4. The Select_Parents method must be one that balances the urge for selecting the best performing CSs with the need for population diversity.
5
Candidate Solutions CS
1. In an Evolutionary Computation, a population of candidate solutions (CSs) is randomly generated. 2. Each of the CSs is evaluated and assigned a fitness based on a user specified evaluation function.
1. 2.
Typically, in EC , this is done to guarantee that the population size remains constant. [The study of ECs with dynamic population sizes would make an interesting project for this course]
3
Introduction to Evolutionary Computation (Applications cont.)
• Theme Park Tours (Disney Land/World) http://www.TouringPlans.com • Market Forecasting, • Egg Price Forecasting, • Design of Filters and Barriers, • Data-Mining, • User-Mining, • Resource Allocation, • Path Planning, • Etc.
• • •
Bremermann, 1962 Box, 1957 Friedberg, 1958
• However, it wasn’t until the early 1960’s that we began to see three influential forms of EC emerge (Back et al, 1997):
Selecting and Stopping
• Once a decision is made the survivors comprise the next generation (Pop(t+1)). • This process of selecting parents based on their fitness, allowing them to create offspring, and replacing weaker members of the population is repeated for a user specified number of cycles. • Stopping conditions for evolutionary search could be:
• • • •
Aircraft Design, Routing in Communications Networks, Tracking Windshear, Game Playing (Checkers [Fogel])
2
Introduction to Evolutionary Computation (Applications cont.)
• These books not only fueled interest in EC but they also were instrumental in bringing together the EP, ES, and GA concepts together in a way that fostered unity and an explosion of new and exciting forms of EC.
• • •
Evolutionary Programming (Lawrence Fogel, 1962), Genetic Algorithms (Holland, 1962) Evolution Strategies (Rechenberg, 1965 & Schwefel, 1968),
9
A Brief History of Evolutionary Computation (cont.)
• • • • • • • • • Robotics, Air Traffic Control, Design, Scheduling, Machine Learning, Pattern Recognition, Job Shop Scheduling, VLSI Circuit Layout, Strike Force Allocation,
4
Example of Evolutionary Algorithm
• An Example Evolutionary Computation
Procedure EC{ t = 0; Initialize Pop(t); Evaluate Pop(t); While (Not Done) { Parents(t) = Select_Parents(Pop(t)); Offspring(t) = Procreate(Parents(t)); Evaluate(Offspring(t)); Pop(t+1)= Replace(Pop(t),Offspring(t)); t = t + 1; }
6
Parents and Generations
1. The selected parents are then allowed to create a set of offspring which are evaluated and assigned a fitness using the same evaluation function defined by the user. 2. Finally, a decision must be made as to which individuals of the current population and the offspring population should be allowed to survive.
Genetic Algorithms
Sources
Jaap Hofstede Beasly, Bull, Martin
Introduction to Evolutionary Computation
• Evolutionary Computation is the field of study devoted to the design, development, and analysis is problem solvers based on natural selection (simulated evolution). • Evolution has proven to be a powerful search process. • Evolutionary Computation has been successfully applied to a wide range of problems including:
• • • • •
The discovery of an optimal or near optimal solution Convergence on a single solution or set of similar solutions, When the EC detects the problem has no feasible solution, After a user-specified threshold has been reached, or After a maximum number of cycles.
8
A Brief History of Evolutionary Computation
• The idea of using simulated evolution to solve engineering and design problems have been around since the 1950’s (Fogel, 2000).
• The designers of each of the EC techniques saw that their particular problems could be solved via simulated evolution.
•
Байду номын сангаас
Fogel was concerned with solving prediction problems. Rechenberg & Schwefel were concerned with solving parameter optimization problems. Holland was concerned with developing robust adaptive systems.
11
A Brief History of Evolutionary Computation (cont.)
• However, a number of other books helped fuel the growing interest in EC:
• • • •
Lawrence Davis’, “Handbook of Genetic Algorithms”, (1991), Zbigniew Michalewicz’ book (1992), “Genetic Algorithms + Data Structures = Evolution Programs. John R. Koza’s “Genetic Programming” (1992), and D. B. Fogel’s 1995 book entitled, “Evolutionary Computation: Toward a New Philosophy of Machine Intelligence.
•
•
10
A Brief History of Evolutionary Computation (cont.)
• Each of these researchers successfully developed appropriate ECs for their particular problems independently. • In the US, Genetic Algorithms have become the most popular EC technique due to a book by David E. Goldberg (1989) entitled, “Genetic Algorithms in Search, Optimization & Machine Learning”. • This book explained the concept of Genetic Search in such a way the a wide variety of engineers and scientist could understand and apply.
1.
The evaluation function is used to determine the ‘goodness’ of a CS.
3. A number of individuals are then selected to be parents based on their fitness. 4. The Select_Parents method must be one that balances the urge for selecting the best performing CSs with the need for population diversity.
5
Candidate Solutions CS
1. In an Evolutionary Computation, a population of candidate solutions (CSs) is randomly generated. 2. Each of the CSs is evaluated and assigned a fitness based on a user specified evaluation function.
1. 2.
Typically, in EC , this is done to guarantee that the population size remains constant. [The study of ECs with dynamic population sizes would make an interesting project for this course]
3
Introduction to Evolutionary Computation (Applications cont.)
• Theme Park Tours (Disney Land/World) http://www.TouringPlans.com • Market Forecasting, • Egg Price Forecasting, • Design of Filters and Barriers, • Data-Mining, • User-Mining, • Resource Allocation, • Path Planning, • Etc.
• • •
Bremermann, 1962 Box, 1957 Friedberg, 1958
• However, it wasn’t until the early 1960’s that we began to see three influential forms of EC emerge (Back et al, 1997):