| 炼厂生产计划优化模型 |
| |
| 引用本文： | 高振,唐立新,金辉,徐楠楠. 炼厂生产计划优化模型[J]. 中国化学工程学报, 2008, 16(1): 67-70. DOI: 10.1016/S1004-9541(08)60039-7 |
| |
| 作者姓名： | 高振 唐立新 金辉 徐楠楠 |
| |
| 作者单位： | 1. The Logistics Institute, Northeastern University, Shenyang 110004, China;2. Liaoning Institute of Technology, Jinzhou 121001, China |
| |
| 基金项目： | 国家自然科学基金，国家高技术研究发展计划(863计划)，辽宁省自然科学基金，the Enterprise Post-Doctorial Foundation of Liaoning Province |
| |
| 摘 要： | 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 |
| 收稿时间： | 2007-05-10 |
| 修稿时间： | 2007-10-19 |
An optimization model for the production planning of overall refinery |
| |
| GAO Zhen,TANG Lixin,JIN Hui,XU Nannan. An optimization model for the production planning of overall refinery[J]. Chinese Journal of Chemical Engineering, 2008, 16(1): 67-70. DOI: 10.1016/S1004-9541(08)60039-7 |
| |
| Authors: | GAO Zhen TANG Lixin JIN Hui XU Nannan |
| |
| Affiliation: | 1. The Logistics Institute, Northeastern University, Shenyang 110004, China;2. Liaoning Institute of Technology, Jinzhou 121001, China |
| |
| Abstract: | This article addresses a production planning optimization problem of overall refinery. The authors for-mulated 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. |
| |
| Keywords: | refinery planning lot-sizing optimization column generation |
| 本文献已被 维普 万方数据 ScienceDirect 等数据库收录！ |
| 点击此处可从《中国化学工程学报》浏览原始摘要信息 |
|
点击此处可从《中国化学工程学报》下载免费的PDF全文 |
