Research And Implementation Of The Local Optimization Of Rectangle Layout

The problem of rectangle layout has been widely applied in many industrial areas. A good solution of layout may increase material utility, improve profit, and make enterprise efficiently and competitively.Based on the local optimization of rectangle layout, the paper analyses the dynamics of this problem and summarizes the methods that used in it both domestic and abroad. Having lucubrated, it adopts genetic algorithm to solve the optimal problem of rectangle layout.Rectangle layout belongs to NP-complete problem in mathematics. So far there is no effective polynomial algorithm which can solve this problem, the ones which can solve the problem effectively are heuristic algorithm and random algorithm. Genetic algorithm(GA) is a method which is between the heuristic algorithm and random algorithm. To solve the problem of rectangle layout with genetic algorithm, it is no need seeking the target function and the grads of restricted function, but by the operation of crossover and mutation to preserve the good results and discarding the bad ones, it achieves the optimization. Although the genetic algorithm can solve the local optimization problem of rectangle layout preferable, its process of seeking result is not easy to achieve, especially the the layout of a mass of rectangle, because its length of chromosome chain will be large, so that the operation of crossover and mutation will be difficult. Based on the principium and method of heuristic algorithm, the paper explores the process of rectangle layout optimization. Researching and analysing deeply, this paper makes improvements in both initialization and decoding, and it makes a test aiming at different examples. From the test results, it is proved that the improvements are valid and the algorithm improved is feasible.The paper adopts C++ Builder software, accomplishes the system of rectangle layout which is on the basis of genetic algorithm. The system achieves the functions required.