GenMRP Generating Optimized MRP Lot Sizes Using Genetic Algorithm: Considering Supplier Deals Generating Optimized MRP Lot Sizes Using Genetic Algorithm:

Slides:



Advertisements
Similar presentations
Crew Pairing Optimization with Genetic Algorithms
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Genetic Algorithms Vida Movahedi November Contents What are Genetic Algorithms? From Biology … Evolution … To Genetic Algorithms Demo.
CS6800 Advanced Theory of Computation
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Fractal Element Antenna Genetic Optimization Using a PC Cluster ACES Proceedings March 21, 2002 Monterey, CA.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Genetic Algorithm for Variable Selection
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory , Doshisha University , Kyoto Japan.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms by using MapReduce
1 Material Requirements Planning or as we in the business like to call it - MRP Constrained Lot Sizing.
Meta Optimization Improving Compiler Heuristics with Machine Learning Mark Stephenson, Una-May O’Reilly, Martin Martin, and Saman Amarasinghe MIT Computer.
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.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Optimal resource assignment to maximize multistate network reliability for a computer network Yi-Kuei Lin, Cheng-Ta Yeh Advisor : Professor Frank Y. S.
S J van Vuuren The application of Genetic Algorithms (GAs) Planning Design and Management of Water Supply Systems.
Fuzzy Genetic Algorithm
Richard Patrick Greer.  The Neonatal ICU in Providence Alaska Medical Center would like a scheduling system to assign nurses to babies based on numerous.
Exact and heuristics algorithms
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
Neural Networks And Its Applications By Dr. Surya Chitra.
CONCLUSIONS GA technique was implemented to find the optimal water network topology together with the minimum fresh water consumption, observing for each.
Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.
(Genetic Algorithm Interface Architecture) Final Presentation CS 425 Created By: Chuck Hall Simone Connors Héctor Aybar Mike Grim.
Enterprise Resource planning. Example Imagine that you organize a party by next month to celebrate your birthday, and analyze the things you do for that.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.
Applications of Genetic Algorithms By Harry Beddo 3 rd Quarter.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
ICT 1 A heuristic for maritime inventory routing Oddvar Kloster, Truls Flatberg Jyväskylä,
Genetic Algorithms. Solution Search in Problem Space.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Genetic Algorithm (Knapsack Problem)
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Example: Applying EC to the TSP Problem
V. How Does Evolution Work?
Bin Packing Optimization
Genetic Algorithms CPSC 212 Spring 2004.
رایانش تکاملی evolutionary computing
Example: Applying EC to the TSP Problem
Multi-Objective Optimization
Introduction to Scheduling Chapter 1
We need something new Tyson Kendon © 2007.
Md. Tanveer Anwar University of Arkansas
V. How Does Evolution Work?
Presentation transcript:

GenMRP Generating Optimized MRP Lot Sizes Using Genetic Algorithm: Considering Supplier Deals Generating Optimized MRP Lot Sizes Using Genetic Algorithm: Considering Supplier Deals Nipuna Thanura Udakara Rathnayake GenMRP 1 Supervised By Dr. S.D. Dewasurendra Mr. Lakshika Rajakaruna (IFS)

Material Requirements Planning (MRP) The production planning, scheduling, and inventory control system Used to manage manufacturing processes Answers the problems of: When to buy? What quantity? GenMRP 2

3 Genetic Algorithms (GA)  A search heuristic algorithm  Mimics the process of natural evolution Survival of the fittest  Ideal for highly constrained problems similar to MRP

Minimizes the total cost by deciding suitable suppliers and lot-sizes. GenMRP What is GenMRP? 4

Generates optimized MRP solutions Considers  supplier discounts/deals  storage capacity limitations  Transportation/ Holding Costs Answers From whom to buy? When to buy? What quantity should be bought? A genetic algorithm is used GenMRP 5

Related Work 1.“MRP Lot Sizing Using Genetic Algorithms” L. Q. D.J Stockton, BPICS CONTROL, 1993 initial efforts 2.“Applying Genetic Algorithms for Inventory Lot-Sizing Problem with Supplier Selection under Storage Capacity Constraints” C. Woarawichai, K. Kuruvit, Paitoon V.,2012 Has high relevance to ours AiPlAN: Advanced Production Planning System GenMRP 6

Methodology Chromosome Sx = Supplier Q = Order Quantity Planned Order Release (POR) 7

GenMRP Algorithm Flow 8 Initial Population Initial Population Population Population Calculate Fitness Calculate Fitness Validation Validation Sorting Sorting Cross over Cross over Mutation Mutation Elite 10% Elite 10%

GenMRP Algorithm Flow 9 Initial Population  90% of the population is randomly filled  10% of the population is filled with quantities from Planned Order Release (POR)  POR doesn’t have suppliers  Suppliers are randomly filled Calculate Fitness Get the inverse of the total cost as the fitness Initial Population Population Calculate Fitness Validation Sorting Cross over Mutation Elite 10% Validation Check whether the solution can fulfill the demand. Sort by Fitness Simple insertion sort Elitism Allow the best 10% from the current generation to carry over to the next, unaltered.

GenMRP Results 10

GenMRP Results 11

GenMRP Conclusion  This project present a method to get an optimized solution to multi-level, multi-product MRP problem From whom to buy? When to buy ? What quantity should be bought?  More cost functions can be added directly to the database  Parallel computing is being implemented  This project is a continuation of an IFS project (by Mr. Lakshika Rajakaruna) 12

Thank You! GenMRP13

GenMRP Extra 14