共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
采用计算流体力学(CFD)方法对SL-Ⅱ型工业乙烯裂解炉辐射段炉膛内的燃烧传热及管内石脑油裂解反应过程进行耦合模拟,建模及耦合求解在CFX中完成。计算时采用标准k-ε双方程湍流模型、旋涡耗散/有限化学速率(EDM/FRC)燃烧模型和离散传播(DT)辐射模型,其中介质辐射特性采用多灰气加权模型;石脑油裂解反应采用Kumar分子反应模型,流体流动方程组由全隐式的耦合算法求解。模拟结果与工业数据吻合良好,验证了模型的可靠性。结果表明,管内裂解产物丙烯和丁烯收率先增后减,甲烷和乙烯收率一直增大;出口管外壁温度沿管长分布因侧壁烧嘴的加入而更加均匀;炉膛中部的回流区使该区温度更加均匀;裂解炉结构的非对称性引起烟气流速分布不对称,进而导致后墙上侧壁烧嘴的供热效率相对前墙侧较低,本文模拟结果为裂解炉进一步设计与改造提供理论指导。 相似文献
4.
5.
采用有限体积数值方法模拟了剪切扰动条件下液晶聚合物的复杂流变性特性。其中剪切扰动系统通过给速度梯度施加一项额外小量而实现。首先,考虑了扰动为零的简单剪切流情形,分别得到了各种典型的分子运动状态,不但为剪切扰动的定性分析作了准备,而且也验证了数值算法的有效性。然后,重点研究了剪切扰动对分子运动行为转变的影响,数值结果表明流场中微小的剪切扰动在低剪切率和高剪切率下对分子演化状态的转变机理并不相同。此外,进一步预测了液晶聚合物流变行为及微观特性的变化,结果发现流场的扰动作用也会显著地改变其相应的物性函数。 相似文献
6.
7.
采用沉积沉淀法制备了一系列碳纳米管改性的Au/CeO2催化剂,以乙醇部分氧化制氢为探针反应,研究了碳纳米管对Au/CeO2催化剂乙醇部分氧化性能的影响,并运用XRD、TPR、BET等方法对催化剂进行了表征。结果表明,碳纳米管的添加提高了Au/CeO2催化剂的比表面积、孔容和吸氧量,催化剂的氢气选择性先随碳纳米管添加量的增加而大幅增加,碳纳米管的添加量达6%~10%时,氢气选择性达到43%。进一步提高碳纳米管的含量,氢气选择性增加幅度不大。碳纳米管的添加可以有效抑制副产物CO的产生。 相似文献
8.
9.
分别考察了异丙醇、异丁醇和异戊醇对2.0% La/HZSM-5催化乙醇脱水制乙烯反应的影响,结合NH3-TPD、BET、TG等催化剂表征结果,对杂醇的影响机理进行了深入分析。研究表明,所考察的3种杂醇在2.0% La/HZSM-5作用下均能发生脱水反应生成诸多易聚合的烯烃类产物,对其催化乙醇脱水的性能产生了明显的影响;而且随着加入杂醇的碳原子数的增加,催化剂的积炭情况逐渐加重,催化性能也有明显下降的趋势。2.0%La/HZSM-5与HZSM-5原粉相比,具有较大的比表面、孔容和表面酸量,拥有强度更强的弱酸中心和强度较弱的强酸中心,催化含杂醇的乙醇脱水制乙烯反应时其催化性能和抗积炭能力得到了明显提升。 相似文献
10.
微波再生技术被广泛认为是一种高效、节能的绿色再生技术。本文通过引入高热导率物质--膨胀石墨制备出新型微波适应型复合活性炭,解决目前活性炭在微波脱附过程中存在的温度梯度问题,同时开发VOCs活性炭吸附-微波再生技术。结果表明,制得的复合活性炭具有与普通商业活性炭相当的吸附性能,且其热导率提高6倍。同时,其甲苯脱附活化能为18.08 kJ·mol-1,低于其在商业活性炭上的微波脱附活化能(24.84 kJ·mol-1)25%以上;相同微波功率下,其脱附床层温度低于实验室制备的普通活性炭10~30℃。所制备的高热导率复合活性炭不仅具有良好的吸附性能,而且具有很好的微波适应性。 相似文献
11.
Both freshwater consumption and wastewater discharge can be reduced significantly when wastewater regeneration recycling is introduced in the design of the water‐using networks (WUNs). However, it is often difficult to design the WUNs involving regeneration recycling. This article presents an iterative method to design the WUNs involving regeneration recycling. The final designs can be obtained without iteration for the networks with known regenerated concentrations, and in a few iterations for the networks with known removal ratios of the contaminants. The method proposed can reduce the following parameters simultaneously, the consumptions of freshwater and the regenerated water, and the concentrations of the stream before regeneration, and all of them reflect the cost of the network involving regeneration recycling. The results of a few literature examples show that the designs obtained in this work are comparable to that obtained in the literature. The proposed method is simple and effective. © 2011 American Institute of Chemical Engineers AIChE J, 2012 相似文献
12.
提出一种具有净化单元氢网络的迭代设计方法。首先假设净化后源物流的量足够大,将之看作系统的新增源物流即可构成具有净化单元的初始氢网络。运用多氢源匹配方法来设计氢网络,从而得到净化后源物流的用量Freg和所有未回用的内部源物流合并计算出的净化后源物流的量Fregtotal。比较Freg和Fregtotal的大小,当Fregtotalreg时,将Fregtotal作为下一次迭代净化后源物流的量的初值,只需几次迭代即可得到最终设计;当Fregtotal≥Freg时,将Freg的值作为最终设计的净化后源物流的用量,按照由Freg值确定出的净化前源物流的量选取杂质浓度较低的未回用的内部源物流用于净化,对此种情况,不需后续迭代即可得到最终设计。对文献中几个实例的研究表明,该方法设计步骤简单可行,不仅能得到氢消耗目标值,而且还能得到氢网络的具体设计。 相似文献
13.
14.
This work develops a heuristic method for the design of batch water-using networks of multiple contaminants with regeneration unit based on the concepts of concentration potential. A water-using network involving regeneration unit can be formed by adding the regenerated stream(s) into the network involving reuse only. In the design procedure of the network operated in a single batch mode, time is taken as the primary factor and concentration potentials as the secondary one. For the networks operated in a repeated mode, the design procedure is similar to that for continuous processes, besides designing the storage tanks with the rules proposed. Continuous regeneration unit is selected in this work. With the proposed method, the network structure corresponding to the minimum freshwater consumption can be obtained. It is shown that the method proposed in this article is simple, effective and has clear engineering meaning. 相似文献
15.
Water network with regeneration schemes (e.g., regeneration reuse, regeneration recycling) can reduce freshwater consumption further than water network merely with direct reuse. Regeneration reuse, compared with regeneration recycling, can additionally avoid unexpected accumulation of contaminants. Owing to these features, process decomposition can help to reduce freshwater usage and wastewater discharge of regeneration reuse water systems and achieve the results, which graphical method delivers. In this article, the effect of decomposition on water‐using process and further on regeneration reuse water system is briefly analyzed on the concentration‐mass load diagram. Then a superstructure and three sequential mathematical models, which take process decomposition into account, are in turn developed to optimize single contaminant regeneration reuse water systems. By several examples, the reliability of the models is verified. Moreover, several decomposition strategies are summarized to realize the regeneration reuse water network, which attains the targets from graphical method. The results indicate that postregeneration concentration has a major impact on the scheme of process decomposition. © 2009 American Institute of Chemical Engineers AIChE J, 2009 相似文献
16.
In this paper, mathematical programming coupled with superstructure is utilized to optimize regeneration recycling water networks at the stage of grass-roots design. The optimization is virtually a multi-objective problem with several important parameters on regeneration recycling involved. Considering the relative importance of these parameters, sequential optimization is adopted to solve this multi-objective problem. Freshwater consumption, regenerated water flowrate and contaminant regeneration load, are in turn minimized, which correspond to three mathematical models. By solving these models step by step, a regeneration recycling water network can be constructed, which is economically favorable in terms of qualitative analysis. The complexity of water network configuration is also taken into account by minimizing the number of interconnections among processes. Additionally several examples are used to demonstrate the application of the proposed methodology. In comparison with the available technologies, the proposed methodology excels in simplicity and adaptability for grass-roots design by exempting from complicated and variable economic parameters. 相似文献
17.
18.
将氢网络中基于剩余率的集成优化法扩展至水网络,以杂质浓度为基础进行分析,提出了基于杂质赤字的再生回用水网络图像集成优化方法。该方法无需图像试差和迭代,通过构建浓度-流量图和杂质赤字图,可确定未考虑再生回用的水网络夹点位置及最小新鲜水用量。并在此基础上,考虑再生装置和水网络的优化以及二者的集成,分析水网络的新鲜水节省量与杂质脱除率、再生水源流量及再生废水浓度的定量关系;构建定量关系图确定最小新鲜水用量随各参数的变化关系、夹点位置、最大新鲜水节省量以及一定再生条件下的极限及最优提纯参数。案例分析表明,该方法简单、高效,对于各工况下的水网络,均可使新鲜水消耗量及废水排放量减小,为工艺设计和操作提供重要的参考。 相似文献
19.
The optimal design of water-using systems involves necessarily the exploitation of all possible water reuse and recycling alternatives. The general problem can be formulated as a non-convex nonlinear program (NLP), but due to the presence of bilinear terms, it may be difficult for local optimization solvers to attain global optimal solutions. To overcome this difficulty, this paper presents two mixed integer linear programming (MILP)-based procedures to generate a few structurally different starting points for the NLP. In both, the problem is decomposed into calculation stages by assuming that the water streams progress in series through the water-using units, with the binary variables selecting which unit belongs to a certain stage. Their main difference concerns the way fixed flowrate units are handled, either separately or in conjunction with a fixed load operation, since the former comprise a linear subsystem. The two algorithms are compared to a closely related LP-based method taken from the literature and to the one employed by the global optimization solver BARON. The results from a large set of example problems confirm their effectiveness in avoiding local solutions despite the small number of starting points. In contrast to the previous method they are easily scalable and, for some of the larger problems, could find better solutions than BARON with significantly fewer computational resources. The results have also shown that the option of tackling one unit at a time is the most favorable. 相似文献
20.
We address a special class of bilinear process network problems with global optimization algorithms iterating between a lower bound provided by a mixed-integer linear programming (MILP) formulation and an upper bound given by the solution of the original nonlinear problem (NLP) with a local solver. Two conceptually different relaxation approaches are tested, piecewise McCormick envelopes and multiparametric disaggregation, each considered in two variants according to the choice of variables to partition/parameterize. The four complete MILP formulations are derived from disjunctive programming models followed by convex hull reformulations. The results on a set of test problems from the literature show that the algorithm relying on multiparametric disaggregation with parameterization of the concentrations is the best performer, primarily due to a logarithmic as opposed to linear increase in problem size with the number of partitions. The algorithms are also compared to the commercial solvers BARON and GloMIQO through performance profiles. 相似文献