Tata Letak Fasilitas Manufaktur D0394 Perancangan Sistem Manufaktur Kuliah Ke XXI - XXII.

Slides:



Advertisements
Similar presentations
Linear Time Methods for Propagating Beliefs Min Convolution, Distance Transforms and Box Sums Daniel Huttenlocher Computer Science Department December,
Advertisements

Design of the fast-pick area Based on Bartholdi & Hackman, Chpt. 7.
ECE 667 Synthesis and Verification of Digital Circuits
Size-estimation framework with applications to transitive closure and reachability Presented by Maxim Kalaev Edith Cohen AT&T Bell Labs 1996.
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Introduction to Algorithms
Activity relationship analysis
Optimization 吳育德.
Branch & Bound Algorithms
Vehicle Routing & Scheduling: Part 1
Linear Discriminant Functions Wen-Hung Liao, 11/25/2008.
Lectures on Network Flows
Planning under Uncertainty
Background: Scan-Based Delay Fault Testing Sequentially apply initialization, launch test vector pairs that differ by 1-bit shift A vector pair induces.
VLSI Layout Algorithms CSE 6404 A 46 B 65 C 11 D 56 E 23 F 8 H 37 G 19 I 12J 14 K 27 X=(AB*CD)+ (A+D)+(A(B+C)) Y = (A(B+C)+AC+ D+A(BC+D)) Dr. Md. Saidur.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 9 FACILITY LAYOUT E. Gutierrez-Miravete Spring 2001.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
CSE 550 Computer Network Design Dr. Mohammed H. Sqalli COE, KFUPM Spring 2007 (Term 062)
Lecture 11. Matching A set of edges which do not share a vertex is a matching. Application: Wireless Networks may consist of nodes with single radios,
1 IOE/MFG 543 Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
Chapter 12 Gaussian Elimination (II) Speaker: Lung-Sheng Chien Reference book: David Kincaid, Numerical Analysis Reference lecture note: Wen-wei Lin, chapter.
COMPUTERIZED METHODS OF LAYOUT DESIGN
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #6 Computerized Methodologies.
Clustering Unsupervised learning Generating “classes”
Advance Data Structure 1 College Of Mathematic & Computer Sciences 1 Computer Sciences Department م. م علي عبد الكريم حبيب.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Computational Optimization
Towers of Hanoi. Introduction This problem is discussed in many maths texts, And in computer science an AI as an illustration of recursion and problem.
ENCI 303 Lecture PS-19 Optimization 2
Design Techniques for Approximation Algorithms and Approximation Classes.
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
RNA Secondary Structure Prediction Spring Objectives  Can we predict the structure of an RNA?  Can we predict the structure of a protein?
Chapter 7 Transportation, Assignment & Transshipment Problems
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Facility Design-Week 8 BASIC ALGORITHMS FOR THE LAYOUT PROBLEM
Facility Layout 6 MULTIPLE, Other algorithms, Department Shapes.
Genome Rearrangements Unoriented Blocks. Quick Review Looking at evolutionary change through reversals Find the shortest possible series of reversals.
Practical Dynamic Programming in Ljungqvist – Sargent (2004) Presented by Edson Silveira Sobrinho for Dynamic Macro class University of Houston Economics.
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
Computerized Block Layout Algorithms: BLOCPLAN, MULTIPLE
Computational Intelligence: Methods and Applications Lecture 23 Logistic discrimination and support vectors Włodzisław Duch Dept. of Informatics, UMK Google:
BLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio CS 466 Saurabh Sinha.
Outline Introduction Minimizing the makespan Minimizing total flowtime
Basic Algorithms and Software for the Layout Problem
CS 8751 ML & KDDData Clustering1 Clustering Unsupervised learning Generating “classes” Distance/similarity measures Agglomerative methods Divisive methods.
Parallel Machine Scheduling
Chapter 10 Minimization or Maximization of Functions.
Heuristic Methods for the Single- Machine Problem Chapter 4 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R2.
Lagrangean Relaxation
Facility Layout 3 Non-computerized Block Layouts:
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
1 JOB SEQUENCING WITH DEADLINES The problem is stated as below. There are n jobs to be processed on a machine. Each job i has a deadline d i ≥ 0 and profit.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Generalized BPP Guido Perboli DAUIN - Politecnico di Torino.
BASIC FACILITY LOCATION PROBLEMS Facility location problems deal with the question of where to place facilities & how to assign customers Location analysis.
National Taiwan University Department of Computer Science and Information Engineering An Approximation Algorithm for Haplotype Inference by Maximum Parsimony.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
School of Computer Science & Engineering
Perancangan Sistem Manufaktur
The minimum cost flow problem
Lectures on Network Flows
Chapter 5. Optimal Matchings
Dr. Arslan Ornek IMPROVING SEARCH
Aviv Rosenberg 10/01/18 Seminar on Experts and Bandits
3.4 Push-Relabel(Preflow-Push) Maximum Flow Alg.
Multi-Objective Optimization
Boltzmann Machine (BM) (§6.4)
EE5900 Advanced Embedded System For Smart Infrastructure
Facilities Planning and Design Course code:
Presentation transcript:

