轧制批量计划问题的模型及算法研究

陈雄, 郭令忠, 徐心和

陈雄, 郭令忠, 徐心和. 轧制批量计划问题的模型及算法研究[J]. 信息与控制, 1997, 26(5): 382-387.
引用本文: 陈雄, 郭令忠, 徐心和. 轧制批量计划问题的模型及算法研究[J]. 信息与控制, 1997, 26(5): 382-387.
CHEN Xiong, GUO Lingzhong, XU Xinhe. MODEL AND ALGORITHM FOR ROLLING BATCH PLANNING[J]. INFORMATION AND CONTROL, 1997, 26(5): 382-387.
Citation: CHEN Xiong, GUO Lingzhong, XU Xinhe. MODEL AND ALGORITHM FOR ROLLING BATCH PLANNING[J]. INFORMATION AND CONTROL, 1997, 26(5): 382-387.

轧制批量计划问题的模型及算法研究

基金项目: 冶金部基础研究课题
详细信息
    作者简介:

    陈雄,33岁,博士生.研究领域为钢铁生产计划与调度,智能算法.
    郭令忠,32岁,副教授.研究领域为CIMS,连铸、连轧过程控制与仿真,生产计划和调度等.
    徐心和,男,57岁,教授,博士生导师.研究领域为CIMS,连铸、连轧过程控制与仿真,管理信息系统,离散优化与调度等.

MODEL AND ALGORITHM FOR ROLLING BATCH PLANNING

  • 摘要: 网络建模在系统分析中是最有效的方法之一,广泛地应用于工业工程和生产调度中.应用组合优化中着名的车辆调度问题分析、研究钢铁生产中传统的轧制批量计划问题,提出一种新的具有优化分割功能的遗传算法,并进行了计算机仿真.仿真结果证实该方法的有效性.
    Abstract: network model is one of the most effective methods for the system analysis, and has been applied widely in industrial engineering and production scheduling. In this paper, the vehicle routing problem of combinational optimization is used to analyse and study the rolling batch planning in steel-making plant. A new genetic algorithm with optimal partitioning function is developed for the problem, and numerical simulation is tested. This algorithm is proved effective by the simulating results.
  • 1 徐心和, 陈 雄, 郭令忠等. 炼钢-连铸-热轧一体化管理. 冶金自动化, 待发表
    2 Eimei Ohnishi, et al.System Technology Supporting Operation of Direct Rolling. Iron Steel, 1988, 7: 1314~1321
    3 Hiroshi Yoshimura, e t al.Production Control System for Dir ect Linked Process between Continous Casters and Hot Strip Mill or Plate Mill at Oita Works, Nippon Steel Co. Iron Steel, 1988, 7: 1323~1330
    4 Chang S Y, Yush in Hong, Chihyuk Jun. Constraint Satis faction Approach to Scheduling DHCR Process. Proceedings of International Conference on Computerized Production Control in Steel Plant, South Korea, 1993: 464~470
    5 Kosiba E D, Wright J R, Cobbs A E. Discrete Event Sequencing as a Traveling Salesm an Problem. Computers in Industry, 1992, 19: 317~327
    6 Jacobs T L, et al. Optimal Inter-process Steel Production Scheduling. Comput Oper Res, 1988
    7 Bodin L, Golden B, Assad A. Routing and Scheduling of Vehicles and Crews : The State of The Art. Comput Oper Res,1983, 10: 62~212
    8 Johns on D S, Papdimitrou C H. Computation Complexity. In : E L Lawler, J K Lensta, A H G Rinnooy Kan, D B Shmoys (eds.) The Traveling Salesman Problem, Wiley, 1985: 37~86
    9 Laporte G. The Vehicle Routing Problem: an Overview of Exact and Approximate Algorithms. European Journal of Research, 1992, 59: 345~358
    10 Holland J h. Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press, 1975
    11 Goldber g D E. Genetic Algorithms in Search, Optimiz ation, Machine Learning. Reading M A: Addison Wesley, 1989
    12 Bellman r. Dynamic Programming. Princeton University Press, Princet on, N J, 1957
    13 Xiong Chen, Weis hui Wan, Xinhe Xu, et al. Model of Rolling Batch Planning and its Solution. to be Published in Pro-ceeding of The Fourth International Conference on Control, Automation, Robotics and Vision (ICA R CV ' 96), Singa-pore, 1996
    14 Bowerman R L, et al.The Spacefilling Curve with Optimal Paritioning Heuristics for VRP. European Journal of O R,194, 76: 128~142
计量
  • 文章访问数:  846
  • HTML全文浏览量:  0
  • PDF下载量:  228
  • 被引次数: 0
出版历程
  • 收稿日期:  1996-12-27
  • 发布日期:  1997-10-19

目录

    /

    返回文章
    返回
    x