Robust optimal operation of continuous catalytic reforming process under feedstock uncertainty

The continuous catalytic regenerative (CCR) reforming process is one of the most significant sources of hydrogen production in the petroleum refining process. However, the fluctuations in feedstock composition and flow rate could significantly affect both product distribution and energy consumption. In this study, a robust deviation criterion based multi-objective optimization approach is proposed to perform the optimal operation of CCR reformer under feedstock uncertainty, with simultaneous maximization of product yields and minimization of energy consumption. Minimax approach is adopted to handle these uncertain objectives, and the Latin hypercube sampling method is then used to calculate these robust deviation criteria. Multi-objective surrogate-based optimization methods are next introduced to effectively solve the robust operational problem with high computational cost. The level diagram method is finally utilized to assist in multi-criteria decision-making. Two robust operational optimization problems with different objectives are solved to demonstrate the effectiveness of the proposed method for robust optimal operation of the CCR reforming process under feedstock uncertainty.     

Identifying catalyst layer compositions of proton exchange membrane fuel cells through machine-learning-based approach

Membrane electrode assembly (MEA) is considered a key component of a proton exchange membrane fuel cell (PEMFC). However, developing a new MEA to meet desired properties, such as operation under low-humidity conditions without a humidifier, is a time- and cost-consuming process. This study employs a machine-learning-based approach using K-nearest neighbor (KNN) and neural networks (NN) in the MEA development process by identifying a suitable catalyst layer (CL) recipe in MEA. Minimum redundancy maximum relevance and principal component analysis were implemented to specify the most important predictor and reduce the data dimension. The number of predictors was found to play an essential role in the accuracy of the KNN and NN models although the predictors have self-correlations. The KNN model with a K of 7 was found to minimize the model loss with a loss of 11.9%. The NN model constructed by three corresponding hidden layers with nine, eight, and nine nodes can achieve the lowest error of 0.1293 for the Pt catalyst and 0.031 for PVA as a good additive blending in the CL of the MEA. However, even if the error is low, the prediction of PVA seems to be inaccurate, regardless of the model structure. Therefore, the KNN model is more appropriate for CL recipe prediction.     

炼油废白土在水泥厂燃煤自备电厂中再利用的实践

本项目主要研究和实现了工业废白土在BAYAH燃煤自备电厂中的再利用,实现变废为宝,减少了环境污染,同时为企业创造了一定的经济效益。针对废白土的特性,对燃料输送系统给煤机、皮带机、煤仓、下料溜子和排渣系统进行了改造。通过修改操作规程消除废白土对锅炉运行的影响。     

NNI-1型C_5/C_6烷烃异构化催化剂长周期运行分析及建议

中国石化海南炼油化工有限公司0.2 Mt/a C5/C6烷烃异构化装置以连续重整装置的拔头油为原料,使用NNI-1催化剂,采用一次通过流程,不设脱异戊烷塔和稳定塔,经设在连续重整装置内的脱丁烷塔稳定处理后作为汽油调合组分。该装置于2006年9月开工投产,截至2015年3月已连续运行3个周期。长周期运行分析结果表明:前两个周期中NNI-1催化剂具有较高的异构化活性及选择性,C5异构化率为60%左右,C6异构化率为80%左右,C6选择性为15%左右,产品辛烷值基本达到技术指标要求(RON≥78);而在第三周期运行中,催化剂积炭增加等原因导致其异构化活性及选择性降低,异构化产品辛烷值提升能力呈现逐步衰减的趋势,提高反应苛刻度已不能弥补催化剂活性下降造成的产品辛烷值降低。为保证装置长周期运行,建议择机停工对催化剂进行再生,或是直接换用与装置原料性质匹配的异构化催化剂。     

Exploring design trade-offs for achieving social inclusion in multi-tiered design problems

ABSTRACT

The digital age of the future is ‘not out there to be discovered’, but it needs to be ‘designed’. The design challenge has to address questions about how we want to live, work, and learn (as individuals and as communities) and what we value and appreciate, e.g.: reflecting on quality of life and creating inclusive societies. An overriding design trade-off for the digital age is whether new developments will increase the digital divide or will create more inclusive societies. Sustaining inclusive societies means allowing people of all ages and all abilities to exploit information technologies for personally meaningful activities. Meta-design fosters the design of socio-technical environments that end-user developers can modify and evolve at use time to improve their quality of life and favour their inclusion in the society. This paper describes three case studies in the domain of assistive technologies in which end users themselves cannot act as end-user developers, but someone else (e.g.: a caregiver or a clinician) must accept this role requiring multi-tiered architectures. The design trade-offs and requirements for meta-design identified in the context of the case studies and other researchers’ projects are described to inform the development of future socio-technical environments focused on social inclusion.     

无人机在输电线路巡检中的多种应用

无人机技术目前的快速发展使得我们国家输电线路自身的巡检能力得到了持续的提升,基于此本文在对无人机技术给予认识的情况下,在了解了输电线路巡检过程中的使用优势之后,还总结了无人机技术在当前我国线路巡检过程中的应用路径以及应用方法;之后使用案例分析的方式分析了无人机技术在当前输电线路巡检过程中的应用方法。     

A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.     

Development of a novel algorithm for optimal capacitor placement in distribution systems

Optimal capacitor placement in distribution systems solved by the hybrid method of CODEQ (called HCODEQ method) is proposed in this work. The concepts of chaotic search, opposition-based learning, and quantum mechanics are used in the CODEQ method to overcome the drawback of parameters selection in the differential evolution (DE). However, a larger population size must be used in the CODEQ method. That is a drawback for all evolutionary algorithms (EAs). To overcome this drawback, acceleration operation and migrating operation are embedded into the CODEQ method, i.e. HCODEQ method. The use of these two operations can increase the convergence speed without decreasing the diversity among individuals. One benchmark function and various-scale capacitor placement systems are used to compare the performance of the proposed method, CODEQ method, DE, simulated annealing (SA), and ant system (AS). Numerical results show that the performance of the HCODEQ method is better than the other methods.     

On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.