A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories

We study the fabric spreading and cutting problem in apparel factories.For the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment components.For reducing the production costs,the number of lays that corresponds to the frequency of using the cutting beds should be minimized.We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem.This algorithm contains a constructive procedure and an improving loop.Firstly the constructive procedure creates a set of lays in sequence,and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set.The improving loop will run until it cannot obtain any smaller lay set or the time limit is due.The experiment results on 500 cases show that the proposed algorithm is effective and efficient.

Minimal cut-based recursive decomposition algorithm for seismic reliability evaluation of lifeline networks

In this paper, a new probabilistic analytical approach, the minimal cut-based recursive decomposition algorithm （MCRDA）, is presented to evaluate the seismic reliability of large-scale lifeline systems. Based on the minimal cut searching algorithm, the approach calculates the disjoint minimal cuts one by one using the basic procedure of the recursive decomposition method. At the same time, the process obtains the disjoint minimal paths of the system. In order to improve the computation efficiency, probabilistic inequality is used to calculate a solution that satisfies the prescribed error bound. A series of case studies show that MCRDA converges rapidly when the edges of the systems have low reliabilities. Therefore, the approach can be used to evaluate large-scale lifeline systems subjected to strong seismic wave excitation.

APPLICATION OF INTEGER CODING ACCELERATING GENETIC ALGORITHM IN RECTANGULAR CUTTING STOCK PROBLEM

An improved genetic algorithm and its application to resolve cutting stock problem arc presented. It is common to apply simple genetic algorithm （SGA） to cutting stock problem, but the huge amount of computing of SGA is a serious problem in practical application. Accelerating genetic algorithm （AGA） based on integer coding and AGA＇s detailed steps are developed to reduce the amount of computation, and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem. SGA is adopted to produce individuals within given evolution process, and the variation interval of these individuals is taken as initial domain of the next optimization process, thus shrinks searching range intensively and accelerates the evaluation process of SGA. To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result, fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process. According to the computational experiment, it is observed that this improved GA converges much sooner than SGA, and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.

Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with Application in a New CuttingPlane Algorithm

Balas and Mazzola linearization (BML) is widely used in devising cutting plane algorithms for quadratic 0-1 programs. In this article, we improve BML by first strengthening the primal formulation of BML and then considering the dual formulation. Additionally, a new cutting plane algorithm is proposed.

An improved cut-based recursive decomposition algorithm for reliability analysis of networks

In this paper, an improved cut-based recursive decomposition algorithm is proposed for lifeline networks. First, a complementary structural function is established and three theorems are presented as a premise of the proposed algorithm. Taking the minimal cut of a network as decomposition policy, the proposed algorithm constructs a recursive decomposition process. During the decomposition, both the disjoint minimal cut set and the disjoint minimal path set are simultaneously enumerated. Therefore, in addition to obtaining an accurate value after decomposing all disjoint minimal cuts and disjoint minimal paths, the algorithm provides approximate results which satisfy a prescribed error bound using a probabilistic inequality. Two example networks, including a large urban gas system, are analyzed using the proposed algorithm. Meanwhile, a part of the results are compared with the results obtained by a path-based recursive decomposition algorithm. These results show that the proposed algorithm provides a useful probabilistic analysis method for the reliability evaluation of lifeline networks and may be more suitable for networks where the edges have low reliabilities.

Research on the memory cutting path of shearer based on genetic algorithm

In order to realize the memory cutting of a shearer, made use of the memorizedcutting path and acquisitioned cutting parameters, and realized the teaching and playbackof the cutting path.In order to optimize the memory cutting path of a shearer, took intoaccount the constraints of coal mining craft, coal quality and the adaption faculty of coalmining equipments.Genetic algorithm theory was used to optimize the memory cutting ofshearer and simulate with Matlab, and realized the most valuable mining recovery rate.The experimental results show that the optimization of the memory cutting path of ashearer based on the genetic algorithm is feasible and obtains the most valuable memorycutting path, improving the ability of shearer automatic cutting.

A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights

We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.

An Intelligent Optimization Method of Reinforcing Bar Cutting for Construction Site