Tata Letak Fasilitas Manufaktur D0394 Perancangan Sistem Manufaktur Kuliah Ke XXI - XXII

QAP Formulation Define, r ij = rate of item movement between departments i and j d rs = distance between locations r and s x ir = 1, if department i is assigned to location r; 0, otherwise du d 11 = 0 d 12 = 1 d 13 = 2 d 14 = 1 d 15 = 2 d 16 = 3

QAP Formulation Define, r ij = rate of item movement between departments i and j d rs = distance between locations r and s x ir = 1, if department i is assigned to location r; 0, otherwise z = total distance items move objective has quadratic form constraints are assignment contraints –every dept. to one location –every location one dept. Quadratic Assignment Problem

Solution Representation Represent a solution to the facility layout problem as a permutation vector a –a = (a(1), a(2), …, a(n)) Element a(i) represents the location to which department i is assigned –a(3) = 5 implies that department 3 is assigned to location 5

Solution Representation Represent a solution as a permutation vector a –Element a(i) represents the location to which department i is assigned –Example: a = (2, 4, 5, 3, 1, 6) location siteslayout design

Solution Representation Represent a solution as a permutation vector a –Element a(i) represents the location to which department i is assigned –Example: a = (2, 4, 5, 3, 1, 6) location sites layout design

Solution Evaluation Assume that the direction of flow is unimportant –So weight between departments i and j is w ij = r ij + r ji Assume distance matrix is symmetric Total flow cost is

Solution Evaluation Assume that the direction of flow is unimportant –So weight between departments i and j is w ij = r ij + r ji Assume distance matrix is symmetric Total flow cost is a = (2, 4, 5, 3, 1, 6); C(a) = Flow matrix (r ij )

Solution Evaluation Given a, the total cost for department k is given by What is the cost if the locations of departments u and v are exchanged? (a represents the new layout)

Pairwise Exchange

a = (2, 4, 5, 3, 1, 6) C(a) = 114 a = (2, 3, 5, 4, 1, 6) Exchange departments 2 and 4 C(a) = 104  C 24 (a) = 10

Pairwise Exchange If a least total cost assignment, a *, is found, then if any two departments are exchanged  C uv (a * )  0. –Necessary condition for a least total cost assignment –Not sufficient, in general, since k-way interchanges (k > 2) may improve the solution

Solution Generation Construction Heuristics –Begin with the basic problem data and build up a solution in an iterative manner General Procedure –Let, a(i) = 0 if department i has not been assigned to a location –Let, a(F) be the set of locations assigned to departments in set F 0. While  F  < n 1. select i  FA specification implementation requires 2. select r  a(F)particular rules for performing these steps 3. a(i)  r 4. F  F  {i} 5. End

Construction Heuristics Many reasonable rules are possible for steps 1 and 2. Consider, –Random department selection in step 1 –Minimize additional total cost for partial solution in step 2 Partial solution is (F, a(F)) with cost C(a(F)) If we augment the partial solution by assigning department k to location r, we obtain an increase in cost as follows

Construction Heuristics Specific Procedure 1. Randomly select i  {1,2,…,n} 2. a(i)  1 3. While  F  < n 4. Randomly select i  F 5. p i (a(F)  k}) = min {p i (a(F)  r})  r  a(F)} 6. a(i)  k 7. F  F  {i} 8. End Could repeat several times and pick best solution Many variations on this basic procedure

Construction Heuristics Example –Randomly select department 3 –Assign to location 1; a(3) = 1 3

Construction Heuristics Example –Randomly select department 3 –Assign to location 1; a(3) = 1 –Randomly select department 4 3

Construction Heuristics Example –Randomly select department 3 –Assign to location 1; a(3) = 1 –Randomly select department 4 w 43 d 21 = (2)(1) = 2 w 43 d 31 = (2)(2) = 4 w 43 d 41 = (2)(1) = 2 w 43 d 51 = (2)(2) = 4 w 43 d 61 = (2)(3) = 6 –Assign to location 2; a(4) = 2 3 4

