检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆大学材料科学与工程学院,重庆400045 [2]重庆大学经济与工商管理学院,重庆400044 [3]攀枝花钢铁集团公司提钒炼钢厂,攀枝花617000
出 处:《北京科技大学学报》2014年第1期115-122,共8页Journal of University of Science and Technology Beijing
基 金:国家高技术研究发展计划资助项目(2007AA04Z161);国家自然科学基金资助项目(50574110;50174061);重庆市科技攻关重点项目(CSTC2011AB3053)
摘 要:针对多约束的炼钢--连铸重计划问题,提出了一种按扰动时炉次的状态进行炉次分类求解的重计划方法.将重计划问题中的约束分成强制约束和柔性约束两类,针对正在作业炉次设计了基于时间顺推和遗传算法的混合算法,针对未作业炉次设计了基于时间倒推和遗传算法的混合算法,通过强制约束结合混合算法搜寻可行解,然后在可行解中利用柔性约束搜寻最优解.采用钢厂的生产实绩数据进行仿真实验验证了该方法的可行性和有效性.An approach, whose hardcore is a classification of charges by determining whether the charge starts at the time of disturbance occurrence, of making a re-plan was proposed to solve the problem of multi-constrained steelmaking-continuous casting re-planning. The constraints of the re-planning problem are divided into hard and soft constraints. A hybrid algorithm based on time forward inferring and genetic algorithm is designed for the processing charges, and another hybrid algorithm based on time backward inferring and genetic algorithm is designed for the un-processing charges. The feasible solution of the re-planning problem is solved with the hybrid algorithm and hard constraints, and the optimal solution is searched with the soft constraints in the feasible solution. The feasibility and effectiveness of the method were verified with the help of simulation experiments by production data in a steel plant.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28