本文關(guān)鍵詞： 短期生產(chǎn)計(jì)劃 原油處理 啟發(fā)式 多目標(biāo)優(yōu)化 遺傳算法　出處：《廣東工業(yè)大學(xué)》2016年博士論文　論文類型：學(xué)位論文

【摘要】：煉油工業(yè)是國民經(jīng)濟(jì)發(fā)展的重要支柱產(chǎn)業(yè)。煉油生產(chǎn)計(jì)劃包括長期生產(chǎn)計(jì)劃和短期生產(chǎn)計(jì)劃。長期生產(chǎn)計(jì)劃屬于戰(zhàn)略性計(jì)劃,由于可以看成連續(xù)參數(shù)系統(tǒng)優(yōu)化問題,可以用數(shù)學(xué)規(guī)劃的方法解決,主要是利用線性規(guī)劃進(jìn)行建模和求解。目前對(duì)長期生產(chǎn)計(jì)劃優(yōu)化的理論研究已有成熟的方法。煉油短期生產(chǎn)計(jì)劃和調(diào)度問題,不僅要處理離散事件過程,還要處理連續(xù)變量,為了使煉油廠高效運(yùn)轉(zhuǎn),不僅需要優(yōu)化離散事件執(zhí)行的順序,同時(shí)還要對(duì)連續(xù)變量的值進(jìn)行優(yōu)化。但是,在煉油生產(chǎn)過程的調(diào)度中,事先并不知道需要調(diào)度的具體事件,這些生產(chǎn)作業(yè)需要在計(jì)劃過程中產(chǎn)生。因此,其復(fù)雜性和困難程度遠(yuǎn)遠(yuǎn)大于對(duì)離散過程和批處理過程的調(diào)度。本課題組在前期研究中,證明了煉油短期生產(chǎn)計(jì)劃問題屬于NP-hard問題,這就排除了用精確方法求解該問題的可能性。另外,在獲得煉油短期生產(chǎn)計(jì)劃的過程中,人們不僅需要定義計(jì)劃周期內(nèi)的作業(yè),同時(shí)還需要對(duì)這些作業(yè)進(jìn)行排序,所以不能直接用啟發(fā)式和智能優(yōu)化方法來解決該問題。原油處理短期生產(chǎn)計(jì)劃問題是煉油短期生產(chǎn)計(jì)劃中最困難的問題之一,因此本文僅研究原油處理短期生產(chǎn)計(jì)劃問題。由于啟發(fā)式方法和數(shù)學(xué)規(guī)劃方法都不能直接應(yīng)用于煉油短期生產(chǎn)計(jì)劃問題,本課題組另辟蹊徑,從控制理論角度,將原油處理短期生產(chǎn)計(jì)劃問題分解為上下兩層：在上層求煉油生產(chǎn)計(jì)劃以優(yōu)化相關(guān)目標(biāo),在下層則求解一個(gè)詳細(xì)的短期計(jì)劃以實(shí)現(xiàn)上層煉油計(jì)劃。在課題組的前期研究中,已經(jīng)成功地用基于線性規(guī)劃的方法解決了上層煉油計(jì)劃的優(yōu)化求解問題,但是下層詳細(xì)生產(chǎn)計(jì)劃優(yōu)化亟待解決。因此,本文研究在上層煉油計(jì)劃已知的情況下,研究下層詳細(xì)生產(chǎn)計(jì)劃優(yōu)化問題,主要進(jìn)行了以下幾方面的研究工作：(1)由于數(shù)學(xué)規(guī)劃和啟發(fā)式方法都不能直接地應(yīng)用于原油處理短期生產(chǎn)計(jì)劃問題,因此需要另找一種方法來對(duì)問題進(jìn)行求解,這是本文研究的初衷。首先建立了所研究問題的數(shù)學(xué)規(guī)劃模型,基于此模型分析問題的本質(zhì)特點(diǎn)。定義了原油處理短期生產(chǎn)計(jì)劃問題是由一系列的運(yùn)作決策構(gòu)成,從控制理論角度,將原油處理詳細(xì)生產(chǎn)計(jì)劃問題轉(zhuǎn)換為供油罐到蒸餾塔的指派問題。這樣一來,使得啟發(fā)式算法和智能算法可以用于解決原油處理短期生產(chǎn)計(jì)劃問題,從而克服用數(shù)學(xué)規(guī)劃方法的計(jì)算復(fù)雜性難題。(2)提出了兩種啟發(fā)式算法對(duì)原油處理詳細(xì)生產(chǎn)計(jì)劃問題進(jìn)行求解,兩種方法均能保證給定的上層蒸餾塔煉油計(jì)劃一定能實(shí)現(xiàn)。雖然啟發(fā)式算法簡(jiǎn)單,但不能保證解的最優(yōu)性,不過實(shí)例結(jié)果表明,本文所提出的啟發(fā)式算法對(duì)原油處理詳細(xì)生產(chǎn)計(jì)劃優(yōu)化問題還是有效的。(3)原油處理詳細(xì)生產(chǎn)計(jì)劃問題涉及到多個(gè)優(yōu)化目標(biāo),本文通過加權(quán)和將多目標(biāo)優(yōu)化問題轉(zhuǎn)換為單目標(biāo)優(yōu)化問題,提出了適合問題求解的單目標(biāo)遺傳算法�；诳烧{(diào)度性條件,為了確保解的可行性,提出了一個(gè)轉(zhuǎn)換算法確保所有隨機(jī)產(chǎn)生的染色體都能對(duì)應(yīng)一個(gè)可行的詳細(xì)生產(chǎn)計(jì)劃。并用實(shí)例驗(yàn)證了算法的有效性。(4)提出了解決原油處理詳細(xì)生產(chǎn)計(jì)劃的多目標(biāo)優(yōu)化算法。原油處理詳細(xì)生產(chǎn)計(jì)劃階段涉及到的多個(gè)目標(biāo)是相互沖突的,本文求解基于帕累托最優(yōu)的多目標(biāo)優(yōu)化解。設(shè)計(jì)了一個(gè)長度可變的雙基因染色體來描述下層詳細(xì)煉油計(jì)劃,經(jīng)過巧妙的解碼,使得任何一個(gè)隨機(jī)產(chǎn)生的染色體不需要轉(zhuǎn)換正好對(duì)應(yīng)一個(gè)可行的詳細(xì)生產(chǎn)計(jì)劃。接著,基于改進(jìn)的非支配排序遺傳算法對(duì)問題進(jìn)行求解,并用實(shí)例驗(yàn)證了算法的有效性。本文將原本不能用啟發(fā)式和智能算法求解的原油處理短期生產(chǎn)計(jì)劃問題轉(zhuǎn)換為供油罐到蒸餾塔的指派問題,使得啟發(fā)式算法和智能算法可以用于解決原油處理短期生產(chǎn)計(jì)劃問題,從而克服用數(shù)學(xué)規(guī)劃方法的計(jì)算復(fù)雜性,為開發(fā)實(shí)際可用的優(yōu)化方法提供了途徑,解決了其中的一個(gè)重要難題。
[Abstract]:Oil refining industry is an important pillar industry of the national economy. Petroleum production plan including long-term production planning and short-term scheduling. Long term production plan is a strategic plan, as can be seen as a continuous parameter optimization problem can be solved by the system, the method of mathematical programming, mainly using linear programming modeling and solving. The long-term production planning optimization theoretical research has been mature. Refinery production planning and scheduling problem in the short term, not only to deal with the discrete event process, to deal with continuous variables, in order to make the refinery efficient operation, not only need to optimize the order of execution of discrete events, but also on the values of the continuous variables were optimized. However, in the process of oil refining production scheduling in advance do not know the specific needs of event scheduling, these operations need to produce in the planning process. Therefore, its complexity and difficulties Difficult is far greater than the discrete process and batch process scheduling. This group in the previous study, proved that the refinery short-term scheduling problem belongs to NP-hard, which precludes the possibility of solving the problem with exact methods. In addition, in the short term production plan for oil refining process, people not only need to define the plan within the period of work, but also need to sort these jobs, so you cannot directly use the heuristic and intelligent optimization method to solve the problem. The short-term crude oil processing production planning problem is one of the most difficult problems in the production of refinery short-term plan, so we only study the short-term crude oil processing production planning problem. The heuristic method and mathematical programming method can not be directly applied in refinery short-term scheduling problem, the research group and from the perspective of control theory, the crude oil processing of short-term production Planning problem is decomposed into two layers: in the upper for petroleum production plan to optimize the target, in the lower layer for a detailed plan to achieve short-term upper refining plans. In the early research group, have successfully used the method based on the linear programming optimization problem has been solved on the layer of oil refining project. But with lower production plan optimization to be solved. Therefore, this paper studies on the upper refining schedule is known, optimization of production plan with lower research, the main research work are as follows: (1) by mathematical programming and heuristic methods cannot be directly applied to crude oil processing short-term production planning problem, therefore need to find a way to solve the problem, this is the original intention of this paper. Firstly, mathematical programming model of this model is established, based on analysis of Q The essential characteristics of the subject. The definition of crude oil processing short term production plan is composed of a series of operational decisions, from the perspective of control theory, the crude oil processing detailed production planning problem into a fuel tank to the assignment problem of distillation tower. As a result, the heuristic algorithm and intelligent algorithm can be used to solve the problem of short-term crude oil processing production plan thus, the computational complexity of the problem of taking g mathematical programming method. (2) proposed two heuristic algorithm to solve the production planning problem with crude oil processing, the two methods can ensure the upper crude oil distillation column is given plan will be achieved. Although the heuristic algorithm is simple, but can not guarantee the optimality of the solutions, but the results show that the heuristic algorithm proposed in this paper for crude oil processing detailed production planning optimization problem is effective. (3) crude oil processing with production plan problem Involves multiple optimization objectives through weighted and multi-objective optimization problem is transformed into a single objective optimization problem, proposed a single objective genetic algorithm for solving the problem. Based on the schedulability conditions, in order to ensure the feasibility of the solution, proposed a conversion algorithm to ensure that a randomly generated chromosome can correspond to a with feasible production plan. And verify the validity of the algorithm by an example. (4) is proposed to solve the multi-objective optimization algorithm with crude oil processing production plan. The crude oil processing multiple targets with the production planning stage is related to the conflict, this paper is based on Pareto optimal solutions of multi-objective optimization design of double. A variable length chromosome to describe with lower refining plans, through clever decoding, so that any a randomly generated chromosome without conversion corresponds to a With the production plan. Then, non dominated sorting genetic algorithm to solve the problem based on the improved and verified the validity of the algorithm with examples. This paper originally cannot use heuristic and intelligent algorithms for solving the problem of short-term crude oil processing production plan into fuel tank to the distillation tower assignment problem, the heuristic algorithm and intelligent the algorithm can be used to solve the problem of short-term crude oil processing production plan, and the computational complexity of mathematical programming method taking g, provide a way for the optimization method of practical development, solve one important problem.

【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2016
【分類號(hào)】：F273;F426.72

【相似文獻(xiàn)】

相關(guān)期刊論文 前7條

1 樊昶明;伍乃騏;;原油處理過程短期生產(chǎn)計(jì)劃的輔助仿真[J];工業(yè)工程;2013年02期

2 支淑民;陳剛田;萬世清;王艷;;坨四站原油處理的影響因素及對(duì)策研究[J];價(jià)值工程;2013年18期

3 白麗平;伍乃騏;;煉油廠原油處理過程短期生產(chǎn)計(jì)劃及其復(fù)雜性[J];工業(yè)工程;2011年01期

4 吳月先;新疆陸梁油田百萬噸級(jí)原油處理站正式破土動(dòng)工[J];新疆石油地質(zhì);2001年06期

5 馮耀忠;簡(jiǎn)介俄羅斯降低集油和原油處理費(fèi)用的途徑[J];油田地面工程;1997年05期

6 丁成杰;伍乃騏;白麗平;;基于Petri網(wǎng)原油處理短期生產(chǎn)計(jì)劃可調(diào)度性分析[J];工業(yè)工程;2012年06期

7 ;[J];;年期

相關(guān)會(huì)議論文 前2條

1 崔營雙;王偉華;郭昌文;;系統(tǒng)工程原理在樁西聯(lián)原油處理中的應(yīng)用[A];2005年山東省石油學(xué)會(huì)營銷專業(yè)委員會(huì)論文選編[C];2005年

2 鄧燕;許建華;;王莊油田稠油高效低耗處理工藝研究[A];山東石油學(xué)會(huì)稠油特稠油地面集輸與處理技術(shù)研討會(huì)論文集[C];2009年

相關(guān)博士學(xué)位論文 前1條

1 侯艷;煉油廠原油處理短期生產(chǎn)計(jì)劃調(diào)度優(yōu)化[D];廣東工業(yè)大學(xué);2016年

相關(guān)碩士學(xué)位論文 前4條

1 王新亮;海洋石油原油處理設(shè)備及其電儀加工設(shè)計(jì)[D];西南石油大學(xué);2014年

2 耿亞;基于JIT的煉油生產(chǎn)原油處理短期生產(chǎn)計(jì)劃方法與實(shí)現(xiàn)[D];廣東工業(yè)大學(xué);2006年

3 黎明;煉化企業(yè)原油處理過程短期生產(chǎn)計(jì)劃的兩階段求解方法[D];廣東工業(yè)大學(xué);2012年

4 張思維;混合供油模式下煉油企業(yè)原油處理過程的Petri網(wǎng)建模和短期生產(chǎn)計(jì)劃分析[D];廣東工業(yè)大學(xué);2015年

，

本文編號(hào)：1486167