Construction Heuristics Example –Assign 3 to location 1; a(3) = 1 –Assign 4 to location 2; a(4) = 2 –Randomly select department 2 w 42 d 32 + w 32 d 31 = 2+8 = 10 w 42 d 42 + w 32 d 41 = 4+4 = 8 w 42 d 52 + w 32 d 51 = 2+8 = 10 w 42 d 62 + w 32 d 61 = 4+12 = 14 –Assign to location 4; a(2) =

Construction Heuristics Example –Assign 3 to location 1; a(3) = 1 –Assign 4 to location 2; a(4) = 2 –Assign 2 to location 4; a(2) = 4 –Randomly select department 5 w 25 d 34 + w 45 d 32 + w 35 d 31 = 16 w 25 d 54 + w 45 d 52 + w 35 d 51 = 12 w 25 d 64 + w 45 d 62 + w 35 d 61 = 22 –Assign to location 5; a(5) =

Construction Heuristics Example –Assign 3 to location 1; a(3) = 1 –Assign 4 to location 2; a(4) = 2 –Assign 2 to location 4; a(2) = 4 –Assign 5 to location 5; a(5) = 5 –Randomly select department 1 w 51 d 35 + w 21 d 34 + w 41 d 32 + w 31 d 31 = 34 w 51 d 65 + w 21 d 64 + w 41 d 62 + w 31 d 61 = 34 –Assign to location 3; a(1) =

Construction Heuristics Example –Assign 3 to location 1; a(3) = 1 –Assign 4 to location 2; a(4) = 2 –Assign 2 to location 4; a(2) = 4 –Assign 5 to location 5; a(5) = 5 –Assign 1 to location 3; a(1) = 3 –Assign 6 to location 6; a(6) = 6 –a = (3, 4, 1, 2, 5, 6) –C(a) =

Construction Heuristics Observations –Many different variations of the construction procedure –Clearly the initial location has an effect as does the department sequence –Intuitively, you want large weights near the center and small weights near the outside Difficult to formalize as a general algorithm –Example 5 & 6 largest weights; 2 & 3 close to 6; 1 close to 3 a = (3, 4, 6, 1, 2, 5) C(a) = 92

Solution Quality How good is the solution? Lower Bound –Order location pairs by increasing distance, d Preferred locations –Order weights by decreasing flow volume, w Highest activities –“Assign” largest weights to preferred locations –LB = d  w –d = (1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3) –w = (10, 8, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2) –LB = 10(1) + 8(1) + 6(1) + … + 2(3) + 2(3) = 88

Improvement Heuristics Modify a given solution so that the total cost is reduced Pairwise interchange –Select two departments and interchange their locations –General Procedure 0. a  a 0 1. Select a pair of facilities (u, v) 2. Evaluate  C uv (a) 3. Decide whether or not to make the interchange 4. Decide whether or not to continue –A specific implementation requires rules for performing each of the steps

Improvement Heuristics Many reasonable rules exist for these steps. Consider, –Enumeration of all pairs in step 1 and 4 –Make exchange if  C uv (a) > 0 –Alternatively, make exchange between u and v such that  C uv (a) is the largest value for a given u.

Steepest Descent Pairwise Interchange a  a 0 done  false While (not.done) done  true max  0 For i = 1 to n-1 For j = i+1 to n If (  C ij (a) > max) then max  C ij (a) u  i v  j done  false Endif Endfor If (max > 0) then temp  a(u) a(u)  a(v) a(v)  temp Endif Endwhile

Improvement Heuristics Pairwise Interchange has several difficulties –May be “trapped” in bad solution Departments 5 and 6 have a large flow between them so if they get trapped on the outside, any exchange that moves one and not the other will have a negative  C uv (a) so it is never made initial solution good solution SDPI

VNZ Heuristic Order departments by TFC i : TFC [1]  TFC [2]  …  TFC [n] Phase 1 –Set m = M 1 = [1] and M 2 = [2] –Order list of departments i by non-increasing  C im (a). Proceed through list making each switch provided  C is (a) > 0 (where a is updated assignment vector as switches are made) Repeat for m = M 2 Phase 2 –Evaluate  C ij (a) for each dept. pair 1 and 2, 1 and 3, …, M-1 and M. Exchange i and j if cost is reduced. –Continue until every pair has been examined without making a change or each pair has been examined twice.

Improvement Heuristics Initial (starting) solution is important -- try several! Could consider k-wise interchanges –Computational burden increases greatly “Good” starting solution not necessary –In general, more effort should be expended in the improvement phase –Quickly, generate a large variety of starting solutions and then try to improve them