Ant Colony Hyper-heuristics for Graph Colouring Nam Pham ASAP Group, Computer Science School University of Nottingham.

Slides:

Advertisements

Similar presentations

Slides by Peter van Beek Edited by Patrick Prosser.

Advertisements

1 Fuzzy Multiple Heuristic Ordering for Course Timetabling Hishammuddin Asmuni Edmund K. Burke Jonathan M. Garibaldi UKCI2005 – London, UK Automated Scheduling,

Ali Husseinzadeh Kashan Spring 2010

Biologically Inspired Computation Really finishing off EC.

A Backtracking Correction Heuristic for Graph Coloring Algorithms Sanjukta Bhowmick and Paul Hovland Argonne National Laboratory Funded by DOE.

Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,

1 Reinforced Tabu Search (RTS) for Graph Colouring Daniel Porumbel PhD student (joint work with Jin Kao Hao and Pascale Kuntz) Laboratoire d’Informatique.

1 Welcome to G53ASD AUTOMATED SCHEDULING Lecturer: Dr. Sanja Petrovic School of Computer Science and Information Technology The.

Ant colony algorithm Ant colony algorithm mimics the behavior of insect colonies completing their activities Ant colony looking for food Solving a problem.

Genetic Algorithms for Bin Packing Problem Hazem Ali, Borislav Nikolić, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad Ali Awan.

R Bai, EK Burke and G Kendall Speaker: Ufo

Reporter : Mac Date : Multi-Start Method Rafael Marti.

Ant Colony Optimization Optimisation Methods. Overview.

Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.

A study of heuristic combinations for hyper- heuristic systems for the uncapacitated examination timetabling problem Kuo-Hsien Chuang 2009/02/24.

Ant Colony Optimization to Resource Allocation Problems Peng-Yeng Yin and Ching-Yu Wang Department of Information Management National Chi Nan University.

Graph Coloring.

Ant Colony Optimization (ACO): Applications to Scheduling

1 IE 607 Heuristic Optimization Ant Colony Optimization.

Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.

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

CSE 589 Applied Algorithms Spring Colorability Branch and Bound.

Lecture: 5 Optimization Methods & Heuristic Strategies Ajmal Muhammad, Robert Forchheimer Information Coding Group ISY Department.

SWORDS 2004 Ant Colony Optimisation Dr Jonathan Thompson, School of Mathematics, Cardiff University.

Metaheuristics Meta- Greek word for upper level methods

NEW HEURISTIC FOR THREE DIMENSIONAL STRIP PACKING PROBLEM Ha Thai Duong Supervisor: Edmund Burke, Graham Kendall.

Nelishia Pillay School of Mathematics, Statistics and Computer Science University of KwZulu-Natal

Genetic Algorithms and Ant Colony Optimisation

Graph Coloring with Ants

Swarm Computing Applications in Software Engineering By Chaitanya.

COSC 4426 Topics in Computer Science II Discrete Optimization Good results with problems that are too big for people or computers to solve completely

Foundations of Discrete Mathematics

Algorithms and their Applications CS2004 ( ) Dr Stasha Lauria 11.1 Applications, Introduction and Parameter Optimisation.

TECH Computer Science NP-Complete Problems Problems  Abstract Problems  Decision Problem, Optimal value, Optimal solution  Encodings  //Data Structure.

Resource Constrained Project Scheduling Problem. Overview Resource Constrained Project Scheduling problem Job Shop scheduling problem Ant Colony Optimization.

Ant colony algorithm Ant colony algorithm mimics the behavior of insect colonies completing their activities Ant colony looking for food Solving a problem.

1 Contents 1. Statement of Timetabling Problems 2. Approaches to Timetabling Problems 3. Some Innovations in Meta-Heuristic Methods for Timetabling University.

Inga ZILINSKIENE a, and Saulius PREIDYS a a Institute of Mathematics and Informatics, Vilnius University.

Solving of Graph Coloring Problem with Particle Swarm Optimization Amin Fazel Sharif University of Technology Caro Lucas February 2005 Computer Engineering.

1 An Approach to Accelerate Heuristic for Exam Timetabling Jiawei Li (Michael)

Tansel Dökeroğlu, Ph.D. July, 2015

Simon Model of Decision Making

Tutorial: Hyper-heuristics and computational Intelligence

Optimization Problems

Put a different number in each circle (1 to 8) such that adjacent circles cannot take consecutive numbers.

CSE & CSE6002E - Soft Computing Winter Semester, 2011 Course Review.