To meet the requirements of specifications,intelligent optimization of steel bar blanking can improve resource utilization and promote the intelligent development of sustainable construction.As one of the most important building materials in construction engineering,reinforcing bars(rebar)account for more than 30%of the cost in civil engineering.A significant amount of cutting waste is generated during the construction phase.Excessive cutting waste increases construction costs and generates a considerable amount of CO_(2)emission.This study aimed to develop an optimization algorithm for steel bar blanking that can be used in the intelligent optimization of steel bar engineering to realize sustainable construction.In the proposed algorithm,the integer linear programming algorithm was applied to solve the problem.It was combined with the statistical method,a greedy strategy was introduced,and a method for determining the dynamic critical threshold was developed to ensure the accuracy of large-scale data calculation.The proposed algorithm was verified through a case study;the results confirmed that the rebar loss rate of the proposed method was reduced by 9.124%compared with that of traditional distributed processing of steel bars,reducing CO_(2)emissions and saving construction costs.As the scale of a project increases,the calculation quality of the optimization algorithmfor steel bar blanking proposed also increases,while maintaining high calculation efficiency.When the results of this study are applied in practice,they can be used as a sustainable foundation for building informatization and intelligent development.

基于K-GRU神经网络的采煤机记忆截割及优化

目的针对采煤机记忆截割不准确、自动化程度不高的问题,方法本文提出一种基于KGRU神经网络的采煤机记忆截割算法,此算法具有更适合处理长时序数据的特点,将算法与采煤机记忆截割结合起来,可以减少采煤过程中滚筒的损坏同时保护工人生命安全。该算法在深层门控循环单元(GRU)的输入端引入比例因子K,用比例因子K表现不同时刻数据的重要程度,以加强模型对长时序数据的记忆性,进而提高记忆截割精度。在模型训练阶段利用随机搜索算法(RS)对深层K-GRU神经网络的超参数选择进行优化,加快模型训练速度。结果实验中使用Python完成K-GRU模型构建与超参数优化,使用随机搜索算法可以在更短时间内得到超参数最优解,得到超参数epochs为317、batch_size为70的最优解共花费154 s,在最优解情况下计算模型对真实采煤数据预测的误差,得到K-GRU的loss值为0.0467、R2为0.9578、EVS为0.9656、ME为0.0833。结论最终表明,优化后的深层K-GRU模型在解释方差得分、最大误差和可决系数方面均优于SVM、KNN、LSTM、RNN和普通GRU模型,显著提高了采煤机记忆截割的适用性和准确性。

基于正负地形的喀斯特地貌分类研究——以贵州喀斯特区为例

地形因子具有直观性、可视性,常被作为喀斯特地貌分类的主要依据。已有关于喀斯特地貌分类研究所用的地形因子较多且复杂,分类特征不易被公众学习和理解,导致成果的应用和推广难度较大。因此以贵州喀斯特区为研究对象,运用地形开度法和随机森林模型,筛选重要性正负地形指标,探讨喀斯特地貌分类方法。结果表明:1)贵州喀斯特区的蚕食度均值为1.35,深切度均值为215.36 m,平均粗糙度比均值为1.01,负地形面积大于正地形面积,正负地形不规则且破碎度较大,正地形被沟谷深切明显,地貌的异质性强烈。2)蚕食度和深切度2个指标的重要性指数分别为0.93和1.16,能较好地反映喀斯特地貌的差异性。3)根据蚕食度和深切度贵州喀斯特地貌分为23类,分类精度优良达93.33%。在不同的喀斯特地貌区,因为蚕食度和深切度不同,导致水、土、光、热资源丰度不同,因而它们的土地利用方式各异。研究简化了分类判别喀斯特地貌的地形指标,降低了公众对喀斯特地貌的认识和理解难度,并为数字地形技术在喀斯特地貌分类中的推广应用提供参考。

基于VMD-SSA-LSTM考虑刀具磨损的数控铣床切削功率预测模型研究

传统的切削过程功率获取需要基于复杂的切削功率模型且很少考虑刀具磨损的影响,针对此设计了一种基于变分模态分解(VMD)、麻雀搜索算法(SSA)、长短时记忆(LSTM)神经网络的考虑刀具磨损的数控铣床切削功率预测模型,该模型无需解构数控铣床运行过程的能耗机理,基于一次性的历史实验数据即可实现数控铣床切削过程功率的高精度预测。首先,采用人工智能机器视觉技术对刀具磨损图片进行分析处理,获取刀具磨损图像的数字化特征,从而得到刀具最大磨损量;然后,建立基于VMD-SSA-LSTM考虑刀具磨损的数控铣床切削功率预测模型,利用VMD对数控铣床运行数据进行分解,采用SSA算法对LSTM神经网络超参数进行寻优,并将分解出的铣床运行数据分量输入到LSTM神经网络中,接着将每个分量的预测值相加,得到切削功率预测值;最后以面铣加工为例,将所提出的预测模型与BP神经网络、LSTM神经网络和传统模型进行对比分析,验证了所提模型的有效性和优越性。

