Facility layout design with genetic algorithm and an application

Facility layout problems?re difficult and heuristic methods?re chosen to solve when search the best solutions. Quadratic Assignment Problem (QAP) is a NP-hard problem, there is no method known giving the best solutions exactly. This kind of problems are solved by different kind of heuristics methods. Genetic algorithms are that kind of heuristic method, and they can provide a good solutions for QAP. Genetic algorithms has evulationary structure; and they?re designed to find optimum solution in optimum duration. There is a computer program that is coding with C++ `s called SCLO (Subcontractor Layout Optimizer). In the designing steps of program many codes?re taken from GA library and some additions?re made on these. Created program was tested by QAP library literature problems. Program reach the each problem known best results more than 99%. In real life, program?re implemented the firm that manufacture building elektrical materials. Theoretically transportation cost was decrease 41%. Not only the minimization success of program, but also some constraints problems caused by this too much gain. Keywords: Facility layout problem, genetic algorithm, quadratic assignment problem