Ferdowsi University of Mashhad 1 Automatic Semantic Web Service Composition based on owl-s Research Proposal presented by : Toktam ghafarian.

Asst. Prof. Dr. Ahmet ÜNVEREN, Asst. Prof. Dr. Adnan ACAN.

1 Revision Main textbooks: Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, Scheduling,

1 Microarray Clustering. 2 Outline Microarrays Hierarchical Clustering K-Means Clustering Corrupted Cliques Problem CAST Clustering Algorithm.

Biologically Inspired Computing: Indirect Encodings, and Hyperheuristics This is DWC’s lecture 7 for `Biologically Inspired Computing’ Contents: direct.

Prims Algorithm for finding a minimum spanning tree

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

CS 1010– Introduction to Computer Science Daniel Tauritz, Ph.D. Associate Professor of Computer Science Director, Natural Computation Laboratory Academic.

Graph Coloring.

Discrete ABC Based on Similarity for GCP

A Backtracking Correction Heuristic

RESEARCH APPROACH.

Advanced Artificial Intelligence Evolutionary Search Algorithm

Presented by: Sameer Kulkarni

metaheuristic methods and their applications

Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?

Multi-Objective Optimization

“Hard” Optimization Problems

Overview of SWARM INTELLIGENCE and ANT COLONY OPTIMIZATION

Ant Colony Optimization

Graph Coloring.

Algorithms Lecture # 27 Dr. Sohail Aslam.

Presentation transcript:

Ant Colony Hyper-heuristics for Graph Colouring Nam Pham ASAP Group, Computer Science School University of Nottingham

Nam Pham Overview Hyper-heuristic Framework Problem Description Hyper-heuristic design for the problem An ant colony hyper-heuristic approach and experimental results Future works

Nam Pham Hyper-heuristic “Heuristics that choose heuristics”  High level heuristics: Meta-heuristics Choice Function Ant Algorithm Case-based Reasoning …  Low level heuristics: different moving strategies, constructive heuristics …

Nam Pham Hyper-heuristic Framework

Nam Pham Graph Colouring Problem Assignment of “colours” to vertices in a graph Adjacent vertices have different colours Objective: minimise the number of required colours

Nam Pham Hyper-heuristic Design Constructive hyper-heuristics Search for sequence of heuristics [Ross 2002] Each heuristic is applied for colouring one vertex Evaluation function is defined as the number of required colours when applying heuristic sequence

Nam Pham Graph Example Heuristic 1 (H1) Heuristic 2 (H2) Heuristic 3 (H3)

Nam Pham Search Space of Heuristic Sequences We are looking for a heuristic sequence that produces smallest number of used colours Decisions H 1 H 2 H 3 Sequence

Nam Pham Ant Colony Hyper-heuristics Ant algorithms are well-known if used as low level heuristics There are only two papers using ant algorithms as hyper-heuristics so far (reference at the end)

Nam Pham Ant Colony Hyper-heuristics Ant algorithm is well-known if used as a low level heuristic There are only two papers using ant algorithm as hyper-heuristic so far (reference at the end)

Nam Pham Ant Colony Hyper-heuristics Ant algorithm is well-known if used as a low level heuristic There are only two papers using ant algorithm as hyper-heuristic so far (reference at the end)

Nam Pham Ant Colony Hyper-heuristics Ant algorithm is well-known if used as a low level heuristic There are only two papers using ant algorithm as hyper-heuristic so far (reference at the end)

Nam Pham Experiment Heuristics employed include:  Largest Degree First (LD)  Largest Colour Degree First (LCD)  Least Saturation Degree First (SD) University of Toronto Benchmark Data ftp://ftp.mie.utoronto.ca/pub/carter/testprob ftp://ftp.mie.utoronto.ca/pub/carter/testprob

Nam Pham Results LDLCDSDAnt Algorithm HHBest known Car Car Ear Hec Kfu Lse Pur Rye Sta8313 Tre Uta Ute9210 Yor

Nam Pham Future works Compare ant colony hyper-heuristic with other population based hyper-heuristics – evolutionary algorithms, genetic algorithm, swarm intelligence… Do research on characteristics of heuristic search space Expand to exam timetabling problem

Nam Pham Reference Burke, E.K., Kendall, G., Landa Silva, J.D., O'Brien, R.F.J., Soubeiga, E.: An ant algorithm hyperheuristic for the project presentation scheduling problem. Cuesta-Cañada, A., Garrido, L., Terashima-Marín, H.: Building Hyper-heuristics Through Ant Colony Optimization for the 2D Bin Packing Problem.