AUTOMATED LAYOUT DESIGN PROGRAM (ALDEP)

Slides:



Advertisements
Similar presentations
STATISTICS.
Advertisements

Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
Introduction to Bioinformatics
Computerized Block Layout Algorithms: ALDEP, CRAFT, MCRAFT
INTEGRALS 5. INTEGRALS We saw in Section 5.1 that a limit of the form arises when we compute an area.  We also saw that it arises when we try to find.
Dynamic Programming1. 2 Outline and Reading Matrix Chain-Product (§5.3.1) The General Technique (§5.3.2) 0-1 Knapsack Problem (§5.3.3)
Continuous Random Variables and Probability Distributions
Lesson 6. Refinement of the Operator Model This page describes formally how we refine Figure 2.5 into a more detailed model so that we can connect it.
Copyright © Cengage Learning. All rights reserved. 5 Integrals.
Sequencing Problem.
COMPUTERIZED METHODS OF LAYOUT DESIGN
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
Mathematics.
Graphing Linear Equations
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Simpson Rule For Integration.
FACILITY LAYOUT PROBLEM
CS433: Modeling and Simulation Dr. Anis Koubâa Al-Imam Mohammad bin Saud University 15 October 2010 Lecture 05: Statistical Analysis Tools.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Facility Design-Week 8 BASIC ALGORITHMS FOR THE LAYOUT PROBLEM
Facility Layout 6 MULTIPLE, Other algorithms, Department Shapes.
Facility Design-Week 9 Computerized Layout Planning
Integration Copyright © Cengage Learning. All rights reserved.
Vectors and Matrices In MATLAB a vector can be defined as row vector or as a column vector. A vector of length n can be visualized as matrix of size 1xn.
COMPUTERIZED RELATIONSHIP LAYOUT PLANNING (CORELAP)
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
Writing Program Code in BASIC Write a program to prompt for and accept values into TWO variables, numx and numy. The program should square the value stored.
Computerized Block Layout Algorithms: BLOCPLAN, MULTIPLE
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Computer Aided Layout Manual
Mechanical Engineering Department 1 سورة النحل (78)
Statistical Process Control
Basic Algorithms and Software for the Layout Problem
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 29 Nov 11, 2005 Nanjing University of Science & Technology.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Algorithm Discovery and Design Objectives: Interpret pseudocode Write pseudocode, using the three types of operations: * sequential (steps in order written)
Dynamic Programming1. 2 Outline and Reading Matrix Chain-Product (§5.3.1) The General Technique (§5.3.2) 0-1 Knapsack Problem (§5.3.3)
Lecture # 15. Mealy machine A Mealy machine consists of the following 1. A finite set of states q 0, q 1, q 2, … where q 0 is the initial state. 2. An.
Stat 101Dr SaMeH1 Statistics (Stat 101) Associate Professor of Environmental Eng. Civil Engineering Department Engineering College Almajma’ah University.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
BASIC FACILITY LOCATION PROBLEMS Facility location problems deal with the question of where to place facilities & how to assign customers Location analysis.
Section 7.6 Functions Math in Our World. Learning Objectives  Identify functions.  Write functions in function notation.  Evaluate functions.  Find.
1 Chapter 8 The Discrete Fourier Transform (cont.)
Econ 110: Sampling Theory and Statistical Inference In Economics 2 nd semester 2016 richard makoto Economics Department University of Zimbabwe Normal Distribution.
Neural networks.
Virtual University of Pakistan
Department of Mathematics
Gauss-Siedel Method.
CS 352 Introduction to Logic Design
Identifying quadratic functions
EXAMPLE 4 Check data for inverse variation
Unsigned Multiplication
MATS Quantitative Methods Dr Huw Owens
Measure of precision - Probability curve shows the relationship between the size of an error and the probability of its occurrence. It provides the most.
5.4 Finding Probabilities for a Normal Distribution
Copyright © Cengage Learning. All rights reserved.
Vectors and Matrices In MATLAB a vector can be defined as row vector or as a column vector. A vector of length n can be visualized as matrix of size 1xn.
COMPUTATIONAL THINKING COMPUTATIONAL THINKING IN PROGRAMMING
MACHINE GROUPING IN CELLULAR MANUFACTURING With Reduction Of Material Handling As the Objective 19/04/2013 lec # 25 & 26.
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
Facilities Planning and Design Course code:
Numerical Integration
UMBC CMSC 104 – Section 01, Fall 2016
Finite Automaton with output
Labor Assignments In either job or Batch production systems, the problem is to determine the number of workers needed in each station to achieve the required.
Presentation transcript:

