1. Facility Layout 6 MULTIPLE, Other algorithms, Department Shapes

2. MULTIPLE MULTI-floor Plant Layout Evaluation (MULTIPLE) –Improvement type –From-To chart as input –Distance based objective function (rectilinear distances between centroids). –Improvements: Two way exchanges and steepest descent

3. MULTIPLE (cont.) MULTIPLE can exchange departments that are not adjacent to each other. The layout is divided into grids Space Filling Curves are generated so that the curve touches each grid in the layout.

4. MULTIPLE (cont.) A layout vector (DEO) is specified and the departments are added to the layout using the layout vector. To exchange departments, the positions of the departments in the layout vector are exchanged. Depts: 1 = 12 grids 2 = 4 grids 3 = 6 grids Order = 1, 2, 3 Order = 2, 3, 1

5. Example - MULTIPLE 6 departments, Each grid 10 ft by 10 ft. All c ij = $0.1/ft No locational restrictions Space Filling Curve = A -D -E -B -C -F Initial Layout Vector = 6-2-3-4-5-1 231 645 (Draw the initial layout)

6. Example – Multiple (2) Initial Layout Vector = 6-2-3-4-5-1 Cost = 100*20*0.1 + 10*10*0.1 + 5*10*0.1 + 25*10*0.1 + 10*10*0.1 + 100*20*0.1 = 475

7. Example – Multiple – Exchanges (3) $535 $405 $475 $695 $315 $435 $495 $315 $675 $495 $475 $495 $405 $435 $535 First Iteration Selected

8. Example – Multiple – Exchanges (3) $335 $315 $435 $715 $475 Second Iteration Exchange 1-2 Exchange 1-6 Exchange 1-3 Exchange 1-4 Exchange 1-5 $405 $335 $495 $715 $315 Exchange 2-3 Exchange 3-4 Exchange 2-4 Exchange 2-5 Exchange 2-6 $315 $425 $435 $315 $355 Exchange 3-5 Exchange 5-6 Exchange 3-6 Exchange 4-5 Exchange 4-6 No more exchanges ! Final Layout. Is it optimal?

9. Multi-Floor Objective Function Indices: i,j for departments m for floors l for lifts where: Area Constraint:

10. MULTIPLE objective function

11. MULTIPLE vs. CRAFT Multi-floor capabilities Accurate cost savings Exchange any two departments Considers exchanges across floors

12. MULTIPLE review 1.The result of running MULTIPLE is a 2-opt solution with respect to the initial layout. True or False 2.The advantage(s) of MULTIPLE over CRAFT is(are): a)Exchange any two departments b)Exchanges departments that are unequal in size and non- adjacent c)Checks the cost of all exchanges before making the selection d)All of the above e)(a) and (b)

13. Department Shapes Measure 1 = Enclosing rectangle area Department area Measure 1 = for all shapes 25 16 Are all these shapes equally good?

14. Department Shapes (2) Measure 2 = Enclosing rectangle Length Enclosing rectangle Width Measure 2 = for all shapes 5 5 Are all these shapes equally good?

15. Normalized Shape Factor (  ) Shape Factor = Perimeter/Area Ideal Shape Factor = Perimeter/Area for a square with the same area  = Shape Factor / Ideal Shape Factor  = Perimeter / Perimeter for a square with same area  = P / P* P = 20 P* = 16  = 1.25 P = 24 P* = 16  = 1.5 P = 26 P* = 16  = 1.625

16. Other Methods and Tools MIP: –formulate the facility layout problem as a mixed integer programming (MIP) problem by assuming that all departments are rectangular. SABLE: –Like MULTIPLE, but instead of steepest descent pair-wise exchanges, it uses simulated annealing to search for exchanges. –Less likely to get “stuck” in a local optima

17. Other Methods and Tools (Cont.) Simulated Annealing (SA) and Genetic Algorithms (GA) –All methods/tools based on steepest descent approach (forces an algorithm to terminate the search at the first two-opt or three-opt solution it encounters), result in a solution which is likely locally optimal. –Steepest descent algorithms are highly dependent on the initial solution (path dependent). –SA-based procedure may accept non-improving solutions several times during the search in order to “push” the algorithm out of a solution which may be only locally optimal. –GA is originated from the “survival of the fittest” (SOF) principle, which works with a family of solutions to obtain the next generation of solutions (good ones propagate in multiple generations)