ABSTRACT
In Chapter 5, some heuristic algorithms for the layout problem were discussed. This chapter presents two optimal and several heuristic algorithms for the layout problem. Heuristic algorithms-especially the simulated annealing, genetic, and tabu search (TS)—are relatively new, powerful tools that have been applied to other problems successfully (e.g., traveling salesman problem [TSP] and graph partitioning problem). An optimal algorithm for the cellular manufacturing system design problem is also presented, and a method for estimating operational performance measures of a layout is discussed.*
As discussed in Chapter 7, optimal algorithms are defi ned to be those that are always guaranteed to produce the best solution (or at least one best solution when there are multiple ones) for a given problem. Heuristic algorithms, or simply heuristics, provide a solution but do not guarantee it to be the best. A good heuristic usually produces the best solution for most small problems.