AUTOMATED LAYOUT DESIGN PROGRAM (ALDEP) ALDEP is basically a construction algorithm, but it can also be used to evaluate two layouts It uses basic data on facilities & builds a layout by successively placing the layout using relationship information b/w the departments 25/03/2013 lec no. 13 & 14

AUTOMATED LAYOUT DESIGN PROGRAM (ALDEP)…cont… Basic Inputs to ALDEP: Length & width of facility Area of each department Minimum Closeness Preference (MCP) Value Sweep width Relationship chart showing the closeness rating Location & size of any restricted area 25/03/2013 lec no. 13 & 14

AUTOMATED LAYOUT DESIGN PROGRAM (ALDEP)…cont… Procedure Adapted for using ALDEP : Step#01: Input the following Length & width of facility Area of each department Minimum Closeness Preference (MCP) Value Sweep width Relationship chart showing the closeness rating Location & size of any restricted area 25/03/2013 lec no. 13 & 14

AUTOMATED LAYOUT DESIGN PROGRAM (ALDEP)…cont… Procedure Adapted for using ALDEP : Step#2: One department is selected randomly & placed in the layout Step#3: In this step, the algorithm uses minimum closeness required b/w departments for the selection of departments to be placed with an earlier placed department. Select the department having maximum closeness rating. If there is no department having minimum closeness preference then any dept that remains to be placed is selected 25/03/2013 lec no. 13 & 14

AUTOMATED LAYOUT DESIGN PROGRAM (ALDEP)…cont… Procedure Adapted for using ALDEP : Step#4: If all the departments are placed in the layout, go to step#5. else go to step#3 Step#5: Compute the total score of the layout Step#6: If the total score required is acceptable score, then go to step#7, else go to step#2 Step#7: Print the current layout & the corresponding score 25/03/2013 lec no. 13 & 14

ALDEP: ILLUSTRATIVE Example Example 2: Develop a layout for the following problem. Layout & area requirements are shown in Table2.1 Table.2.1 Department Area (sq.ft) No. of unit squares 1 1200 30 2 800 20 3 600 15 4 5 6 7 Total 7000 175 25/03/2013 lec no. 13 & 14

ALDEP: ILLUSTRATIVE Example Solution: Assume One square in the layout to be equal 40 sq.ft. No. of unit squares for dept = dept.area in sq.ft/area per square Let the size of layout be 15x12, & the sweep width be 2 (this means that we will fill 2 columns simultaneously). The Relationship chart for the example is follows: Department 1 2 3 4 5 6 7 E O I U A 25/03/2013 lec no. 13 & 14

ALDEP: ILLUSTRATIVE Example Solution: Let department 2 be selected. Number of unit squares in dept 1 be 20. now 20 square units are filled in 15 x 12 grid as shown in table2.2 Since minimum closeness b/w departments required for selection of department is I=4 Scan the relationship chart randomly to find the departments having closeness rating of 4 or greater with department 2 25/03/2013 lec no. 13 & 14

ALDEP: ILLUSTRATIVE Example Solution: For the above case closeness rating for the pairs (1-2)=16, (2-5)=4, & (2-6)=4 Select any dept, say dept 1. Place dept 1 in the layout in a serpentine pattern as shown in table 2.3 Repeat the above procedure to get the final layout as shown in table 2.4 25/03/2013 lec no. 13 & 14

ALDEP: ILLUSTRATIVE Example Solution: After the final layout is obtained, the score is calculated. The score is the sum of the closeness ratings of all the neighboring departments, see table 2.5 From the above layout the score is 2 x110 = 220 A further iteration should be carried out to check if a better score can be achieved 25/03/2013 lec no. 13 & 14