考虑多性能指标的配料优化模型及求解算法

来源期刊:中南大学学报(自然科学版)2010年第1期

论文作者:孔玲爽 阳春华 王雅琳 桂卫华

文章页码:213 - 218

关键词:配料;优化模型;软约束;遗传算法

Key words:blending; optimization model; soft constraint; genetic algorithm

摘    要:为有效实现有色冶金配料过程的优化计算,提出一种综合考虑产品质量、成本、库存等多个性能指标的配料优化模型及满意求解算法。首先,考虑原料库存对配料过程的影响,将库存成本作为目标函数,库存量作为约束引入配料优化模型;然后,针对模型具有多个质量边界约束的特点,利用配料过程中质量约束边界的可调整性,引入满意优化理论中的“软约束”调整约束边界,以改善该优化问题求解的可行性;最后,采用以单变量编码的交叉变异来确定整体决策向量的小生境遗传算法进行寻优,并将提出的模型和算法应用于铜闪速熔炼配料过程中。研究结果表明:所提出的优化模型及求解算法克服了多维变量编码可能导致搜索空间剧增的缺陷,有效地提高了遗传算法的全局搜索能力和收敛速度;优化结果既能满足熔炼工艺要求,也能有效降低杂质含量和生产 成本。

Abstract: In order to effectively solve the blending optimization problem in nonferrous smelting process, an optimization model integrating production indices, the cost and the storage of raw materials and its solution method were provided. Firstly, the storage cost and the storage capacity of raw materials were incorporated into the optimization model respectively as the objective function and constraints to consider effects of storage on the blending process. Then, based on the fact that the index constraints were numerous and their boundaries were adjustable within a certain range, the conception of soft constraint in satisfactory optimization theory was introduced to improve the feasibility of the optimal problem. Finally, an improved niche genetic algorithm was proposed to get the optimum solution, where the decision vector was decided by crossover and mutation of a single variable coding. The optimization model and solution method were applied in blending process of copper flash smelting. The results show that the large-scale search space is avoided owing to the multi-dimensional coding, and the global searching ability and the convergence speed of the genetic algorithm are significantly improved. The model and the method can reduce the cost and lower the impurities.

基金信息:国家自然科学基金资助项目
湖南省教育厅科研项目

有色金属在线官网  |   会议  |   在线投稿  |   购买纸书  |   科技图书馆

中南大学出版社 技术支持 版权声明   电话:0731-88830515 88830516   传真:0731-88710482   Email:administrator@cnnmol.com

互联网出版许可证:(署)网出证(京)字第342号   京ICP备17050991号-6      京公网安备11010802042557号