用户名: 密码: 验证码:
钢铁合同计划及其PSO-GA混合算法的研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:The Research on the Order Planning of Steel Production and its PSO-GA Hybrid Algorithm
  • 作者:杨乐 ; 蒋国璋 ; 刘清雄
  • 英文作者:YANG Le;JIANG Guo-zhang;LIU Qing-xiong;College of Machinery and Automation,Wuhan University of Science and Technology;
  • 关键词:钢铁一体化生产 ; 合同计划 ; 粒子群算法 ; 遗传算法
  • 英文关键词:Integrated Steel Production;;Order Planning;;Particle Swarm Optimization Algorithm;;Genetic Algorithm
  • 中文刊名:JSYZ
  • 英文刊名:Machinery Design & Manufacture
  • 机构:武汉科技大学机械自动化学院;
  • 出版日期:2019-06-08
  • 出版单位:机械设计与制造
  • 年:2019
  • 期:No.340
  • 基金:钢铁生产混合流程智能调度及其知识网系统的研究(71271160)
  • 语种:中文;
  • 页:JSYZ201906005
  • 页数:4
  • CN:06
  • ISSN:21-1140/TH
  • 分类号:20-23
摘要
通过对钢铁一体化生产流程的分析,建立了合同计划的多目标自然数模型,考虑到交货时间窗提前/拖后期的惩罚、设备产能约束、合同取消惩罚以及生产费用,提出通过种群分割策略以及基于粒子群算法重构遗传算法的变异算子,形成粒子群、遗传算法混合算法对模型求解,使得生产周期最短、取消合同数量最少、热装比最大以及生产成本最小。通过实例证明,粒子群、遗传算法混合算法比经典遗传算法在解决多批次、小批量订单合同计划问题方面,收敛更早,算法性能更加稳定。
        It has established a natural Number model of the multi-objective contract project by analyzing the process of the integrated iron and steel production.The earliness-tardiness penalty,later delivery penalty in delivery time window,equipment capacity constraint,contract cancellation penalty as well as production cost have been taken into account to get the objectives that are the shortest production cycle,the minimum number of the contract which would be canceled,the maximum of the hot charge-ratio as well as the minimum production cost.At last,It swarm-genetic and genetic algorithm hybrid algorithm which is formed by reconstructing population segmentation strategy and mutation operator of genetic algorithm based on particle swarm optimization is put forward to solve the model.The experimental results show,the hybrid algorithm converges more earlierly and performs more stablely than classical genetic algorithm to solve large batches and small quantities order planning problem.
引文
[1]张涛,王梦光,唐立新.钢厂合同计划的模型与算法[J].控制理论与应用,2000,17(5):711-715.(Zhang Tao,Wang Meng-guang,Tang Li-xin.The model and algorithm for the order planning of the steel plant[J].Control Theory and Applications,2000,17(5):711-715.)
    [2]张涛,程海刚,张杰.基于MTO-MTS的钢厂合同计划方法[J].系统工程理论与实践,2008(11):85-93.(Zhang Tao,Cheng Hai-gang,Zhang Jie.A method based on MTO-MTSfor the order planning of the steel plant[J].System Engineering Theory and Practice,2008(11):85-93.)
    [3]於春月,王成恩.钢铁一体化生产多目标合同计划建模与算法[J].控制理论与应用,2009,26(12):1452-1454.(Yu Chun-yue,Wang Cheng-en.Multi-objective order planning model and algorithm for integrated steel sroduction[J].Control Theory&Applications,2009(26):1452-1454.)
    [4]芦永明,王丽娜,陈宏志.考虑生产组织约束的钢铁企业合同计划[J].重庆大学学报,2012,35(11):86-92.(Lu Yong-ming,Wang Li-na,Chen Hong-zhi.Order planning for iron and steel enterprise considering production organization constraints[J].Journal of Chongqing University,2012,35(11):86-92.)
    [5]刘志雄.并行机调度问题粒子群优化研究[J].机械设计与制造,2010(10):68-70.(Liu Zhi-xiong.Research of particle swarm optimization algorithm for parallel machine scheduling problem[J].Machinery Design&Manufacture,2010(10):69-70.)
    [6]高聪,唐立新,唐建勋.禁忌搜索算法解决钢铁企业生产合同计划优化问题[J].东北大学学报,2009,30(7):944-946.(Gao Cong,Tang Li-xin,Tang Jian-xun.Tabu search for real order planning problem in steel industry[J].Journal of Northeastern University,2009,30(7):944-946.)
    [7]徐端,屠乃威,孙亮亮.考虑生产路径柔性的钢铁合同计划编制研究[J].控制工程,2009,16(4):502-506.(Xu Duan,Tu Nai-wei,Sun Liang-liang.On order planning with production path flexibility[J].Control Engineering of China,2009,16(4):502-506.)
    [8]Redwine C N,Wismer D A.A mixed integer programming model for scheduling orders in a steel mill of optimization theory and applications[J],1974,14(3):305-318.
    [9]Liu S X,Tang J F,Song J H.Order-planning model and algorithm for manufacturing steel sheets[J].International Journal of Production Economics,2006(100):30-43.
    [10]ZHU B L,YU H B,HUANG X Y.Research approaches on integrated planning for iron and steel enterprise[C].//International Conference on Systems,Man and Cybernetics.Taipai:IEEE Press,2006(6):5024-5029.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700