2.624

2020影响因子

(CJCR)

  • 中文核心
  • EI
  • 中国科技核心
  • Scopus
  • CSCD
  • 英国科学文摘

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

钢铁企业全流程物流优化问题的建模及分支——定价算法

唐建勋 汪恭书 唐立新

唐建勋, 汪恭书, 唐立新. 钢铁企业全流程物流优化问题的建模及分支——定价算法. 自动化学报, 2013, 39(9): 1492-1501. doi: 10.3724/SP.J.1004.2013.01492
引用本文: 唐建勋, 汪恭书, 唐立新. 钢铁企业全流程物流优化问题的建模及分支——定价算法. 自动化学报, 2013, 39(9): 1492-1501. doi: 10.3724/SP.J.1004.2013.01492
TANG Jian-Xun, WANG Gong-Shu, TANG Li-Xin. Modeling and Branch-and-price Algorithm for Logistics Optimization Problem of Plant-wide Production Processes in Steel Industry. ACTA AUTOMATICA SINICA, 2013, 39(9): 1492-1501. doi: 10.3724/SP.J.1004.2013.01492
Citation: TANG Jian-Xun, WANG Gong-Shu, TANG Li-Xin. Modeling and Branch-and-price Algorithm for Logistics Optimization Problem of Plant-wide Production Processes in Steel Industry. ACTA AUTOMATICA SINICA, 2013, 39(9): 1492-1501. doi: 10.3724/SP.J.1004.2013.01492

钢铁企业全流程物流优化问题的建模及分支——定价算法

doi: 10.3724/SP.J.1004.2013.01492
基金项目: 

国家自然科学基金(71032004, 71202151);高等学校博士学科点专项科研基金(20090042120038)资助

详细信息
    作者简介:

    唐建勋 东北大学物流优化与控制研究所、辽宁省制造系统与物流优化重点实验室博士研究生. 主要研究方向为物流运作管理,最优化建模与算法.E-mail: jxtang@cauc.edu.cn

Modeling and Branch-and-price Algorithm for Logistics Optimization Problem of Plant-wide Production Processes in Steel Industry

Funds: 

