Cutting type filling method for optimal layout of rectangular parts

Abstract

The invention discloses a cutting type filling method for optimal layout of rectangular parts. The method comprises the following steps of: 1, establishing a mathematical planning model: aiming at a layout problem of two-dimensional rectangular parts, firstly formalizing the two-dimensional rectangular part into a simple rectangular area and rectangular parts, establishing the mathematical planning model, setting the rectangular area to have a length of L and a width of L, and filling n rectangular parts respectively having lengths of l1, l2, ...ln and widths of w1, w2, ...wn into the rectangular area. Compared with existing layout algorithms, the method combines the characteristics that the algorithm is simple to realize and the layout efficiency is high, and can be widely applied to rawmaterial layout of rectangular parts in rolled steel blanking, newspaper and periodical typesetting and tailoring so as to provide theoretical guidance for realization of producing activities; and under the current fierce market economic competition pursuing resource utilization rate and production scale, the novel layout algorithm is simple and efficient, and is capable of bringing a novel thinking method and huge economic benefit for the field of two-dimensional raw material layout.

Description

technical field [0001] The invention relates to the technical field of plate blanking and layout optimization, in particular to a cutting-type filling method for optimized layout of rectangular pieces. Background technique [0002] The two-dimensional rectangular raw material layout problem is an NP-complete problem and an optimization problem with the highest computational complexity. The parts are arranged in a rectangular area, each part does not overlap each other, and meets the corresponding process requirements, so as to arrange as many rectangular parts as possible to maximize the utilization of materials. Such problems widely exist in real production, such as steel blanking, newspaper typesetting, clothing cutting, etc., and it is necessary to obtain the optimal or near-optimal solution within an acceptable time. [0003] For the layout of two-dimensional rectangular parts, there has been a certain degree of research and progress. Among them, the heuristic algorith...

AI Technical Summary

Problems solved by technology

Among them, the heuristic algorithm has a high execution rate and optimization rate, but the size of the rectangular parts used in layout is too small; the genetic algorithm has strong applicability and can obtain better layout, but its parameter selection and layout programming are more complicated. ; The ant colony algorithm has strong robustness and can effectively solve the rectangular layout problem, but its layout calculation is relatively large; the simulated annealing algorithm can get a more suitable and efficient layout scheme, but it can get a reasonable initial temperature , cooling temperature and cooling parameters need a certain amount of time and layout experiments

Therefore, the main problem existing in the layout of raw materials for two-dimensional rectangular parts is that the simplicity and efficiency of the layout algorithm cannot coexist.

Images