工业工程 ›› 2014, Vol. 17 ›› Issue (3): 79-85.

• 实践与应用 • 上一篇    下一篇

原油处理过程短期生产计划优化

  

  1. 广东工业大学 1.机电工程学院; 2.计算机学院,广东 广州 510006
  • 出版日期:2014-06-30 发布日期:2014-07-14
  • 作者简介:候艳(1977-),女,湖北省人,讲师,博士研究生,主要研究方向为离散事件系统、生产调度与控制等
  • 基金资助:

    国家自然科学基金资助项目(61273036)

Optimization of Short-Term Scheduling for Crude Oil Operations

  1. 1.School of Mechatronics Engineering, 2.School of Computer, Guangdong University of Technology, Guangzhou 510006, China
  • Online:2014-06-30 Published:2014-07-14

摘要: 在原油处理过程短期生产计划的递阶求解方法中,原油处理短期生产计划问题分为上下两层,上层根据市场需求产生一个目标炼油计划;在此基础上,下层得到一个详细生产计划以实现目标炼油计划。研究了在上层目标炼油计划已知的情况下,下层详细生产计划的求解问题。为该问题建立了基于离散时间表示的混合整数线性规划模型,分析了问题的特点并将其进行转化,给出了基于启发式的求解方法,在保证目标炼油计划实现的前提下,对原油转运过程中油品切换及不同油品的罐底混合进行了优化,取得了一定的成果。用一个工业实例验证了启发式规则的可行性和有效性。

关键词: 炼油, 详细生产调度, 启发式, 混合整数线性规划, 优化

Abstract: A shortterm scheduling problem for crude oil operations can be divided into two levels by hierarchical method. At the upper level, a realizable refining schedule is obtained to optimize concerned objectives. At the lower level a detailed schedule is gotten to realize it.A refining schedule is known in this paper, with the goal to find the detailed production scheduling to realize it. A mixed integer linear programming (MILP) model based on discrete time representation is developed. After analysing the characteristic of the problem, it is transformed and can be solved by the heuristic algorithm which is presented in this paper. The algorithm not only ensures to obtain the target refining schedule, and also optimizes the switchtimes of crude oil in oil transportation and the mixtimes of tank heels. Finally, an industrial case study is presented to show the feasibility and validity of the proposed heuristic algorithm.

Key words: oil refining, detailed production scheduling, heuristic, mixed integer linear programming(MILP), optimization