Annual International Conference On GIS, GPS AND Remote Sensing.

Slides:



Advertisements
Similar presentations
Genetic Algorithms (Evolutionary Computing) Genetic Algorithms are used to try to “evolve” the solution to a problem Generate prototype solutions called.
Advertisements

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
ISSPIT Ajman University of Science & Technology, UAE
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Effective gradient-free methods for inverse problems Jyri Leskinen FiDiPro DESIGN project.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Iterative Improvement Algorithms
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
1 Genetic Algorithms. CS 561, Session 26 2 The Traditional Approach Ask an expert Adapt existing designs Trial and error.
7/2/2015Intelligent Systems and Soft Computing1 Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
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.
Evolutionary Intelligence
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
Efficient Model Selection for Support Vector Machines
Charles L. Karr Rodney Bowersox Vishnu Singh
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Genetic Algorithms Michael J. Watts
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
GENETIC ALGORITHMS FOR THE UNSUPERVISED CLASSIFICATION OF SATELLITE IMAGES Ankush Khandelwal( ) Vaibhav Kedia( )
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
15/06/2003NORPIE 2004, Trondheim1 Genetic Optimization of Electric Machines, a State of the Art Study S. E. Skaar, R. Nilssen.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Evolutionary Algorithms K. Ganesh Research Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Neural Networks And Its Applications By Dr. Surya Chitra.
Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Optimization Of Robot Motion Planning Using Genetic Algorithm
Evolutionary Algorithms Jim Whitehead
School of Computer Science & Engineering
C.-S. Shieh, EC, KUAS, Taiwan
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Example: Applying EC to the TSP Problem
GENETIC ALGORITHMS & MACHINE LEARNING
EE368 Soft Computing Genetic Algorithms.
Presentation transcript:

Annual International Conference On GIS, GPS AND Remote Sensing

R.Naveen Kumar Goud B.E 4/4 Civil Engineering Vasavi College Of Engineering Hyderabad, Andhra Pradesh,India

GA Optimization Technique On Spatio-Temporal Interpolation For Dynamic GIS

abstract Generating cross-sectional data of arbitrary time slice is a basic function to support temporal operations such as time- series analysis and integration of dynamic models in GIS environment. Here we propose a interpolation scheme for class variable data under the framework of optimization of likelihood.

Objective of the Study Dynamic analysis of spatial data are needed in various fields. Difficult to generate spatio-temporal filed of quality data for analysis. Quality data, models describing structure is integrated with observational data.

Integration methods for data and models have been mainly developed for continuous variables in meteorology and oceanography. For class variables such as land use types, there are primitive interpolation methods,nearest neighbor interpolation.

Genetic Algorithm GA are used as approach to optimization which requires efficient and effective search. They combine survival of the fittest among structures.

five basic aspects the representation of problem, the initialization of population, the definition of evaluation function, the definition of genetic operators, the determination of parameters.

Optimization Scheme for Variable Interpolation S-T data can be divided into two types: continuous VD & class VD. The estimation of time of changes according to "class boundary distance". we go to integrate observational class data with structural models to make robust and reliable spatio-temporal interpolation of class variables.

Searching for spatio-temporal field of class data is typical combinatorial optimization problem, we introduce the genetic algorithm as a optimization scheme. The likelihood is computed based on both the fitness to observational data and that to behavioral models.

Application of Genetic Algorithm 3D Representation of an Individual. Initialization of Population. Definition of Individual's Fitness.

Representation of an Individual

The S-T relations affect the transitional probability in three ways Spatial Continuity: Assumption that the same class data tends to continue in spatial dimension. Temporal Continuity: This is an extension of spatial continuity to temporal domain. The third aspect is Expansion-Contraction relations:

Definition of Individual's Fitness

Calculation of Individual's Fitness Individual's fitness has two parts: behavioral fitness & observational fitness. By multiplying behavioral fitness and observational fitness, overall fitness can be computed. To integrate behavioral models and observational data, the overall fitness has to be optimized.

Definition of Operators Reproduction : This is a process in which individual strings are copied according to their objective function values or the fitness values That strings with a higher value have a higher probability of contributing one or more offspring in the next generation

Reproduction

Crossover

Mutation Mutation operator plays a secondary role in the simple GA.

Hill-Climbing method That exploits the best among known possibilities for finding an improved solution. Although Hill-Climbing strategies is easy to trap in one of local maxima more far away from the optimal solution.

Conclusion and Future Prospects Conclusion and Future Prospects GA/HC can be very rigorous because it can generate the most likely spatio- temporal distribution of class variables under observational data and a behavioral model. Hill-Climbing method can be effective method to greatly improve the efficiency of GA.

References Bramlette, M.F. (1991): Initialization, Mutation and Selection Methods in Genetic Algorithms for Function Optimization, Davis, L. (1987) : Genetic Algorithms and Simulated Annealing, Eshelman, L.J. and J.D.Schaffer (1991): Preventing Premature Convergence in Genetic Algorithms by Preventing Incest. Goldberg, D.E. (1989) : GENETIC ALOGRITHMS in Search, Optimization and Machine Learning. Gold, C.M.(1989): Surface interpolation, spatial adjacency and GIS, Three Dimensional Applications in Geographic Information System, Huang, S.B. and R.Shibasaki(1995): Development of Genetic Algorithm /Hill-climbing Method for Spatio-temporal Interpolation,. Shibasaki,R., T.lto and Y.Honda (1993):

Thank You