Plant layout by branch and bound algorithm (A computer aided application)

In I this thesis, ihlant layout is evaluated by using branch and bound algorithm.. Plant layout can be defined as laying of industrial plants in a best possible way. The most common two ways in plant layout are branch and bound technique and heuristic algorithms. Plant layout will be formulated as quadratic assignment problem in this thesis. Then, the problem will be solved aptimally by using branch and bound technique. Assignment problem can be solved in two different ways, as single or parallel forms. Machines are assigned according to only one characteristic (e.g. distance) in single assignment, where as in parallel assignment, machines are assigned according to several characteristics (e.g. distance, material movement etc.) In my work both assignment form will be explained by an example each. The application will be made for Erkunt Casting Technology. In.. dets^ro-ining.. the demand of the plant, the lowest squares technique is used. Plant layout will be solved by formulating quadratic assignment problem in pair assignment form. The optimal result will be obtained by branch and bound technique and by the aid of computer. Computer program used in solving this problem is completely attached. IV