基于改进SPEA2的原油短期调度问题研究

针对原油短期调度多目标优化问题，在分析已有多目标模型对原油调度过程中的供油罐个数、供油罐切换次数、原油在管道中的混合成本和供油罐罐底混合成本这4个目标优化的基础上，本文建立的模型增加了原油在管道转运过程中的能耗成本这一优化目标，使模型更吻合生产实际。在SPEA2算法中引入极值归档集，结合MOGWO算法指导极值归档集更新来提高算法的全局搜索能力；利用余弦相似度对归档集进行裁剪操作，以保证归档集中个体的多样性。将改进算法与多个具有代表性的进化多目标优化算法进行对比实验，结果表明，本文所提出算法在求解原油短期调度问题时性能较优。     

炼油厂原油处理过程短期生产计划及其复杂性

提出了原油处理过程短期生产计划是否存在可解性的问题。从控制理论的角度出发,建立了原油运作过程的短期生产计划模型,研究了输油管道调度问题的复杂性,最后得出炼油短期生产计划调度原问题为NP hard问题,即该问题很难运用数学规划方法求解的结论。因此需要寻找更为有效的方法求解该类问题。     

混合供油模式下炼油短期生产计划的可调度性分析

炼油生产中,在许多情况下,供油罐的数量不足以使用一个油罐供应一个分馏塔的炼油模式,而需要使用一个油罐供一个分馏塔和一个油罐供两个分馏塔的混合模式。这使得炼油短期生产计划更为复杂。本文从控制理论的角度研究这种混合供油模式下的炼油短期调度问题。通过建立系统的Petri网模型,分析了在混合模式下供油罐的数量和容量、分馏塔数量、管道输油速率对系统可调度性的影响,推导出了可调度的条件。并用一个生产实例对得到的可调度性条件进行了验证.     

原油一次加工过程的多目标调度优化

在制定原油一次加工过程详细调度时,往往需要考虑多个优化目标。本文提出一种基于改进的骨干粒子群算法和II代非支配遗传算法协同进化的双种群算法,并通过Pareto差熵控制种群的交流,优化了供油罐使用成本、供油罐的切换成本、管道中原油混合成本以及供油罐罐底混合成本4个目标。通过一个工业实例,将本文算法与现有的几种具有代表性的进化多目标优化算法进行对比,验证本文算法的可行性和有效性。     

原油租用罐区管理的探讨与分析

文章根据工作中经历的短期租用T57号油罐贸易交接计量、进口原油接卸差量调查以及租用罐区的蒸汽消耗计量结算等典型事例,对租用原油罐区过程中涉及到的退租油罐底量交接、设备维护和能源蒸汽消耗,从计量角度探讨与分析了原油租用罐区的管理,并提出了加强管理的建议和解决方法。     

物联网变送器及AI调度系统在输油管网中的应用

原油输送过程中,油罐液位输油泵开启部位容易出现缺陷,工业中常利用人工观察的方法来杜绝由于管道缺陷而造成的各种问题,随着科技的快速发展,通过智能调控系统对输油管网中的缺陷进行观察有助于提升原油输送的效率。本文主要从物联网变速器和AI调度系统这两个方面出发对其在输油管网中的运用进行了分析和研究,以期降低输油管线由于压力过高而导致的爆管现象。     

炼油短期生产计划辅助决策支持系统

重点介绍了炼油短期生产计划辅助决策支持系统的设计与功能。该系统采用仿真、优先规则和启发式技术实现了短期炼油生产计划制定过程中的决策支持，为解决炼油生产作业计划的自动化提供了一条有效的途径。以两个炼油原油调度情况为例，对系统的运作进行了论述。     

净油罐动态油量计量方法研究

在原油集输自动监控系统中,利用测量得到的净油罐液位、界面和进出油罐原油的含水率,通过计算机对测量信号进行分析,判断原油储罐的不同运行状态,由此推导出各种状态下净油储量的计算公式,实时计算净油储罐中的动态油量.     

双管道原油运输系统的着色赋时可控Petri网建模

针对双管道原油运输（高低凝固点原油）系统,利用着色赋时可控Petri网进行建模,分析多个关键约束,特别是高凝固点原油运输管道的约束。利用模块化建模方法,分层建模,结构严谨,描述系统行为完整,可作为观察系统物流信息和短期生产调度制定的辅助工具。     

原油储罐盼腐蚀分析和访护

加强油罐的防护,选择合适的防腐措施,对于提高油罐的使用寿命,减少油罐事故发生率是很重要的。文章针对原油储罐腐蚀的现状,对原油储罐腐蚀的三种情况：储罐内腐蚀,罐壁外腐蚀以及罐顶外腐蚀的腐蚀原因分别进行了分析,并对油罐的内、外腐蚀提出了具体的防护措施,同时对油罐防护施工中应注意的几个问题进行了探讨。     

