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);而在第三周期运行中,催化剂积炭增加等原因导致其异构化活性及选择性降低,异构化产品辛烷值提升能力呈现逐步衰减的趋势,提高反应苛刻度已不能弥补催化剂活性下降造成的产品辛烷值降低。为保证装置长周期运行,建议择机停工对催化剂进行再生,或是直接换用与装置原料性质匹配的异构化催化剂。     

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

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

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.     

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.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

基于GIS单线图的配网停电单模拟操作应用研究

配电网停电会造成电力系统供配电可靠性以及服务质量下降,研究基于地理信息系统(GIS)单线图的配网停电单模拟操作应用。利用网格长度作为基本单位建立坐标系,以选取起始点与终止点为基础,通过四参数法将GIS坐标映射至图纸网格内,实现配网内设备初步布局,将杆塔、站房和整体均匀分布作为优化目标,设置多目标优化目标函数实现GIS单线图最终优化。选取某电力公司配网作为单模拟操作应用对象,模拟结果表明,单模拟操作配网停电后,该配网各负荷点年故障率、次平均停电时间以及年停电时间均有所减少,可有效提升配网的供配电可靠性。