蜂群遗传算法在一维下料问题中的应用

Bee-swarm genetic algorithm is applied to one-dimensional cutting problem

针对一维下料优化问题,根据企业的实际生产情况,考虑能够满足和不满足生产两种情况,建立一个新的优化模型,并使用蜂群遗传算法求解方案。用各零件长度的一个排列作为一个染色体,每个零件的长度作为染色体的一个基因,根据蜂群原理设置两个不同的种群,种群1用于全局搜索,种群2用于局部搜索。实验结果表明,该模型具有一定的实用价值。

According to the one-dimensional cutting-stock optimization problem, this article considers the actual situation-- meet or no-meet production, for this problem to create a new optimization model and use bee-swarm genetic algorithm to solve the problem. With the parts arranged as a chromosome, the length of each part of the chromosome is as a gene, and according to the principles of bees to set two different populations, population one is for global searching, population two is for local searching. Ex- perimental results show that the model has some practical value.