PROJECT LM-01 Presentation 16 Oct 2006 University of Wollongong, Australia.

Slides:



Advertisements
Similar presentations
Artificial Bee Colony Algorithm
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
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Chapter 12 INTERACTION DESIGN IN PRACTICE. Overview AgileUX Design Patterns Open Source Resources Tools for Interaction Design
FOREST PLANNING USING PSO WITH A PRIORITY REPRESENTATION P.W. Brooks and W.D. Potter Institute for Artificial Intelligence, University of Georgia, USA.
Artificial Bee Colony Algorithm
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Ant Colony Optimization. Brief introduction to ACO Ant colony optimization = ACO. Ants are capable of remarkably efficient discovery of short paths during.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Basic concepts of Data Mining, Clustering and Genetic Algorithms Tsai-Yang Jea Department of Computer Science and Engineering SUNY at Buffalo.
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.
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Agile Process: Overview n Agile software engineering represents a reasonable compromise to conventional software engineering for certain classes of software.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Ant Colony Optimization (ACO): Applications to Scheduling
Ant colony optimization algorithms Mykulska Eugenia
Project Proposal: Academic Job Market and Application Tracker Website Project designed by: Cengiz Gunay Client: Cengiz Gunay Audience: PhD candidates and.
Genetic Algorithm.
CSM6120 Introduction to Intelligent Systems Other evolutionary algorithms.
Genetic Algorithms and Ant Colony Optimisation
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
1 The Initial Report Preparation Guidelines. 2 The Initial Report u Definition of project scope u Project aims and objectives u Initial project plan.
Outline of a Course on Computational Intelligence Claudio Moraga University of Dortmund Germany JEP Bitola Workshop December 2003
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Swarm Computing Applications in Software Engineering By Chaitanya.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
Swarm Intelligence 虞台文.
Spacetime Constraints Revisited Joe Marks J. Thomas Ngo Using genetic algorithms to find solutions to spacetime constraint problems in 2D.
1 The Euclidean Non-uniform Steiner Tree Problem by Ian Frommer Bruce Golden Guruprasad Pundoor INFORMS Annual Meeting Denver, Colorado October 2004.
(Particle Swarm Optimisation)
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Introduction to Making Multimedia
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.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Chapter 6 CASE Tools Software Engineering Chapter 6-- CASE TOOLS
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.
SwinTop: Optimizing Memory Efficiency of Packet Classification in Network Author: Chen, Chang; Cai, Liangwei; Xiang, Yang; Li, Jun Conference: Communication.
Introduction Metaheuristics: increasingly popular in research and industry mimic natural metaphors to solve complex optimization problems efficient and.
ANALYSIS PHASE OF BUSINESS SYSTEM DEVELOPMENT METHODOLOGY.
Neural Networks And Its Applications By Dr. Surya Chitra.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Using GA’s to Solve Problems
Genetic Algorithms.
Discrete ABC Based on Similarity for GCP
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Presenter: Randy Hunt Presenter: Vitaliy Krestnikov
Bin Packing Optimization

Chapter 10 Development of Multimedia Project
Agile Process: Overview
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
Artificial Bee Colony Algorithm
M. Kezunovic (P.I.) S. S. Luo D. Ristanovic Texas A&M University
Presentation transcript:

PROJECT LM-01 Presentation 16 Oct 2006 University of Wollongong, Australia

Agenda 1. Project Team 2. Project Requirements 3. Proposal 4. Project Management 5. Project Product 6. Project Demo 7. Q&A Session University of Wollongong, Australia

Project Team KHO PUAY MENG KOH MENG HONG NG CHIOU YOONG YIP CHEW HONG University of Wollongong, Australia