A Mixed-Integer Optimization Strategy for Oil Supply in Distribution Complexes

As a result of an increasingly competitive market, companies must find ways to organize their activities regarding their economic outcome. An important feature in this context involves transportation operations, usually considered one of the major bottlenecks in the production chain. While delays imply loss of time and lack of resources, deliveries ahead of the deadlines may cause excess of inventories. Therefore, every company must pursue efficient transportation schedules within their operational planning. This work addresses short-term crude oil scheduling problems in a distribution complex that contains ports, refineries and a pipeline infrastructure capable of transferring oil from the former to the latter. The ports comprise piers, which receive vessels for discharging, storage tanks and a network that connects each other. The refineries have their own storage infrastructure, modeled as a large storage unit, along with crude distillation units, considered as constant level consumers. The problem involves a number of other issues, including intermediate storage, settling tasks and allocation of crude oil by its qualitative characteristics. A decomposition strategy based on large-scale mixed-integer linear programming (MILP) continuous-time models is developed. First, an MILP model that considers an aggregate representation for the pipeline and intermediate storage infrastructure is proposed. Decision variables involve the assignment of oil tankers to piers as well as tanker unloading and pipeline loading operations. The solution of this model provides the initial conditions for MILP models that represent the pipeline and intermediate storage infrastructure at a detailed level. Algorithms based on the LP-based branch-and-bound method are employed. Results from a port scenario of 13 tankers, 4 piers, 14 crude types, 18 storage tanks and 2 pipelines were obtained in approximately 90 minutes from an MILP problem containing 1996 continuous variables, 1039 binary variables and 7203 constraints.     

原油处理过程短期生产计划优化

在原油处理过程短期生产计划的递阶求解方法中,原油处理短期生产计划问题分为上下两层,上层根据市场需求产生一个目标炼油计划;在此基础上,下层得到一个详细生产计划以实现目标炼油计划。研究了在上层目标炼油计划已知的情况下,下层详细生产计划的求解问题。为该问题建立了基于离散时间表示的混合整数线性规划模型,分析了问题的特点并将其进行转化,给出了基于启发式的求解方法,在保证目标炼油计划实现的前提下,对原油转运过程中油品切换及不同油品的罐底混合进行了优化,取得了一定的成果。用一个工业实例验证了启发式规则的可行性和有效性。     

Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution

This paper studies the single-hoist cyclic scheduling problem in electroplating systems with two extended features. One extension is that the products must visit some processing tanks more than once (multi-function tanks). Another is that more than one identical tank is used at some stages. These extensions are common in practical electroplating lines and can increase the lines' processing capacity. However, they make the hoist scheduling problem more complicated and little research has been done to optimize the hoist moves in such extended practical systems. In this paper, we develop a comprehensive mixed integer linear programming model to find optimal solutions to the single-hoist cyclic scheduling problem for electroplating lines with these extensions. Examples are given to demonstrate the effectiveness of the model in different types of problems.     

应用积分方法实现两种常见油罐装油量的计量

文章从实际应用出发,根据采油生产一线现场常用的两种油罐装油计算和计量的需要,基于数学积分原理,导出了2种典型油罐装油量的计算方法,根据不同罐型及不同含水算出了不同液面高度下的装油量换算表。经现场实际应用,表明计量结果准确可靠,较好地解决了生产实际问题,提高了单井罐计量的精度及罐车运输原油的计量精度,此方法可推广应用到其它领域的油罐装液量计量。     

A Disjunctive Model for Scheduling in a Manufacturing and Packing Facility with Intermediate Storage

The problem considered in this paper deals with the short term scheduling of a two stage continuous process with intermediate storage tanks. The major scheduling decisions in this problem are: a) the assignment of orders to various storage tanks; b) the sequence of orders in each unit; c) the timing of various operations in different stages. The problem is highly combinatorial in nature. The major challenge is to develop strong integer programming formulations and to devise efficient solution techniques. An initial model is presented in the form of a disjunctive program which is later transformed to a Mixed Integer Linear Programming (MILP) problem. A number of example problems are solved which highlight the limitations of this model as the number of orders increases. A heuristic based on partial preordering is considered which solves industrial sized problems very quickly. The objective function values for the heuristic solutions are within 7% of the optimal values.     

一个改进的单抓钩周期性排序模型及其在自动化学处理线中的应用

计算机控制的抓钩广泛用于自动化学处理线的工件的运送。抓钩的排序直接影响系统的生产率，抓钩排序的目标是对运送进行排序以极大化生产率。当某工序处理时间非常长时，该工序成为瓶颈。为了去除该瓶颈，系统可以为该工序设计多个处理槽，这称为“多重处理槽”问题。本文提出一个改进的混合整数规划模型以求解有“多重处理槽”的单抓钩周期性排序问题的最优解。实例表明所提出的方法是有效的。