FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION P.W. Brooks and W.D. Potter Institute for Artificial Intelligence, University of Georgia, USA.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
CS6800 Advanced Theory of Computation
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Bio-Inspired Optimization. Our Journey – For the remainder of the course A brief review of classical optimization methods The basics of several stochastic.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
Evolutionary Computational Intelligence
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
1 A hybrid particle swarm optimization algorithm for optimal task assignment in distributed system Peng-Yeng Yin and Pei-Pei Wang Department of Information.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Heuristics for Adaptive Temperature-Aware SoC Test Scheduling Considering Process Variation Nima Aghaee, Zebo Peng, and Petru Eles Embedded Systems Laboratory.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Universidad de los Andes-CODENSA The Continuous Genetic Algorithm.
PROJECT LM-01 Presentation 16 Oct 2006 University of Wollongong, Australia.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Introduction to Genetic Algorithms and Evolutionary Computation
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic algorithms Prof Kang Li
Swarm Intelligence 虞台文.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Chapter 7 Handling Constraints
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
Modern Heuristic Optimization Techniques and Potential Applications to Power System Control Mohamed A El-Sharkawi The CIA lab Department of Electrical.
The Particle Swarm Optimization Algorithm Nebojša Trpković 10 th Dec 2010.
Topics in Artificial Intelligence By Danny Kovach.
Fuzzy Genetic Algorithm
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Particle Swarm Optimization James Kennedy & Russel C. Eberhart.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Improving the Genetic Algorithm Performance in Aerial Spray Deposition Management University of Georgia L. Wu, W.D. Potter, K. Rasheed USDA Forest Service.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Contribution of second order evolution to evolutionary algorithms Virginie LEFORT July 11 th.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Resource-Constrained Project Scheduling Problem (RCPSP)
© P. Pongcharoen CCSI/1 Scheduling Complex Products using Genetic Algorithms with Alternative Fitness Functions P. Pongcharoen, C. Hicks, P.M. Braiden.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic Algorithms.
Particle Swarm Optimization (2)
Particle Swarm Optimization with Partial Search To Solve TSP
Particle Swarm Optimization
PSO -Introduction Proposed by James Kennedy & Russell Eberhart in 1995
Chapter 6: Genetic Algorithms
An evolutionary approach to solving complex problems
Prof. Marie desJardins September 20, 2010
Advanced Artificial Intelligence Evolutionary Search Algorithm
Genetic Algorithms overview
Particle swarm optimization
Population Based Metaheuristics
Population Methods.
Presentation transcript:

FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION P.W. Brooks and W.D. Potter Institute for Artificial Intelligence, University of Georgia, USA Nature-Inspired Optimization

Overview  Background: (NIO Project 1 )  PSO -- GA -- EO -- RO  Diagnosis – Configuration -- Planning – Route Finding  Forest Planning (aka Harvest Scheduling)  73-Stand Daniel Pickett Forest  Particle Swarm Optimization  Priority Representation  Results 1 W.D. Potter, E. Drucker, P. Bettinger, F. Maier, D. Luper, M. Martin, M. Watkinson, G. Handy, and C. Hayes, “Diagnosis, Configuration, Planning, and Pathfinding: Experiments in Nature-Inspired Optimization”, in Natural Intelligence for Scheduling, Planning and Packing Problems, edited by Raymond Chiong, Springer-Verlag, Studies in Computational Intelligence (SCI), Nature-Inspired Optimization

Forest Planning Daniel Pickett Forest – 73 stands with access roads, ponds, and streams Nature-Inspired Optimization

Forest Planning  Even-flow harvest  Cutting occurs in one of three time periods  Each time period is 10 years in duration  A stand is only cut at most once  A plan may include un-cut stands  Adjacent cuts not allowed (same period)  Goal: achieve target harvest each period  Fitness: minimize plan error Nature-Inspired Optimization

Forest Planning Nature-Inspired Optimization

Particle Swarm Optimization (PSO)  Models behavior of large groups of animals such as flocks of birds  Individuals’ movement through search space is guided by Population momentum Individual velocity Best local and global individual Random influences  Continuous and discrete problem representations possible  A good general purpose algorithm Nature-Inspired Optimization

Particle Swarm Optimization (PSO) Nature-Inspired Optimization

PSO – Priority Representation Nature-Inspired Optimization

PSO – Priority Representation  Built-in constraint violation avoidance, but  Increased search space size (219 vs 73)  Real-valued priorities vs limited integer values  Longer processing time to generate a plan Nature-Inspired Optimization

PSO – Experiment Setup Nature-Inspired Optimization

Results (smaller error is better) NIO:GADPSOROEO Harvest6.5M35M5,500,39110M inertiapopsizePR best M M M M ,500, M Nature-Inspired Optimization

Conclusion  The priority representation is an effective way to encode harvest schedules for PSO  Ordering of plan elements by priority allows a PSO to deal with some constrained problems without requiring repairs or penalties  Minimal impact occurs to PSO structure  Minimal domain knowledge is required in order to apply the priority representation Nature-Inspired Optimization

Questions? Nature-Inspired Optimization

Thank You! Nature-Inspired Optimization

Genetic Algorithm (GA)  Models Evolution by Natural Selection Individuals (mates) are potential solutions Driving force is selection pressure (mate selection) Individuals mate to produce offspring (crossover) Mutation of offspring increases genetic variation Fitness function ranks individual fitness  Many variations are possible  Very powerful general purpose algorithm  Can be overly complicated to design Nature-Inspired Optimization

Extremal Optimization (EO)  Models tendency of systems to organize into non-equilibrium states Based on the Bak-Sneppen Model A single solution is evolved by changing the solution’s components Each component must also be assigned a fitness The worst component is randomly replaced  Useful for set covering and optimization problems  Component fitness may be difficult to calculate Nature-Inspired Optimization

Raindrop Method  Mimics the effect of falling rain A random position on the search landscape is chosen (rain drop) The chosen position’s value is randomly changed and all other positions are updated (water ripple) Updates may cause invalid states, so repair is necessary  Recently developed algorithm  Useful for certain map coloring problems Nature-Inspired Optimization