矩形件排样问题，是二维下料问题的一个分支。
The rectangular cutting problem is a branch of the two-dimensional cutting problems.
在国民经济生产中，存在着大量的切割下料问题。
In national economical production, there have a lot of cutting stock problems.
另外还讨论了拼板问题、背包问题和下料问题的关系。
The relations among the board welding problem, knapsack problem and cutting stock problem are also discussed.
本文研究的是圆形件排样问题，是二维下料问题的一个分支。
The two-dimensional cutting problems of rectangular and irregular blanks have been studied intensively, but the cutting problems of circular blanks have drawn little attention.
“下料问题”在工程技术和工业生产中有着重要和广泛的应用。
The cutting stock problem possesses important and widespread application in the engineering techniques and the industrial production.
本文通过实例建立套裁下料问题的数学模型并使用计算机对其求解。
Based on the example, sets up a mathematic mould for jacking blanking and solving it with computer.
该方法适用于较大规模的型材下料问题，能够提高原材料的利用率。
The raw and processed materials' use factor can improved largely through adopting this method.
论述了下料问题模型的建立及其求解，并把该模型应用于生产实践中。
This paper discusses the establishment and solution on the model of cutting stock problem and applies this model to production and practice.
求解二维下料问题即求解如何用最少的板材排入所需的全部毛坯的问题。
The two-dimensional cutting stock problem is a problem about how to minimize the material input to pack all the blanks required.
在工业应用领域中存在大量的二维下料问题，其中应用最多的是矩形件下料问题。
Rectangular stock cutting is the most applied problem in two-dimensional stock cutting problems which are widely existed in industrial application field.
本篇论文在对遗传算法进行分析和研究的基础上，把遗传算法用于一维下料问题的求解。
In this thesis, genetic algorithms are studied from coding. On the basis of the study genetic algorithms are applied to solving one-dimensional cutting stock problems.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
将其应用于数控机床上，可快捷而精确地解决钣金加工中各种薄壁三通圆柱管的自动下料问题。
This method can solve the fast and precise automatic blanking problem in machining thin plates with NC machines.
本文给出了一种求解无限制板材下料问题的动态规划解法，对该算法的计算复杂度进行了分析。
In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented.
下料问题在生产中普遍存在，优化下料可以提高原材料利用率，是企业增加经济效益的途径之一。
Cutting stock problem exits widely in production. Optimizing cutting stock is a method to improve the using rate of materials and to increase the benefit of industry.
针对下料问题产生的数学模型过大和生产中的实际情况，笔者编写了杆件下料优化程序进行建模求解。
Based on the linear programming method, a mathematic model to calculate members cutting length of lattice structures is established and the optimum program is developed in this paper.
针对下料问题产生的数学模型过大和生产中的实际情况，笔者编写了杆件下料优化程序进行建模求解。
Then the design check-up, main model establishment, NC machining simulation, program optimization are realized before the trial-manufacture of prototype model.
近年来，随着国民经济的飞速发展，一维下料问题在建筑、电力、水利等领域获得了越来越广泛的应用。
With the rapid development of national economy in recent years, the one-dimensional cutting stock problem occurs in many industry areas.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
As for the one-dimensional cutting problem, the paper comes up with a model of mutual deadline, in allusion to which, a new algorithm is put forward, that is, DP greedy algorithm.
算法设计时考虑了普遍的情况，所以算法在解决大多数实际下料问题，特别是大规模下料问题时是切实有效的。
While designing the algorithm, we have considered the situation at large. Thus, the algorithm is feasible in solving most of the actual stock cutting problems especially in large scale.
介绍了一维下料问题的下料方式，采用计算机自动生成相应的线性规划数学模型，给出了最优下料方案的求解方法。
The method of one dimensional blanking is introduced. The relevant linear programming model is generated by computers. One resolvable method of optimum blanking is put forward.
线材的合理利用问题是一类很有代表性的整数规划问题。本文对线材下料问题决策的方案选择、模型的建立、解的分析进行了系统的分析和研究。
The problem of preparation of linear materials is a typical integer programing. In this paper, the selection of decision schemes, modeling, the analysis of solution are studied.
本文主要研究了一维下料优化及二维数据集最佳匹配两大问题。
One-dimensional cutting stock optimization and two-dimensional data sets optimal matching problem are mainly researched in this thesis.
对下料件排样问题进行了深入分析，提出一种互补件排样优化算法。
This paper puts forward an optimized layout algorithm of complementary parts based on thoroughly analyzing the layout problem of blanking parts.
板材排样优化的核心问题是规划零件在板型原材料上最佳的下料组合与每个下料零件在板材上的最优布局方案。
The kernel of this problem is to programming the best nesting combination and the best composition scheme of each part on the blank sheet.
本文分析讨论了冲压自动化领域中的若干基本问题，包括模具结构、工件上下料、毛坯开垛上料、工件码垛、安全问题等。
The general problems on press automation are analysed in this paper, including die structure, loading and unloading of workpiece, blank destacking, workpiece stacking and safety.
在料位计尚未修复阶段，天车对位下料的过程中常常出现冒料问题，影响天车加料作业和现场环境。
In the stage that the material level meter is not yet repaired, overflow of materials frequently happens, which affects feeding work and the local environment.
在料位计尚未修复阶段，天车对位下料的过程中常常出现冒料问题，影响天车加料作业和现场环境。
In the stage that the material level meter is not yet repaired, overflow of materials frequently happens, which affects feeding work and the local environment.
应用推荐