Algorithms for Plant Layout CORELAP (Computerized Relationship Layout Planning)

1. Algorithms for Plant LayoutCORELAP(Computerized Relationship Layout Planning) Presented by: Zohaib Rasheed

2. CORELAP • Acronym for Computerized Relationship Layout Planning • Uses Relationship Chart as input (REL) • Requires users to assign weights to the alphabetic ratings in the REL chart . (Closeness Ratings) • Computes the total closeness ratings (TCR) for each department by summing all the CR associated with that department. • Values selected for ratings are important

3. CORELAP ……………………[cont] • User interface in CORELAP is spreadsheet • Inputs through Microsoft Forms • To obtain layout followings are required to give as input: • Number of departments • Relationship weights • Note: weights should be assigned in decreasing order • [A, E, I, O, U & X]

4. Value Closeness Line code Numerical weights A Absolutely necessary 32 E Especially important 26 I Important 8 O Ordinary closeness OK 4 U Unimportant 2 X Undesirable -32 Importance of Closeness

5. Ordinary closeness: President (1) & costing (2) Absolutely necessary: President (1) & secretary (4) Relationship Chart Example 1 2 3 4 I = Important; U = Unimportant

6. CORELAP - STEPS • Selection Procedure • Placement and Evaluation Procedure

7. CORELAP – STEP 1 • First department: • Second department: • X-relation  “last placed department” • A-relation with first. If none E-relation with first, etcetera

8. CORELAP – STEP 2 • Department areas are converted into grid squares. • CORELAP does not take the building shape into account. • The final shape of the facility created by CORELAP depends on the placement of departments it has selected.

9. CORELAP – STEP 2 • Place the first department in the center of the layout • Subsequent department is placed abutting already placed departments in the position that gives the best placement rating • After the layout is completed CORELAP calculates a numerical score for the layout

10. 2 3 4 8 1 7 6 5 2nd 1st CORELAP – STEP 2