A Filling Heuristic Algorithm For Two-dimensional Rectangle Packing Problem

Nowadays, the computer technology, technology of CAD and rapid development of artificial intelligence, aided for people to the row which provides the possibilities in everything. in theory of the complexity of the np completely. In theory, packing problem is a very difficult problem, but in real life has a wide application subject.The packing problem of cutting optimal layout of small rectangles on a pallet was considered. Combining ant algorithm with simulated annealing algorithm, a mixed new algorithm of layout optimization, which is implemented by the lowest horizontal and filling algorithm, is proposed in this paper. In order to investigate the computation, numerical tests with randomly generated instances were carried out. By comparing, the solutions showed the robust effectiveness of this approach. The results showed that this approach gets a better effect. And to optimization of the characteristics, they are actually in the application of the different demands of structure have provided to the algorithm.This article by the glass and steel, cutting processes in the process, from the same process of accumulation of experience, a rectangle is the question of the line fast and efficient solution is a novel with an heuristic. Material is cut at the end of the restraints are a cut, the ants with simulated anneal algorithm and a minimum level and type of padding algorithm is heuristic row on a computer algorithm. on the experimental data in random.