An optimization model and algorithm for the production planning of overall refinery
This paper addressed a production planning optimization problem of overall refinery. We formulate the optimization problem as mixed integer linear programming. The model considers the main factors for optimizing the production plan of overall refinery related to use of run-modes of processing units. The aim of the planning is to decide which run-mode to use in each processing unit in each period of a given horizon in order to satisfy the demand while minimizing the total cost of production and Inventory. 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. We propose 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 paper. The computational results verify the effectiveness of the proposed model and solution method.
Refinery planning Lot-sizing Optimization Column generation
GAO Zhen TANG Lixin JIN Hui XU Nannan
The Logistics Institute,Northeastern University,Shenyang,110004,China The Logistics Institute,Northeastern University,Shenyang,110004,China;Liaoning Institute of Technolo
国际会议
西安
英文
2007-08-15（万方平台首次上网日期，不代表论文的发表时间）