SCI和EI收录∣中国化工学会会刊

›› 2008, Vol. 16 ›› Issue (1): 67-70.

• SELECTED PAPERS FROM THE 4th INTERNATIONAL SYMPOSIUM ON DESIGN, OPERATION AND CONTROL OF CHEMICAL PROCESSES • Previous Articles     Next Articles

An Optimization Model for the Production Planning of Overall Refinery

GAO Zhen1, TANG Lixin2, JIN Hui1,2, XU Nannan1   

  1. 1. The Logistics Institute, Northeastern University, Shenyang 110004, China;
    2. Liaoning Institute of Technology, Jinzhou 121001, China
  • Received:2007-05-10 Revised:2007-10-19 Online:2008-02-28 Published:2008-02-28
  • Supported by:
    the National Natural Science Foundation for Distinguished Young Scholars of China (No.70425003);the National High Technology Research and Development Program of China (No.2006AA04Z174);the Natural Science Foundation of Liaoning Province (No.20061006) ;the Enterprise Post-Doctorial Foundation of Liaoning Province.

An Optimization Model for the Production Planning of Overall Refinery

高振1, 唐立新2, 金辉1,2, 徐楠楠1   

  1. 1. The Logistics Institute, Northeastern University, Shenyang 110004, China;
    2. Liaoning Institute of Technology, Jinzhou 121001, China
  • 通讯作者: GAO Zhen, E-mail: gzneu@126.com
  • 基金资助:
    the National Natural Science Foundation for Distinguished Young Scholars of China (No.70425003);the National High Technology Research and Development Program of China (No.2006AA04Z174);the Natural Science Foundation of Liaoning Province (No.20061006) ;the Enterprise Post-Doctorial Foundation of Liaoning Province.

Abstract: This article addresses a production planning optimization problem of overall refinery. The authors formulated the optimization problem as mixed integer linear programming. The model considers the main factors for optimizing the production plan of overall refinery related to the use of run-modes of processing units. The aim of this planning is to decide which run-mode to use in each processing unit in each period of a given horizon, to satisfy the demand, such as the total cost of production and inventory is minimized. The resulting model can be regarded as a generalized lot-sizing problem where a run-mode can produce and consume more than one product. The resulting optimization problem is large-sized and NP-hard. The authors have proposed a column generation-based algorithm called branch-and-price (BP) for solving the interested optimization problem. The model and implementation of the algorithm are described in detail in this article. The computational results verify the effectiveness of the proposed model and the solution method.

Key words: refinery planning, lot-sizing, optimization, column generation

摘要: This article addresses a production planning optimization problem of overall refinery. The authors formulated the optimization problem as mixed integer linear programming. The model considers the main factors for optimizing the production plan of overall refinery related to the use of run-modes of processing units. The aim of this planning is to decide which run-mode to use in each processing unit in each period of a given horizon, to satisfy the demand, such as the total cost of production and inventory is minimized. The resulting model can be regarded as a generalized lot-sizing problem where a run-mode can produce and consume more than one product. The resulting optimization problem is large-sized and NP-hard. The authors have proposed a column generation-based algorithm called branch-and-price (BP) for solving the interested optimization problem. The model and implementation of the algorithm are described in detail in this article. The computational results verify the effectiveness of the proposed model and the solution method.

关键词: refinery planning, lot-sizing, optimization, column generation