基于高斯超像素的快速Graph Cuts图像分割方法

提出了一种交互式的快速图像分割方法.该方法通过使用高斯超像素来构建Graph cuts模型以实现加速.首先,利用融合了边缘置信度的快速均值漂移算法,将原始图像高效地预分割为多个具有准确边界的同质区域,并将这些区域描述为超像素,用于构建精简的加权图.然后,使用区域的彩色高斯统计对超像素进行特征描述,并在信息论空间中对高斯距离度量进行设计.另外,为了准确而精炼地对先验知识进行参数化学习,本文还使用了分量形式的期望最大化混合高斯(Component-wise expectation-maximization for Gaussian mixtures,CEMGM)算法对用户交互进行聚类.最后,在改进的加权图模型中应用Graph cuts方法,获得最终的分割结果.通过使用不同的彩色图像进行分割实验比较,仿真结果表明本文的方法在准确性和高效性方面都具有很好的性能.

基于改进Graph Cut算法的生猪图像分割方法

生猪图像分割为生猪行为特征提取、参数测量、图像分析、模式识别等提供易于理解和分析的图像表示,准确有效的生猪图像分割是生猪行为理解和分析的基础。针对传统Graph Cut算法分割精度差、分割效率低及不能准确分割特定目标的问题,该文结合交互分水岭算法,提出基于改进Graph Cut算法的生猪图像分割方法。采用交互分水岭算法对图像进行区域划分,划分的各个区域块看作超像素,用超像素替代传统加权图中的像素点,构造新的网络图替代传统加权图,重新构造能量函数以完成前景背景的有效分割。试验结果表明:该方法峰值信噪比平均范围为[30,40],结构相似度平均范围为[0.9,1],两种评价准则的结果与主观评价一致,图像分割质量、精度得到明显提升;平均耗时缩短到传统Graph Cut算法的33.7%,提高了分割效率;在复杂背景、噪声干扰、光照强度弱等条件下可以快速分割出特定目标生猪,具有较高鲁棒性。

一种基于Graph Cuts的SAR图像分割方法

在最小化由马尔科夫随机场(MRF)图像分割模型建立的能量函数方面,基于Graph Cuts的alpha-expansion是一种比较有效的算法。但是,由此算法构建的s/t图中边的数目非常多,运算速度很慢。为了减少alpha-expansion算法的计算量,本文在标号为alpha的像素向其它像素膨胀的过程中,先隔离非alpha类间的联系,而只考虑alpha类与非alpha类之间的关系,从而避免了alpha-expansion算法需要构造辅助结点的问题,减少了s/t图中边的数目,提高了算法的计算效率。因放松了非alpha类间的关系对alpha膨胀的约束,使得算法可以更容易得跳出能量函数的局部极小点而获得更优的分割结果。实验中将改进的算法与传统的基于Graph Cuts的算法做了对比,显示了新算法在运算时间和最小化能量方面的有效性。

基于鱼群算法优化normalized cut的彩色图像分割方法

为了克服传统的谱聚类算法求解normalized cut彩色图像分割时,分割效果差、算法复杂度高的缺点,提出了一种基于鱼群算法优化normalized cut的彩色图像分割方法。先对图像进行模糊C-均值聚类预处理,然后用鱼群优化算法替代谱聚类算法求解Ncut的最小值,最后通过最优个体鱼得到分割结果。实验表明,该方法耗时少,且分割效果好。

基于非均匀切割的HiCuts分类算法

数据包分类技术广泛应用于许多网络服务当中,HiCuts算法是多维包分类中最具有代表性的数据包分类算法。但由于规则集分布不均匀,通过简单地随机等分某个域很难将规则划分到不同的节点去,从而导致决策树树深度急剧增加,使算法查找的时间效率和空间效率大大降低。通过大量统计分析发现,规则集中的规则域并非均匀分布在其取值范围内,为此,在HiCuts算法的基础上提出了一种利用非均匀切割技术的N-HiCuts算法来构建决策树。算法对于分布不均匀的域依据统计规则进行非均匀切割,对规则集中分布均匀的某些域采用等分函数来进行切割,从而提高每次对规则集进行切割的效率。实验证明,该算法的整体性能得到较大的提高。

基于B样条曲线拟合和蜉蝣算法的采煤机截割路径约束优化

