二维排样是典型的组合优化问题。
Two dimension layout is a typical combination optimization question.
激光切割排样系统在硅钢板材加工中的应用。
Application of Laser Cutting Layout System in Silicon Steel Plate Machining.
实验表明良好的相似度定义可以提高排样速度。
Experiments show that good definition of similarity improves the speed of packing.
普通单排优化排样中冲裁步距的计算非常关键。
It is critical calculating blanking step in normal single row optimum layout.
矩形件排样问题，是二维下料问题的一个分支。
The rectangular cutting problem is a branch of the two-dimensional cutting problems.
毛坯优化排样是冲压工艺数字化设计中的重要环节。
The optimization of blank layout is of great importance in the design of stamping die.
多边形顶点算法是冲裁排样优化问题的一种新算法。
A polygon vertex algorithm is a new optimizing method of blanking layout.
本文介绍一个实用的计算机辅助排样软件—CAN。
This paper presents a useful Computer Aided Nesting software-CAN.
从复合材料排样的需求出发，研究了矩形件排样问题。
To meet the demand of composite packing, the research development of rectangular pieces packing problems is reviewed.
本文首先介绍一种单一多边形在矩形板材上的排样算法。
This article first introduces one kind of sole polygon on the rectangular plate platoon type algorithm.
本文采用二步法对任意多边形的优化排样技术进行了研究。
This paper had been carrying out a study on the layout technology of arbitrary polygons with two-step theory.
冲裁件的排样是一个NP问题，在工业界具有广泛的需求。
Blanking layout is a NP problem, and is widely needed in the industry.
本文提出了一种基于多边形重叠检测的零件排样靠接新算法。
Based on the algorithm of polygon intersection detecting, a new algorithm in nesting is presented in this paper.
第二部分，对零件排样图的设计，完成了材料利用率的计算。
The second part, the part layout diagram design, complete material utilization calculations.
排样实例表明，该优化排样算法行之有效，具有广泛的适应性。
The feasibility of the proposed method is demonstrated by the layout example.
提出了一个用于求解二维不规则排样问题的离散临界多边形模型。
This paper presents a model based on discrete no-fit polygon for the two-dimensional irregular packing problem.
提出了一种粒子群算法的低压电器冲裁件排样优化问题的求解方法。
A particle swarm optimization algorithm for low voltage apparatus blanking part layout optimization was presented.
对下料件排样问题进行了深入分析，提出一种互补件排样优化算法。
This paper puts forward an optimized layout algorithm of complementary parts based on thoroughly analyzing the layout problem of blanking parts.
介绍一种计算机皮革缺陷检测与排样切割系统的构成原理与设计思想。
The compositional principle and design concept of a computerized defects detecting nesting and cutting system for leather were introduced.
该软件采用扫描探测排样算法，解决了具有任意形状的零件排样问题。
This package USES scan detection nesting algorithm, and can treat the nesting problem of sheet parts which have arbitrary shape.
本文根据工艺要求设计了四种典型的排样模式，归纳出两个启发式估价函数。
Four typical layout models are constructed and two heuristic estimate functions are presented in this paper.
通过对各个目标设定不同的优先级，可生成满足实际生产环境需要的排样方案。
By setting different priorities for each objective, appropriate layout plans can be generated for practical production environments need.
其次我还对对模具的排样做了精确分析，很好的提高了材料利用率和生产效率。
Further I make an exact analysis to the blank layouts; which improve the material utilization and production efficiency.
分析了转换推杆零件的冲压工艺，介绍了带料排样方案及级进模模具结构设计。
The pressing process of transforming throwout lever is analyzed, Layout of multi-position progressive and die structure are introduced.
因此，开展对二维矩形件优化排样问题的研究具有重要的理论意义和工程应用价值。
Therefore, research on the problem of two-dimensional optimal layout for rectangular parts is very important in theory and applications.
同时对条料载体和排样设计影响因素，以及如何对其设计质量控制问题进行了介绍。
The material carrier, layout design factors and how to control the quality of design problems were introduced.
工步排样是级进模设计的核心，智能化工步排样是冲模设计专家系统的主要研究内容。
Strip layout is the kernel in progressive die design and intelligent strip layout is the main con tent of stamping die expert system.
涉及了图形离散化算法、最优匹配算法和碰撞检测算法，并且给出了最终的排样效果图。
Contour-discretization algorithm, best-matching algorithm and collision-detection algorithm have been involved. At last, the final nesting result is showed.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
应用推荐