CAJ | 학술논문

在原油处理过程短期生产计划的递阶求解方法中，原油处理短期生产计划问题分为上下两层，上层根据市场需求产生一个目标炼油计划；在此基础上，下层得到一个详细生产计划以实现目标炼油计划。研究了在上层目标炼油计划已知的情况下，下层详细生产计划的求解问题。为该问题建立了基于离散时间表示的混合整数线性规划模型，分析了问题的特点并将其进行转化，给出了基于启发式的求解方法，在保证目标炼油计划实现的前提下，对原油转运过程中油品切换及不同油品的罐底混合进行了优化，取得了一定的成果。用一个工业实例验证了启发式规则的可行性和有效性。
재원유처리과정단기생산계화적체계구해방법중，원유처리단기생산계화문제분위상하량층，상층근거시장수구산생일개목표련유계화；재차기출상，하층득도일개상세생산계화이실현목표련유계화。연구료재상층목표련유계화이지적정황하，하층상세생산계화적구해문제。위해문제건립료기우리산시간표시적혼합정수선성규화모형，분석료문제적특점병장기진행전화，급출료기우계발식적구해방법，재보증목표련유계화실현적전제하，대원유전운과정중유품절환급불동유품적관저혼합진행료우화，취득료일정적성과。용일개공업실례험증료계발식규칙적가행성화유효성。
A short-term scheduling problem for crude oil operations can be divided into two levels by hier-archical method .At the upper level , a realizable refining schedule is obtained to optimize concerned ob-jectives.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 pro-gramming （ MILP） model based on discrete time representation is developed .After analysing the charac-teristic 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 .