Some approaches to solve a complex problem of geometrical covering and orthogonal cutting
Keywords:
multi-criterion complex problem, complex problem of geometrical covering and cutting, packing, geometrical covering, covering orthogonal areaAbstract
Under consideration there are some approaches to solving a multi-criterion complex problem of geometrical covering the multilinked domain with orthogonal material succeed by cutting. The above problem is widely interpreted. To solve the problem the double-step approach is applied, that is, decomposition of the domain into rectangles not surpassing the domain dimension and the cutting itself. The approach suggested is compared to the three-step method described earlier.Downloads
Published
2018-17-10
Issue
Section
******************************