Applying Evolutionary Algorithm to Chaco Tool on the Partitioning of Power Transmission System (CS448 Class Project) Yan Sun.

Slides:

Advertisements

Similar presentations

Multilevel Hypergraph Partitioning Daniel Salce Matthew Zobel.

Advertisements

Graph Partitioning Problems Lecture 18: March 14 s1 s3 s4 s2 T1 T4 T2 T3 s1 s4 s2 s3 t3 t1 t2 t4 A region R1 R2 C1 C2.

MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.

Approximation Algoirthms: Graph Partitioning Problems Lecture 17: March 16 s1 s3 s4 s2 T1 T4 T2 T3.

Optimization Problem with Simple Genetic Algorithms Cho, Dong-Yeon

GP Applications Two main areas of research Testing genetic programming in areas other techniques have been applied to. Applying genetic programming to.

Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.

DAN SHMIDT ITAY BITTAN Advanced Topics in Evolutionary Algorithms.

Transporting Perishable Goods (ANEB-TSP) The Art of Implementing an EA Assignment 1 CS 348 Fall 2008.

Futility-Based Offspring Sizing André Nwamba June 13, 2015.

Finite State Machine State Assignment for Area and Power Minimization Aiman H. El-Maleh, Sadiq M. Sait and Faisal N. Khan Department of Computer Engineering.

Multi-Objective Evolutionary Algorithms Matt D. Johnson April 19, 2007.

A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.

Introduction to Genetic Algorithms Yonatan Shichel.

Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.

Optimizing the State Eval Heuristic of Abalone using Evolutionary Algorithms Benjamin Rhew November 28, 2005.

Discovery of RNA Structural Elements Using Evolutionary Computation Authors: G. Fogel, V. Porto, D. Weekes, D. Fogel, R. Griffey, J. McNeil, E. Lesnik,

EA* A Hybrid Approach Robbie Hanson. What is it?  The A* algorithm, using an EA for the heuristic.  An efficient way of partitioning the search space.

A scalable multilevel algorithm for community structure detection

Euclidean TSP EA Pseudo Code. What is a Euclidean TSP? c ij 2 = (x i – x j ) 2 + (y i – y j ) 2.

EC Awards Lecture ~ Spring 2008 Advances in Parameterless Evolutionary Algorithms Lisa Guntly André Nwamba Research Advisor: Dr. Daniel Tauritz Natural.

Mandatory Project 2 - 2D HP Model. Problem Implement an algorithm for finding good (hopefully near-optimal) folds in the 2D HP Model Test on benchmark.

CS 447 Advanced Topics in Artificial Intelligence Fall 2002.

Optimizing a Chess Heuristic Using Evolutionary Algorithms Benjamin Rhew

Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.

N-Queens Computer Science 301 Spring 2007 Assignment 1 Bob Presents…

Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.

Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.

Evolutionary algorithms

Genetic Algorithm.

1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.

Zorica Stanimirović Faculty of Mathematics, University of Belgrade

Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.

What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.

The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.

Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.

Computational Complexity Jang, HaYoung BioIntelligence Lab.

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

DYNAMIC FACILITY LAYOUT : GENETIC ALGORITHM BASED MODEL

Evolutionary Programming

 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.

Genetic Algorithms What is a GA Terms and definitions Basic algorithm.

Societies of Hill-Climbers Before presenting SoHCs let’s first talk about Hill-Climbing in general. For this lecture we will confine ourselves to binary-

Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]

Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.

Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.

Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering

Parallel Graph Partioning Using Simulated Annealing Parallel and Distributed Computing I Sadik Gokhan Caglar.

Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:

Solving the Euclidean Non-Uniform Steiner Tree Problem Using a Genetic Algorithm Ian Frommer, Dept. of Mathematics, US Coast Guard Academy Bruce Golden,

GAIA (Genetic Algorithm Interface Architecture) Requirements Analysis Document (RAD) Version 1.0 Created By: Charles Hall Héctor Aybar William Grim Simone.

Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.

FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.

1 ParadisEO-MOEO for a Bi-objective Flow-Shop Scheduling Problem May 2007 E.-G. Talbi and the ParadisEO team

Symbolic Regression via Genetic Programming AI Project #2 Biointelligence lab Cho, Dong-Yeon

Ch 20. Parameter Control Ch 21. Self-adaptation Evolutionary Computation vol. 2: Advanced Algorithms and Operators Summarized and presented by Jung-Woo.

Evolutionary Programming A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 5.

Genetic Algorithm(GA)

Genetic Algorithms and Evolutionary Programming A Brief Overview.

Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.

Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.

Evolutionary Computation Evolving Neural Network Topologies.

Genetic Algorithm (Knapsack Problem)

Haploid-Diploid Evolutionary Algorithms

CPU SCHEDULING.

A Genetic Algorithm Approach to K-Means Clustering

Who cares about implementation and precision?

Artificial Intelligence Project 2 Genetic Algorithms

An evolutionary approach to solving complex problems

EE368 Soft Computing Genetic Algorithms.

Presentation transcript:

Applying Evolutionary Algorithm to Chaco Tool on the Partitioning of Power Transmission System (CS448 Class Project) Yan Sun

Problem Statement Overheads in Maxflow Calculation need to be minimized Partition the Power Transmission System (PTS) using Chaco An optimal set of parameters for Chaco

Chaco Developed by Bruce Hendrickson at Sandia National Lab Available partitioning methods  Inertial  Spectral  Kernighan-Lin  Multilevel KL

Chaco Parameters Debugging Parameters Execution Parameters Extended Functionality Parameters

Previous Experimentations Austin and Brian’s experiments  # partitions – 5 or 6  Degree as vertex weight  200 – 400 external message counts

Experimental Procedure Download and install Maxflow Run Chaco Take output from Chaco and create XML file Run Maxflow

EA Details -- Parameters # partitions  5  6 # coarsening to  50  20 Partition method  Bisection  Quadrisection

EA Details Representation— array of 297 integers  first 99  next 198  Both vertex weights and edge weights Objective Function— number of message passed across partitions Fitness Function—negative value of Object Function

EA Details Population  Size = 20  Random Initialization Offspring  Size = 6 Parent Selection  Tournament

EA Details Recombination Mutation Survivor Selection  Deterministic, Elitist, Steady State Termination Condition  Max # of generations  No improvement  Best solution found

Parameter Sets # Partitions # Coarsening to Partition Method Para 1550Bisection Para 2550Quadrisection Para 3520Bisection Para 4520Quadrisection Para 5650Bisection

Average Fitness Values Para 1Para 2Para 3Para 4Para 5 Terminating Average Fitness

Fitness vs. Generations

Wilcoxon Rank-Sum Test

# Generations to Reach Best Fitness

Wilcoxon Rank-Sum Test

Conclusion No difference found among parameter sets Fewer external message counts  vs  Better partition?

Problem Non-deterministic evaluation results population average fitness value

Q/A?