实现采煤机智能化调高,关键是解决煤岩界面识别问题、截割路径优化问题及采煤机调高控制问题。即使煤岩界面被精确识别,受到实际工作中顶底板的平整性和液压支架的推移滑溜等要求的限制,采煤机滚筒无法完全跟随煤岩界面曲线,因此需要基于煤岩界面识别结果,对起伏变化的煤岩界面曲线进行截割路径优化,得到采煤机调高控制的目标轨迹。滚筒截割路径优化是基于煤岩界面估计曲线,在采煤工艺、煤质要求和设备的适应能力等限制条件的约束下,得到使回采最大化的平滑轨迹。针对上述采煤机截割路径约束优化问题,提出一种基于B样条曲线拟合和蜉蝣算法的采煤机截割路径约束优化方法。为了提高截割路径优化效果和降低计算复杂度,以B样条曲线节点系数作为设计变量,构建一种新型截割路径优化目标函数;考虑采煤机截割工艺、煤质要求等限制,使用多段赋值罚函数法处理约束,根据约束的不满足程度动态改变罚函数系数值,避免优化陷入局部最值和约束不能起到实际作用;为了进一步提高优化效果和收敛速度,使用修正蜉蝣算法寻找最优截割路径。最后,考虑实际煤岩界面中褶皱、陷落柱、断层等典型地质构造,进行仿真研究,结果表明,所提方法能在满足实际约束下快速得到平滑的截割优化路径,实时性好、适用性高。

多块排样方式的二维板材下料优化模型与算法

针对矩形件二维板材剪切下料问题,提出一种多块排样方式的二维板材下料优化模型与求解算法。为了均衡考虑排样方式的计算复杂度和板材利用率,将多块排样方式的块数定为八块。通过3次一分为二剪切操作将板材分割成八个矩形块,并将每个块剪切成方向相同的同种矩形件。构造八块排样的优化模型及算法是按照排样价值最大原则来确定所有可能尺寸的块中矩形件的最优布局和板材的最优八块划分。提出的列生成算法迭代调用上述八块排样算法生成一系列下料方案,选择耗费板材最少的一个下料方案作为最终解。通过采用文献基准例题和实际生产实例验证了本文算法,实验结果表明:八块排样算法的排样价值高于3种文献排样算法,并且,八块排样方式的下料算法板材利用率高于已有文献给出的下料算法。本文给出算法计算时间可满足实际应用需要。

Sensitivity of optimal double-layer grid designs to geometrical imperfections and geometric nonlinearity conditions in the analysis phase

This study focuses on exploring the effects of geometrical imperfections and different analysis methods on the optimum design of Double-Layer Grids(DLGs),as used in the construction industry.A total of 12 notable metaheuristics are assessed and contrasted,and as a result,the Slime Mold Algorithm is identified as the most effective approach for size optimization of DLGs.To evaluate the influence of geometric imperfections and nonlinearity on the optimal design of real-size DLGs,the optimization process is carried out by considering and disregarding geometric nonlinearity while incorporating three distinct forms of geometrical imperfections,namely local imperfections,global imperfections,and combinations of both.In light of the uncertain nature of geometrical imperfections,probabilistic distributions are used to define these imperfections randomly in direction and magnitude.The results demonstrate that it is necessary to account for these imperfections to obtain an optimal solution.It’s worth noting that structural imperfections can increase the maximum stress ratio by up to 70%.The analysis also reveals that the initial curvature of members has a more significant impact on the optimal design of structures than the nodal installation error,indicating the need for greater attention to local imperfection issues in space structure construction.

基于DXF文件的数字模切路径优化算法研究

针对数字模切直接提取刀线文件数据时图元模切顺序的无序性,即直接按刀线文件所给出的图元路径规划的先后次序进行路径模切,则会出现空刀路径太长的问题,本研究提出了一种基于遗传算法的改进型路径规划方法。首先分析了刀线文件数据特点,将各图元模切起始点分解为由图元序号和各图元内初始模切点对应的锚点序号组成的染色体,将染色体分割为头部和尾部分别进行变换处理。其中针对图元序号的唯一性特点进行遗传和交叉变换,针对初始模切点对应的锚点序号不能大于该图元中锚点的个数这一特点进行遗传和变异的变换。为了提高效率,避免局部优化,该算法是首先通过一维优化的方法对图元顺序进行了优化,以图元顺序优化结果作为初始染色体序列,然后利用遗传算法进行了再次优化。通过实例计算将该算法和刀线模切的直接路径规划算法进行计算对比,结果表明经该算法优化后的模切路径中空刀程路径长度远小于直接路径规划中的空刀程路径长度,节约运行时间,数字模切效率得到了较大的提高。