A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.25.

Slides:



Advertisements
Similar presentations
A core course on Modeling kees van Overveld Week-by-week summary.
Advertisements

1 A Core Course on Modeling Contents Functional Models The 4 Categories Approach Constructing the Functional Model Input of the Functional Model: Category.
Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.24.
1 A Core Course on Modeling ACCEL (continued) a 4 categories model dominance and Pareto optimality strength algorithm Examples Week 5 – Roles of Quantities.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.13.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Multiobjective Optimization Chapter 7 Luke, Essentials of Metaheuristics, 2011 Byung-Hyun Ha R1.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Pareto Multiobjective Optimization Patrick N. Ngatchou, Anahita Zarei, Warren.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Evolutionary Computation Introduction Peter Andras s.
Introduction to Genetic Algorithms Yonatan Shichel.
Multimodal Problems and Spatial Distribution Chapter 9.
Genetic Algorithm for Variable Selection
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
Results Classification - Comparison with existing approaches on benchmark datasets Survival Analysis – International multi-centre double-blind study Survival.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.8.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.11.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.28.
Portfolio-Optimization with Multi-Objective Evolutionary Algorithms in the case of Complex Constraints Benedikt Scheckenbach.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.31.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.21.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.26.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
The art of Devising Thumnail Models Kees van Overveld for Marie Curie International PhD exchange Program.
Introduction to Evolutionary Computation Temi avanzati di Intelligenza Artificiale - Lecture 1 Prof. Vincenzo Cutello Department of Mathematics and Computer.
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Omni-Optimizer A Procedure for Single and Multi-objective Optimization Prof. Kalyanmoy Deb and Santosh Tiwari.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Fuzzy Genetic Algorithm
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.12.
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.14.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.32.
1 A Core Course on Modeling     The modeling process     define conceptualize conclude execute formalize formulate purpose formulate purpose identify.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.30.
Local Search Pat Riddle 2012 Semester 2 Patricia J Riddle Adapted from slides by Stuart Russell,
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
2101INT – Principles of Intelligent Systems Lecture 11.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.12.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Genetic Algorithms D Nagesh Kumar, IISc Water Resources Planning and Management: M9L2 Advanced Topics.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Multiobjective Optimization  Particularities of multiobjective optimization  Multiobjective.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.9.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.2.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.29.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Dr. Kenneth Stanley September 11, 2006
Basics of Genetic Algorithms (MidTerm – only in RED material)
Heuristic Optimization Methods Pareto Multiobjective Optimization
A core Course on Modeling
A core course on Modeling kees van Overveld
Basics of Genetic Algorithms
Presentation transcript:

A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.25

Execution phase: operate model

Trade-offs and the Pareto front We should find ‘good’ or even ‘best’ concepts in cat.-I space. Mathematical optimization only works for single-valued functions; Approach: gradually climbing upward to a slope surface; This would apply to a single cat.-II quantity, or all cat.-II quantities lumped; We seek something more generic. Evolutionary methods to approximate Pareto front

Idea (Eckart Zitzler): combine Pareto and Evolution. Main features of evolution: genotype encodes blueprint of individual (‘cat.-I’); genotype encodes blueprint of individual (‘cat.-I’); genotype is passed over to offspring; genotype is passed over to offspring; new individual: genotype  phenotype, determining its fitness (‘cat.-II’); new individual: genotype  phenotype, determining its fitness (‘cat.-II’); Evolutionary methods

variations in genotypes (mutation, cross-over) cause variation among phenotypes; fitter phenotypes have larger change of surviving, procreating, and passing their genotypes on to next generation. Evolutionary methods

Issues to resolve: How to start  population of random individuals (tuples of values for cat.-I quantities); How to define fitness  fitter when dominated by fewer; Next generation  preserve non-dominated ones; complete population with mutations and crossing-over; Convergence  if Pareto front no longer moves. Evolutionary methods

Caveats: Pareto-Genetic is not perfect Evolutionary methods

Caveats: Pareto-Genetic is not perfect Evolutionary methods

Caveats: Pareto-Genetic is not perfect If the fraction non-dominated concepts is too large, evolution makes no progress; If the fraction non-dominated concepts is too large, evolution makes no progress; If there broad niches, finding individuals in a narrow niche may be problematic; If there broad niches, finding individuals in a narrow niche may be problematic; Approximations may fail to get near the theoretical best Pareto front. Approximations may fail to get near the theoretical best Pareto front. Evolutionary methods

Caveats: Pareto-Genetic is not perfect (No guarantee that analytical alternatives exist) DON’T use Pareto-Genetic if guarantee for optimal solution is required. Evolutionary methods

demo Evolutionary methods

If anything else fails: Complementary approach: local optimization (to be applied on all elements of the Pareto-front separately); Split cat.-I space in sub spaces if model function behaves different in different regimes (e.g., too much cat.-I freedom may lead to bad evolution progress); Temporarily fix some cat.-IV quantities (pretend that they are in category-III). Evolutionary methods

Summary functional model helps distinguish input (choice) and output (from purpose); Building a functional model as a graph shows roles of quantities. These are: Cat.-I : free to choose; Models for (design) decision support: the notion of design space; Choice of cat.-I quantities: no dependency-by-anticipation; Cat.-II : represents the intended output; The advantages and disadvantages of lumping and penalty quantities; The distinction between requirements, desires, and wishes; The notion of dominance to express multi-criteria comparison; Pareto front; Cat.-III : represents constraints from context; Cat.-IV : intermediate quantities; For optimization: use evolutionary approach; Approximate the Pareto front using the SPEA algorithm; Local search can be used for post-processing.