Supported by National Natural Science Foundation of China (71032004, 71202151) and Doctoral Program Foundation of Institutions of Higher Education of China (20090042120038)

  • 摘要: 研究了钢铁企业的全流程物流优化问题, 该问题在确保全流程各个工序机组产能和库存能力限制以及满足客户需求的前提下, 决策炼钢、连铸、热轧及冷轧工序间的物料流向和流量, 最小化物流成本、产能损失及库存费用. 为该问题建立了混合整数规划(Mixed integer programming, MIP)模型. 在问题求解中, 首先对MIP模型进行了Dantzig-Wolfe分解, 得到一个结构相对简单但列变量数目非常多的主问题和四个描述列向量空间的子问题. 然后, 从一个包含部分列变量的限制主问题出发, 通过子问题和主问题之间的迭代来获取主问题线性松弛的最优解. 最后, 将列生成同分支—定界相结合, 即分支—定价算法, 以获取原问题的整数最优解. 对某钢铁企业的实际生产数据扩展的随机算例进行仿真实验, 结果显示所提出的算法能够在合理计算时间内获得最优解或次优解.
  • [1] Shapiro J F. Modeling the Supply Chain. Duxbury: Thomson Learning, 2001
    [2] Drexl A, Kimms A. Lot sizing and scheduling-survey and extensions. European Journal of Operational Research, 1997, 99(2): 221-235
    [3] van Hoesel S, Romeijn H E, Morales D R, Wagelmans A P M. Integrated lot sizing in serial supply chains with production capacities. Management Science, 2005, 51(11): 1706-1719
    [4] Bredstróm D, Lundgren J T, Rónnqvist M, Carlsson D, Mason A. Supply chain optimization in the pulp mill industry-IP models, column generation and novel constraint branches. European Journal of Operational Research, 2004, 156(1): 2-22
    [5] Carlsson D, Rónnqvist M. Supply chain management in forestry-case studies at Sódra Cell AB. European Journal of Operational Research, 2005, 163(3): 589-616
    [6] Lidestam H, Rónnqvist M. Use of Lagrangian decomposition in supply chain planning. Mathematical and Computer Modelling, 2011, 54(9-10): 2428-2442
    [7] Gunnarsson H, Rónnqvist M. Solving a multi-period supply chain problem for a pulp company using heuristics——an application to Sódra Cell AB. International Journal of Production Economics, 2008, 116(1): 75-94
    [8] Tang Li-Xin, Zhao Ren. A new enhanced-dynasearch & TS for the pickling-rolling scheduling problem. Acta Automatica Sinica, 2010, 36(2): 304-313 (唐立新, 赵任. 强化Dynasearch & TS 算法求解酸轧生产调度问题. 自动化学报, 2010, 36(2): 304-313)
    [9] Zhao Yu-Fang, Tang Li-Xin. Scheduling with agreeable release times and due dates on a single continuous batch processing machine. Acta Automatica Sinica, 2008, 34(8): 957-963 (赵玉芳, 唐立新. 释放时间和工期同序的单机连续型批调度问题. 自动化学报, 2008, 34(8): 957-963)
    [10] Wang Gong-Shu, Tang Li-Xin. Modelling and optimization methods for the sequencing problem with batching decision in the continuous-casting and rolling production. Acta Automatica Sinica, 2012, 38(10): 1713-1720 (汪恭书, 唐立新. 连铸—轧制生产中带有批决策的排序问题的建模与优化方法. 自动化学报, 2012, 38(10): 1713-1720)
    [11] Tang L X, Liu J Y, Rong A Y, Yang Z H. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. European Journal of Operational Research, 2000, 124(2): 267-282
    [12] Chai Tian-You. Challenges of optimal control for plant-wide production processes in terms of control and optimization theories. Acta Automatica Sinica, 2009, 35(6): 641-649 (柴天佑. 生产制造全流程优化控制对控制与优化理论方法的挑战. 自动化学报, 2009, 35(6): 641-649)
    [13] Luo Zhi-Hong, Tang Li-Xin. Modeling and solution to integrated production and logistics planning of steel making and hot rolling. Journal of Management Sciences in China, 2011, 14(6): 16-23 (罗治洪, 唐立新. 炼钢热轧一体化生产与物流计划模型及求解. 管理科学学报, 2011, 14(6): 16-23)
    [14] Dantzig G B, Wolfe P. Decomposition principle for linear programs. Operations Research, 1960, 8(1): 101-111
    [15] Lübbecke M E, Desrosiers J. Selected topics in column generation. Operations Research, 2005, 53(6): 1007-1023
    [16] Desaulniers G, Desrosiers J, Solomon M M. Column Generation. Berlin: Springer-Verlag, 2005
    [17] Desrosiers J, Soumis F, Desrochers M. Routing with time windows by column generation. Networks, 1984, 14(4): 545-565
    [18] Restrepo M I, Lozano L, Medaglia A L. Constrained network-based column generation for the multi-activity shift scheduling problem. International Journal of Production Economics, 2012, 140(1): 466-472
    [19] de Queiroz T A, Miyazawa F K, Wakabayashi Y, Xavier E C. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers and Operations Research, 2012, 39(2): 200-212
    [20] Baldacci R, Mingozzi A, Roberti R. New route relaxation and pricing strategies for the vehicle routing problem. Operations Research, 2011, 59(5): 1269-1283
    [21] Baldacci R, Mingozzi A, Wolfler Calvo R. An exact method for the capacitated location-routing problem. Operations Research, 2011, 59(5): 1284-1296
    [22] Staalhane M, Andersson H, Christiansen M, Cordeau J F, Desaulniers G. A branch-price-and-cut method for a ship routing and scheduling problem with split loads. Computers and Operations Research, 2012, 39(12): 3361-3375
    [23] Muter Ī, Birbil S Ī, Bülbül K, Sahin G, Yenigün H, Tas D, Tüzün D. Solving a robust airline crew pairing problem with column generation. Computers and Operations Research, 2013, 40(3): 815-830
  • 加载中
计量
  • 文章访问数:  1580
  • HTML全文浏览量:  87
  • PDF下载量:  1784
  • 被引次数: 0
出版历程
  • 收稿日期:  2012-02-17
  • 修回日期:  2013-02-18
  • 刊出日期:  2013-09-20

目录

    /

    返回文章
    返回