The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
One-dimensional cutting stock optimization and two-dimensional data sets optimal matching problem are mainly researched in this thesis.
本文主要研究了一维下料优化及二维数据集最佳匹配两大问题。
With the rapid development of national economy in recent years, the one-dimensional cutting stock problem occurs in many industry areas.
近年来，随着国民经济的飞速发展，一维下料问题在建筑、电力、水利等领域获得了越来越广泛的应用。
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.
本篇论文在对遗传算法进行分析和研究的基础上，把遗传算法用于一维下料问题的求解。
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.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
At the same time, its scope of cutting also restricted, generally limited to cut rules and one dimensional rectangular pieces of profiles and rod, can not cutting profiled.
同时，其切割范围也受到限制，一般仅限于切割规则的矩形件和一维的型材和棒材等，不能切割异形件。
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.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Based on the theoretic model of one-dimensional shear deformation under high rate loading, a relation of width and spacing for adiabatic shear band to cutting speed is proposed.
通过对高应变速率一维剪切变形理论模型的分析，提出了绝热剪切带宽度和间距与切削速度的关系式。
Based on the theoretic model of one-dimensional shear deformation under high rate loading, a relation of width and spacing for adiabatic shear band to cutting speed is proposed.
通过对高应变速率一维剪切变形理论模型的分析，提出了绝热剪切带宽度和间距与切削速度的关系式。
应用推荐