Project Requirements Project Title: “ NEST (or HIVE: A simulator of life in and around an ant (bee) nest (hive). (Group of 3 to 4 Students) “ ~ Quoted University of Wollongong, Australia

Project Requirements OBJECTIVE: “ The group should choose a colony creature; probably either an ant or a bee, and model the nest or hive life. This should include aspects such as building, foraging and patrolling, where such behaviours are typical. Specific species habits, such as bee swarming should also be modelled. Interactions with their physical environment will need to be considered too, including such things as the effect of rain and other weather. There will need to be a fair amount of research into behaviour patterns of the chosen creature. There are many different species of ants, and allowing flexibility for behaviours differing between species would be useful, and shouldn’t be too difficult. The expectation is to provide a graphical simulation, although some useful textual reports should also be provided by the software. “ ~ Quoted University of Wollongong, Australia

Proposal Study Subject: Colony Creature: Honey Bee Literature Review & Research on Honeybee University of Wollongong, Australia

Proposal Solution: Model Honeybee population growth in dynamic data Provide Graphical Simulation on Bee behaviors such as: Building Scouting Foraging Patrolling Swarming Attack behaviors

Project Management Bee Hive Simulator University of Wollongong, Australia

Project Management Schedule Methodology Tools Documentation Delivery University of Wollongong, Australia

Schedule Total duration: <5 months Dates: 21 Jun ~ 16 Oct 2006 University of Wollongong, Australia

Methodology Dynamic System Development Method (DSDM) Define as a framework for an iterative and incremental approach to the development of Information Systems. Timeboxing Schedule for Reviews University of Wollongong, Australia

DSDM Why use DSDM to manage Team? Active User Involvement Development is iterative, driven by user feedback All changes are reversible Testing throughout life cycle

DSDM Timeboxing format “MoSCoW” classification Example: University of Wollongong, Australia

Tools Communication Media: Teleconference using Skype, Netmeeting Chat online with MSN, Yahoo, GoogleTalk WebMail on Hotmail, Gmail, Yahoo Mail Feedback via Project Forum Update status via Project Website University of Wollongong, Australia

Documentation Type of documents Versioning Format Revision Procedure University of Wollongong, Australia

Documentation Type of Documents include: Initial Submission: Project Proposal (CR) Project Schedule (CR) Fortnightly Submission: Project Diary (CR) Final Submission: Final Report Technical Report (CR) Test Report (CR) User Manual (CR) University of Wollongong, Australia

Documentation Versioning Format Example: University of Wollongong, Australia

Documentation Change Management Control Procedure Initial Version Edit Document Document Update? Version X change University of Wollongong, Australia

Delivery Documentation Product (Software Application) MPEG Video Installation CD Source Code User Manual* University of Wollongong, Australia

Project Product Bee Hive Simulator University of Wollongong, Australia

Project Product Product Overview Genetic Algorithm (GA) Defintion Implementation Applications University of Wollongong, Australia

Product Overview Product Name: Bee Hive Simulator Period complete: 4mths Version: Purpose: This software is a simulator on Honeybees’ network life cycle. This simulator will include aspects, such as building, scouting, foraging and patrolling. It may also include Honeybees' behavior and habits, such as bee swarming, and how honeybees interact with their physical environment, e.g. the effect of pesticides. The goal is to provide a graphical simulation, with some useful textual reports which it will be help to illustrate honeybee life cycle. University of Wollongong, Australia

Product Overview Main Features: Graphical Simulation Genetic Algorithms Technique (GA) Generate Report

Product Overview Target Audience Researchers Students Bee Farmers University of Wollongong, Australia

Genetic Algorithm What is Genetic Algorithm? In short, it is called GA A search technique used in computer science to find approximate solutions to optimization and search problems. University of Wollongong, Australia

Genetic Algorithm How is GA implemented? Problem Modeling Using Chromosomes and Genes to represent Food Source Selecting Best Food Source Combination Base on Highest Fitness Value E.g Food Index : 3Water Index : 1 Chromosome A

Genetic Algorithm Fitness Function Assign and evaluate chromosome fitness value Based on defined constraints Food Quality (Sugar Lvl > 30%) Food Availability (Nectar & Pollen Quantity) Food Range Obstacles

Genetic Algorithm GA Operators Include: Mutation Crossover

Genetic Algorithm Mutation Food Index : 1Water Index : 1 Food Index : 1Water Index : 3 Chromosome A Before Mutation After Mutation

Genetic Algorithm Crossover Food Index : 1Water Index : 3 Parent A Before Crossover Food Index : 2Water Index : 4 Parent B After Crossover Food Index : 1Water Index : 4 Offspring A Food Index : 2Water Index : 3 Offspring B

Genetic Algorithm

Project Demo Bee Hive Simulator University of Wollongong, Australia

Q & A Feel free to ask us… University of Wollongong, Australia

End Of Presentation THANK YOU! University of Wollongong, Australia

Applications Foraging Understand routing behaviors in the network using GA By changing the constraints used in the fitness function, we can obtain the best routing routes to a certain specified destination Constraints to be consider:- Routing Distance Router’s Capacity Bandwidth of Network File Size

Future Enhancement Dynamic Selection Of Best Food Source Simulating Bees Behavior Under Extreme Weather Condition (Below 8 Degrees Celsius) Graphical Statistic Report (E.g Lines Graph or Bar Chart) And more…

MoSCoW MoSCoW stands for: M - MUST have this. S - SHOULD have this if at all possible. C - COULD have this if it does not affect anything else. W - WON'T have this time but WOULD like in the future.