Stephen Chen York University

Slides:



Advertisements
Similar presentations
G5BAIM Artificial Intelligence Methods
Advertisements

Biologically Inspired Computing: Operators for Evolutionary Algorithms
Heuristics CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
CHAPTER 8 A NNEALING- T YPE A LGORITHMS Organization of chapter in ISSO –Introduction to simulated annealing –Simulated annealing algorithm Basic algorithm.
2.3 Ruler problems and number lines Objective: To solve ruler problems.
Characterizing the Distribution of Low- Makespan Schedules in the Job Shop Scheduling Problem Matthew J. Streeter Stephen F. Smith Carnegie Mellon University.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
Heuristic search heuristic search attempts to find the best tree, without looking at all possible trees.
Heuristic Optimization and Dynamical System Safety Verification Todd W. Neller Knowledge Systems Laboratory Stanford University.
Information-Based Optimization Approaches to Dynamical System Safety Verification Todd W. Neller.
Search in a Small World JIN Xiaolong Based on [1].
Travelling Salesman Problem an unfinished story...
Fast Evolutionary Optimisation Temi avanzati di Intelligenza Artificiale - Lecture 6 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
EAs for Combinatorial Optimization Problems BLG 602E.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
How to Stall a Motor: Information-Based Optimization for Safety Refutation of Hybrid Systems Todd W. Neller Knowledge Systems Laboratory Stanford University.
Sampling Combinatorial Space Using Biased Random Walks Jordan Erenrich, Wei Wei and Bart Selman Dept. of Computer Science Cornell University.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Ant Colony Optimization: an introduction
Project Presentation by Eddie Smolyansky & Shilo Abramovitch Supervisor: David Erdos.
Escaping local optimas Accept nonimproving neighbors – Tabu search and simulated annealing Iterating with different initial solutions – Multistart local.
The Basics and Pseudo Code
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.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
A Computational Study of Three Demon Algorithm Variants for Solving the TSP Bala Chandran, University of Maryland Bruce Golden, University of Maryland.
Local Search Pat Riddle 2012 Semester 2 Patricia J Riddle Adapted from slides by Stuart Russell,
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
Gesture Friendly Interfaces for Classroom Teaching with Thinking Tools Stephen Chen, George Frempong, and William Chris Cudmore York University.
Vaida Bartkutė, Leonidas Sakalauskas
Edge Assembly Crossover
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Transportation Logistics Professor Goodchild Spring 2011.
Clase 3: Basic Concepts of Search. Problems: SAT, TSP. Tarea 1 Computación Evolutiva Gabriela Ochoa
Towards the Automated Design of Phased Array Ultrasonic Transducers – Using Particle Swarms to find “Smart” Start Points Stephen Chen, York University.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
GENETIC ALGORITHMS Tanmay, Abhijit, Ameya, Saurabh.
Constraint Propagation Artificial Intelligence CMSC January 22, 2002.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
Metaheuristics for the New Millennium Bruce L. Golden RH Smith School of Business University of Maryland by Presented at the University of Iowa, March.
Constraints in Evolutionary Algorithms. Constraints: the big questions, page 233  how to evaluate and compare feasible and infeasible solutions  avoid,
Project Coordination Model Alexander Galenko (presenter), AgileAssets, Inc Eric Perrone, AgileAssets, Inc Tonya Scheinberg, AgileAssets, Inc The 6th International.
Genetic Algorithms. Solution Search in Problem Space.
Dept. Computer Science, Korea Univ. Intelligent Information System Lab A I (Artificial Intelligence) Professor I. J. Chung.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Introduction Intro Problem Materials Hypothesis Procedure Results
Department of Computer Science
Discrete ABC Based on Similarity for GCP
Comparing Genetic Algorithm and Guided Local Search Methods
HW #1 Due 29/9/2008 Write Java Applet to solve Goats and Cabbage “Missionaries and cannibals” problem with the following search algorithms: Breadth first.
CSE 4705 Artificial Intelligence
Data Summarization First, we need to have our database in good shape before going into final analysis Preliminary analysis, however, helps us detect unsuspected.
metaheuristic methods and their applications
Heuristic search INT 404.
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
Tour of Texas 50 largest cites (with airports) Application of Simulated Annnealing to the Traveling Salesman Problem (NP-hard)
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
School of Computer Science & Engineering
Algorithms for Budget-Constrained Survivable Topology Design
More on Search: A* and Optimization
Measuring Length Name: ________________________________
EMIS 8373: Integer Programming
Least squares linear classifier
First Exam 18/10/2010.
Local search characteristics of incomplete SAT procedures
The Coordination of Parallel Search with Common Components
Simulated Annealing & Boltzmann Machines
Data Mining CSCI 307, Spring 2019 Lecture 23
Stochastic Methods.
Presentation transcript:

Stephen Chen York University A Little Respect (for the Role of Common Components in Heuristic Search) Stephen Chen York University

Heuristic Search Search Operators Control Strategies August 21, 2006 IFIP WCC 2006

An Obvious Failing Point search operators do not have historical information! Most research focuses on the control strategies August 21, 2006 IFIP WCC 2006

Search Operator Strategies What can be improved? What is worth keeping? Most search operators focus on what they change, not what they keep August 21, 2006 IFIP WCC 2006

What Should Search Operators Keep? Would like to keep “above-average” components of existing solutions and change their “below-average” components Use Commonality Hypothesis to identify “above-average” components August 21, 2006 IFIP WCC 2006

The Commonality Hypothesis Schemata common to above-average solutions are above average Search operators should keep common components and change uncommon components August 21, 2006 IFIP WCC 2006

A Simple Example Parent 1 1 1 1 0 0 1 0 1 1 1 Common 1 1 0 1 1 1 Uncommon 1 1 0 0 1 Uncommon 2 0 1 1 0 August 21, 2006 IFIP WCC 2006

TSP Nearest Neighbour Tours August 21, 2006 IFIP WCC 2006

Common and Uncommon Components August 21, 2006 IFIP WCC 2006

Random Local Minima August 21, 2006 IFIP WCC 2006

Simulated Annealing August 21, 2006 IFIP WCC 2006

Summary Random search space, random search strategy All the intelligence of simulated annealing is in the control strategy August 21, 2006 IFIP WCC 2006

Distribution of Local Minima (Boese) Length Average distance from other local minima August 21, 2006 IFIP WCC 2006

“Big-Valley” – Globally Convex August 21, 2006 IFIP WCC 2006

“Directed” Simulated Annealing August 21, 2006 IFIP WCC 2006

Coordination with Common Components August 21, 2006 IFIP WCC 2006

TSP Results Instance BaseSA SAGA dsj1000 4.54 2.27 d1291 8.87 3.12 fl1577 6.47 0.64 August 21, 2006 IFIP WCC 2006

Summary Globally convex search space, “respectful” search operator Add some intelligence to the search operator August 21, 2006 IFIP WCC 2006

Conclusion The preservation of common components can improve the performance of heuristic search procedures in globally convex search spaces August 21, 2006 IFIP WCC 2006