Mahyar Shafii December 2007

Slides:



Advertisements
Similar presentations
Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Advertisements

MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Angers, 10 June 2010 Multi-Objective Optimisation (II) Matthieu Basseur.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Biased Random Key Genetic Algorithm with Hybrid Decoding for Multi-objective Optimization Panwadee Tangpattanakul, Nicolas Jozefowiez, Pierre Lopez LAAS-CNRS.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Multi-Objective Optimization Using Evolutionary Algorithms
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Pareto Multiobjective Optimization Patrick N. Ngatchou, Anahita Zarei, Warren.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Multi-Objective Evolutionary Algorithms Matt D. Johnson April 19, 2007.
Introduction to Genetic Algorithms Yonatan Shichel.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Evolutionary Algorithms Guilherme Oliveira. What is it about ? Population based optimization algorithms Reproduction Mutation Recombination Selection.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Resource Allocation Problem Reporter: Wang Ching Yu Date: 2005/04/07.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
Evolutionary Multi-objective Optimization – A Big Picture Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Example II: Linear truss structure
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Masoud Asadzadeh, Bryan A. Tolson, A. J. MacLean. Dept. of Civil & Environmental Engineering, University of Waterloo Hydrologic model calibration aims.
MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory , Doshisha University , Kyoto Japan.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
A two-stage approach for multi- objective decision making with applications to system reliability optimization Zhaojun Li, Haitao Liao, David W. Coit Reliability.
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.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.25.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Multi-objective Evolutionary Algorithms (for NACST/Seq) summarized by Shin, Soo-Yong.
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
Introduction to GAs: Genetic Algorithms Quantitative Analysis: How to make a decision? Thank you for all pictures and information referred.
Tamaki Okuda ● Tomoyuki Hiroyasu   Mitsunori Miki   Shinya Watanabe  
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.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
Organic Evolution and Problem Solving Je-Gun Joung.
1 ParadisEO-MOEO for a Bi-objective Flow-Shop Scheduling Problem May 2007 E.-G. Talbi and the ParadisEO team
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
General information Theoretic basis of evolutionary computing. The general scheme of evolutionary algorithms General information Theoretic basis of evolutionary.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
ZEIT4700 – S1, 2016 Mathematical Modeling and Optimization School of Engineering and Information Technology.
Evolution Strategies Evolutionary Programming
C.-S. Shieh, EC, KUAS, Taiwan
EASTERN MEDITERRANEAN UNIVERSITY
Advanced Artificial Intelligence Evolutionary Search Algorithm
Heuristic Optimization Methods Pareto Multiobjective Optimization
Multi-Objective Optimization
Evolutionary Computation,
GENETIC ALGORITHMS & MACHINE LEARNING
Population Based Metaheuristics
Presentation transcript:

Mahyar Shafii December 2007 Multi-Objective Evolutionary Optimization; Concept and Application to Calibration of Rainfall-Runoff Model Mahyar Shafii December 2007

Table of Contents Introduction Classical Methods to Solve Multi-Objective Optimization Problems Evolutionary Algorithm (EA) Terminology Multi-Objective Evolutionary Algorithms (MOEAs) MOEA Application to Calibration of Conceptual Rainfall-Runoff Models Literature Review Concluding Remarks Development of an Improved NSGA-II

Introduction Multi-Objective Optimization Optimal solution in single-objective optimization is clearly defined. In multi-objective optimization there is rather a set of alternative trade-offs, generally known as “Pareto-Optimal” solutions. Real-World Problem Several incommensurable and often competing objectives

Introduction Multi-Objective Optimization Basic Concept and Terminology Find a vector of solutions: m inequality constraints: p equality constraints: k objective functions so that,

X* Є F X Є F or, there is at least one i Є I so that Introduction Pareto Optimum concept X* Є F X Є F or, there is at least one i Є I so that Vilfredo Pareto (1896) None of solutions in Pareto optimal set can be identified as better than the others unless preference information is included (e.g. a ranking of the objectives).

Traditional Approaches Aggregating the objectives into a single and parameterized objective function and performing several runs with different parameter settings to achieve a set of solutions approximating the Pareto-optimal set. Weighting Method (Cohon, 1978) Constraint Method (Cohon, 1978) Goal Programming (Steuer, 1986) Minimax Approach (Koski, 1984)

Traditional Approaches Difficulties with classical methods: Being sensitive to the shape of the Pareto-optimal front (e.g. weighting method). Need for problem knowledge which may not be available. Restrictions on their use in some application areas (Deb, 1999). Need to several optimization runs to achieve the best parameter setting to obtain an approximation of the Pareto-optimal set.

Evolutionary Algorithms (EAs) The term evolutionary algorithm (EA) stands for a class of stochastic optimization methods that simulate the process of natural evolution. They are meta-heuristics that attempt to apply the principles of neo-Darwinian evolution to the creation of artificial intelligence (machine learning) and to optimization. Origins of EAs: Firstly proposed in the late 1950s leading to development of several EAs since the 1970s, mainly (Bäck, Hammel, and Schwefel 1997) Genetic Algorithms (GA) Evolutionary Programming (EP) Evolution Strategies (ES)

