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

Slides:



Advertisements
Similar presentations
Department of Electronic Engineering NUIG Direct Evolution of Patterns using Genetic Algorithms By: John Brennan Supervisor: John Maher.
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Variable Neighborhood Search for Bin Packing Problem Borislav Nikolić, Hazem Ismail Abdel Aziz Ali, Kostiantyn Berezovskyi, Ricardo Garibay Martinez, Muhammad.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
CSM6120 Introduction to Intelligent Systems Evolutionary and Genetic Algorithms.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
CHAPTER 9 E VOLUTIONARY C OMPUTATION I : G ENETIC A LGORITHMS Organization of chapter in ISSO –Introduction and history –Coding of  –Standard GA operations.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Reporter : Mac Date : Multi-Start Method Rafael Marti.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Algorithms: A Tutorial
Heuristic Optimization Methods
Introduction to Genetic Algorithms. 2 Abstract An introduction to emulating the problem solving according to nature's method: via evolution, selective.
Genetic Algorithm.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Genetic Algorithms Authors: Aleksandra Popovic, Drazen Draskovic, Veljko Milutinovic,
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
1 Genetic Algorithms “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations.
Optimization with Genetic Algorithms Walter Reade October 31, 2002 TAG Meeting.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows Michel Toulouse 1,2 Teodor Gabriel Crainic 2 Phuong Nguyen 2 1 Oklahoma.
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Evolutionary Algorithms K. Ganesh Research Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
GENETIC ALGORITHMS Tanmay, Abhijit, Ameya, Saurabh.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Genetic Algorithms. Solution Search in Problem Space.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Breeding Swarms: A GA/PSO Hybrid 簡明昌 Author and Source Author: Matthew Settles and Terence Soule Source: GECCO 2005, p How to get: (\\nclab.csie.nctu.edu.tw\Repository\Journals-
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Using GA’s to Solve Problems
Meta-heuristics Introduction - Fabien Tricoire
School of Computer Science & Engineering
An evolutionary approach to solving complex problems
Neuro-Computing Lecture 6
Basics of Genetic Algorithms (MidTerm – only in RED material)
Genetic Algorithms: A Tutorial
Multi-Objective Optimization
Dr. Unnikrishnan P.C. Professor, EEE
Basics of Genetic Algorithms
Traveling Salesman Problem by Genetic Algorithm
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Population Based Metaheuristics
Genetic Algorithms: A Tutorial
Presentation transcript:

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

Outline Introduction – Non-Population Metaheuristics – Population Metaheuristics Genetic Algorithims (GA) Scientific Paper on GA ”A New Design of Genetic Algorithm for Bin Packing”

Introduction On the last session we discussed:  Local search (LS) and Heuristics  Metaheuristics  Examples of metaheuristics: VNS GRASP, SA, TS Genetic Algorithms (GA) What is the difference?

Non-Population Metaheuristics Initial phase = single solution New solutions -> perturbations Less complexity and computational time

Population Metaheuristics Initial phase = group of solutions New solutions : – Recombining (Crossover) – Perturbations (Mutation) More complex Tradeoff Complexity and performance

Population Vs. Non-population Metaheuristics Pobulation MetaheuristicsNon-Pobulation Metaheuristics Population of size MPopulation of size 1 Recombining and PerturbationsOnly perturbations ComplexLess complex Examples:  Particle Swarm Optimization (PSO)  Ant Colonies (AC)  Genetic Algorithms (GA)

Genetic Algorithms (GA) - Overview Based on biological evolution Developed by John Holland, University of Michigan (1970’s) – To understand the adaptive processes of natural systems – To design artificial systems software that retains the robustness of natural systems

Genetic Algorithms (GA) - Overview “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions you might not otherwise find in a lifetime.” Salvatore Mangano - Computer Design, May 1995 Efficient, effective techniques : – Optimization – Machine learning applications Widely-used : – Business – Scientific – Engineering

Genetic Algorithms (GA) – Basic Components Encoding technique Initialization procedure Evaluation function Selection of parents Genetic operators Parameter settings

Genetic Algorithms (GA) – Basic Components Encoding technique

Genetic Algorithms (GA) – Basic Components Initialization procedure

Genetic Algorithms (GA) – Basic Components Evaluation function 90% 61% 77% 81% 20% 10% 87% 35% 74% 55% 5% 46% 67% 41% 31% 88% 11% 99% 55% 12% 99% 89%

Genetic Algorithms (GA) – Basic Components Selection of parents 90% 61% 77% 81% 20% 10% 87% 35% 74% 55% 5% 46% 67% 41% 31% 88% 11% 99% 55% 12% 99% 89%

Genetic Algorithms (GA) – Basic Components Genetic operators

Genetic Algorithms (GA) – Basic Components Parameter settings

Advantages of GA Easy to understand Modular & Flexible, separate from application Supports multi-objective optimization Good for “noisy” environments Always an answer; gets better with time Inherently parallel; easily distributed Many ways to speed up and improve Easy to exploit previous or alternate solutions

Scientific Paper on GA A New Design of Genetic Algorithm for Bin Packing By Hitoshi IimaTetsuya Yakawa Kyoto Institute of Technology, Japan, Published on 2003

Scope Presenting a new design of GA for solving 1D BPP FF and MBS hueristics are used Effective and outperform TABU & VNS Next slides explains: – GA for BPP – Results

GA for BPP Encoding Phase: (1,3,10) g1: (1,3,10) (2,3,5) (2,4,6) – Gene: – Genotype:

GA for BPP Initialization Procedure: – FF hueristic is used to generate the initial population (genotypes) P1: ( 1,3,20 ) (2,9,11) (5,7,13,15) (4,6,14) (8,12) P2: (3,4,12,15) (6,7,11) (9,20) (1,5,8) (2,13,14) Selection of Parents: – Two parents selected randomly

GA for BPP Genetic operators: Crossover: P1: ( 1,3,20 ) (2,9,11) (5,7,13,15) (4,6,14) (8,12) P2: (3,4,12,15) (6,7,11) (9,20) (1,5,8) (2,13,14) O1O2 O1: (2,9,11) (4,6,14)(1,5,8) Ta: (7) (20) (13) Tb: (3,12,15) (7,20) (7,13) (20,13) Tc (2) (9) (11) (2,9) (2,11) (9,11) (2,9,11) S1 O1: (2,7,9,13) (4,6,20)(1,5,8) Ta: (11) (14) Tb: (3,12,15) T O1: (2,7,9,13) (4,6,20)(1,5,8,14) (3,11,12,15) FF & MBS’ applied Replacement:

GA for BPP Genetic operators: Mutation: P1: ( 1,3,20 ) (2,9,11) (5,7,13,15) (4,6,14) (8,12) P2: (3,4,12,15) (6,7,11) (9,20) (1,5,8) (2,13,14) O3 O4 O3: (2,9,11) (4,6,14) (1) (3) (5) (7) (8) (20) (12) (13) (1,3) (1,5) (1,7) (1,8). Tc (2) (9) (11) (2,9) (2,11) (9,11) (2,9,11) S1 Tm Apply the same replacement procedure Replacement:

GA for BPP GA Outline: – Generate the initial population – Pick up two solutions x 1 and x 2 – Generate two solutions x 3 and x 4 by crossover – Generate two solutions x 5 and x 6 by mutation – Select the best two solutions {x 1,...,x 6 } – Discard x 1, x 2 from initial population – Add the two best solutions to the new generation – Repeat

Experiment and Results Data SetGAVNSBISON No. of optimal solutions Data SetGAVNSBISON Average absolute deviation (ad) Data SetGAVNSBISON Average relative deviation (rd)

Conclusion New GA design that suits well BPP Genetic operators designed in such a way that offsprings inheret parents characteristics FF and MBS´used to enhance the obtained results Better performance over VNS & TABU