检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大连理工大学信息与控制研究中心,大连116024
出 处:《系统仿真学报》2009年第13期3894-3897,3901,共5页Journal of System Simulation
基 金:国家"863计划"课题(2007AA04Z156)
摘 要:分析了宝钢冷轧薄板厂罩式炉退火车间钢卷装炉的工艺特点和约束,建立了多炉型、不确定炉数下的装炉组合多背包模型。该模型考虑了最佳装炉量和最大炉高约束,将装炉数作为一个不确定数量。对于模型的求解,首先利用拉格朗日松弛启发式算法求得装炉数的上界,缩小解的搜索空间,然后构造了一种基于局部基因片段保留算子和反序-杂交遗传算子的新型单亲遗传算法进而求解。生产数据的仿真结果及试运行表明,提出的模型和算法切实可行,应用效果良好。The technical characteristic and restriction of the steel coils charging in bell-type annealing process were analyzed and a multi-knapsack model with multi-furnace type and uncertain furnace numbers was suggested. The model considers the optimal charging weight and height constraint of each furnace. Firstly, the furnace numbers upper limit is obtained by lagrangian relaxation heuristic algorithm that reduces the solution "s searching space, then a new partheno genetic algorithm based on local gene-segment reservation selecting operator and inversion-crossover inheriting operator was proposed for solving the model The simulation result with practical data shows that the model and algorithm suggested are feasible and better than the method being used in practice at present.
关 键 词:装炉组合 多背包问题 拉格朗日松弛启发式算法 单亲遗传算法
分 类 号:TP29[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.52