Evolutionary Algorithms (EAs) Basic Principles of EA Genotype versus Phenotype Genotype is underlying genetic coding (Genes in GA) Phenotype is expression of that coding forming a possible solution (Chromosome in GA) Mapping between G-space & P-space Selection giving a chance to each solution to reproduce a certain number of times, dependent on their quality or so-called fitness values. Variation Imitating natural capability of creating ”new” living beings by means of recombination and mutation.

Evolutionary Algorithms (EAs) Recombination involves swapping sections of two individuals’ characteristics. Note: This is not what occurs in nature ATGCCGCACC TGTCCAGTCA Parent chromosomes ATGCC AGTCA GCACC TGTCC Recombined offspring ATGCC AGTCA GCACC TGTCC A T Mutation results in a random change in one or more of an individual’s characteristics. Random mutations in genetic composition

Evolutionary Algorithms (EAs)

Multi-Objective Evolutionary Algorithms (MOEAs) Evolutionary algorithms do better than other blind search strategies in multi-objective optimization (Fonseca and Fleming (1995); Valenzuela-Rend´on and Uresti-Charre (1997)). At first, they were applied by functions aggregation. More recently, MOEAs were designed to search decision spaces for the optimal tradeoffs among a vector of objectives (Coello Coello, 2002).

Multi-Objective Evolutionary Algorithms (MOEAs) Some representatives of MOEAs in operational research through past years: Non-Dominated Sorting genetic Algorithm (NSGA), Srinivas et Deb, 1995. NSGA-II, Deb et al., 2002. Strength Pareto Evolutionary Algorithm (SPEA), Zitzler and Thiele, 1999. SPEA2, Zitzler et al., 2001. Epsilon-NSGAII, Kollat and Reed, 2005. Multi-objective Shuffled Complex Evolution Metropolis Algorithm (MOSCEM-UA), Vrugt et al., 2003.

MOEA Applications in Calibration of Conceptual Rainfall-Runoff Models Conceptual rainfall-runoff (CRR) models Calibration of RR models is a process in which parameter adjustment is made so as to match (as closely as possible) the dynamic behavior of the RR model to the observed behavior of the catchment.

MOEA Applications in Calibration of Conceptual Rainfall-Runoff Models Literature Review Gupta et al. (1998) have discussed the advantages of a multiple-objective representation of the model calibration problem and this scheme has been shown to be applicable and desirable. Purely Random Techniques Single Objective Calibration Scheme Multi-Objective Calibration Scheme Local and Global Search Algorithms Some calibration results reveal that moving from a lumped model structure to a semi-distributed model structure improves the simulation results (Ajami et al., 2004). Evolutionary-Population Based Approaches Lumped Modeling Distributed Modeling

MOEA Applications in Calibration of Conceptual Rainfall-Runoff Models Lumped Hydrological Modeling: Development an algorithm Yapo et al. (1998): MOCOM-UA Cheng et al. (2002): Fuzzy Global Optimization and GA Khu et al. (2005): NSGA-II and kNN Proposing General Framework Wagener (2001) Multi-Objective nature with aggregated function Madsen (2000) Seibert (2000) Comparison between single and multiple objective formulations Chahinian and Moussa (2007) Working on objective functions Yu and Yang (2000): Fuzzy Multi-Objective Function (FMOF)

MOEA Applications in Calibration of Conceptual Rainfall-Runoff Models Distributed Hydrological Modeling: Proposing General Framework Madsen (2003): Aggregated Objective Function Development an algorithm Cheng et al. (2006): Following previous work by the same authors. Bekele and Nicklow (2007): NSGA-II for calibration of SWAT Comparison between single and multiple objective formulations Schoups et al. (2005): Subsurface modeling Parajka et al. (2007) Sensitivity and uncertainty analysis Muleta and Nicklow (2005): SWAT, but in a single-objective scheme Although a majority of prior studies have focused on CRR applications, there are an increasing number of recent studies focusing on developing multi-objective calibration strategies for distributed hydrological models such as:

MOEA Applications in Calibration of Conceptual Rainfall-Runoff Models Remarks and recommendations Modification to the study of Madsen (2003) in order to develop an improved framework for calibration of RR process in distributed hydrological models considering: Application of MOEAs and resolving the problem in a multi-objective formulation instead of function aggregation technique to obtain Pareto optimum. Constraining input parameters.

MOEA Applications in Calibration of Conceptual Rainfall-Runoff Models Remarks and recommendations Proper study on application of hybrid EA Developing a framework to establish a criterion to choose a solution among Pareto-optimum solutions and state as the final solution of the problem As the main weakness of MOEAs is that they require a large number of function evaluations through consumption of a great deal of time, it would be promising to direct efforts towards application of meta-modeling to reduce the number of simulations.

Development of Improved NSGA-II NSGA-II, Deb et al. (2002)

Development of Improved NSGA-II Innovations Application of Heuristic Genetic Operators (Crossover and Mutation) Heuristic parent-centric recombination (PCX) operator Adaptation by Fuzzy Logic Controller (FLC) Mathematical Test Problems ZDT1, ZDT2, ZDT3, ZDT4, ZDT6, (Deb et al., 2002)

Development of Improved NSGA-II Metrics of Performance Diversity Metrics Convergence Metrics

Development of Improved NSGA-II Results and Conclusions Diversity Metrics

Development of Improved NSGA-II Results and Conclusions Convergence Metrics

Thanks for your kind attention