ABSTRACT
In Chapter 5, we discussed some heuristic algorithms for the layout problem. Now we present two optimal algorithms and several heuristic algorithms for the layout problem. Heuristic algorithmsespecially the simulated annealing algorithm, genetic algorithm (GA), and tabu search (TS)—are powerful tools that have been applied to other problems successfully (e.g., traveling salesman problem [TSP], graph partitioning problem, scheduling problems, and others.) We also present an optimal algorithm for the cellular manufacturing system design problem and discuss a method for estimating operational performance measures of a layout.
