Influence of CO2 inleakage on the slight-alkalization of generator internal cooling water

The slight-alkalization of generator internal cooling water (GICW) is widely used to inhibit the corrosion of hollow copper conductor and thereby ensure the safe operation of the generator. CO₂ inleakage is increasingly identified as a potential security risk for GICW system. In this paper, the influence of CO₂ inleakage on the slight-alkalization of GICW was theoretically discussed. Based on the equilibriums of the CO₂-NaOH-H₂O system, CO₂ inleakage saturation was derived to quantify the amount of the dissolved CO₂ in GICW. This parameter can be directly calculated with the measured conductivity and the [Na⁺] of GICW. The influence of CO₂ inleakage on the slight-alkalization conditioning of GICW and the measurement of its water quality parameters were then analyzed. The more severe the inleakage, the narrower the water quality operation ranges of GICW, resulting in the more difficult the slight-alkalization conditioning of GICW. The temperature calibrations of the conductivity and the pH value of GICW show non-linear correlations with the amount of CO₂ inleakage and the NaOH dosage. This study provides insights into the influence of CO₂ inleakage on the slight-alkalization of GICW, which can serve as the theoretical basis for the actual slight-alkalization when CO₂ inleakage occurs.     

Sputtered Ir–Ru based catalysts for oxygen evolution reaction: Study of iridium effect on stability

Magnetron sputtered low-loading iridium-ruthenium thin films are investigated as catalysts for the Oxygen Evolution Reaction at the anode of the Proton Exchange Membrane Water Electrolyzer. Electrochemical performance of 50 nm thin catalysts (Ir pure, Ir–Ru 1:1, Ir–Ru 1:3, Ru pure) is tested in a Rotating Disk Electrode. Corresponding Tafel slopes are measured before and after the CV-based procedure to compare the activity and stability of prepared compounds. Calculated activities prior to the procedure confirm higher activity of ruthenium-containing catalysts (Ru pure > Ir–Ru 1:3 > Ir–Ru 1:1 > Ir pure). However, after the procedure a higher activity and less degradation of Ir–Ru 1:3 is observed, compared to Ir–Ru 1:1, i.e. the sample with a higher amount of unstable ruthenium performs better. This contradicts the expected behavior of the catalyst. The comprehensive chemical and structural analysis unravels that the stability of Ir–Ru 1:3 sample is connected to RuO₂ chemical state and hcp structure. Obtained results are confirmed by measuring current densities in a single cell.     

基于PBFT区块链技术的电网企业仓储系统

提出了一种基于实用拜占庭容错(PBFT)算法的区块链技术,首先对传统的实用拜占庭容错算法原理进行了阐述,该传统算法包含前期、需求、预准备、准备、确认、答复6个阶段,但传统算法具有实时性差、缺乏惩罚机制、带宽高的缺点。针对出现的这些问题,又对传统算法进行了改进,具体涉及记账节点、共识过程以及视图切换过程。通过测试进一步证明了该改进算法的实用性,并将该算法应用于电网企业中,构建的虚拟仓库实现了联储联备,降低了库存资金的耗费,并且提高了电网企业库存管理的效率。     

基于改进D?Lite遗传算法路径规划研究

针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。     

基于神经网络和遗传算法的锭子弹性管性能优化

为得到减振弹性管对下锭胆的支承弹性和锭子高速运动下的稳定性等性能的最优匹配效率,依据减振弹性管的等效抗弯刚度及底部等效刚度系数公式,利用MatLab数值分析软件构建弹性管抗弯刚度和底部挠度数学模型。首先,结合Isight优化软件基于径向基神经网络构建其近似模型,且使精度达到可接受水平,并以模型的关键结构参数弹性模量、螺距、槽宽、壁厚为设计变量,结合遗传算法对弹性管抗弯刚度和底部挠度进行多目标优化设计,得到Pareto最优解集和Pareto前沿图,确定出减振弹性管结构工艺参数的优化方案。通过对优化数据进行分析发现,该方案在保证减振弹性管弹性的同时,其底部振幅明显减弱。     

Optimal design of nonlinear model predictive controller based on new modified multitracker optimization algorithm

The controller design for the robotic manipulator faces different challenges such as the system's nonlinearities and the uncertainties of the parameters. Furthermore, the tracking of different linear and nonlinear trajectories represents a vital role by the manipulator. This paper suggests an optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA). The proposed modification of the MTOA is carried out based on opposition-based learning (OBL) and quasi OBL approaches. This modification improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum. The proposed method is applied on the robotic manipulator to track different linear and nonlinear trajectories. The NLMPC parameters are tuned by the MMTOA rather than the trial and error method of the designer. The proposed NLMPC based on MMTOA is compared with the original MTOA, genetic algorithm, and cuckoo search algorithm in literature. The superiority and effectiveness of the proposed controller are confirmed to track different linear and nonlinear trajectories. Furthermore, the robustness of the proposed method is emphasized against the uncertainties of the parameters.     

Automatic generation of variants depending on changes of product properties in a flexible manufacturing environment

Competition forces manufacturing systems to be flexible and to increase product variety and process complexity. These tasks depend on the flexible design of a bill of materials (BOM), one of the most important inputs in manufacturing planning and control systems. Product variety forces systems to generate BOMs with regard to product properties through a BOM pattern. A variant bill of materials provides a structure to manage product variability. In this study, an algorithm is designed to build a BOM pattern using computer-aided design and computer-aided manufacturing (CAD/CAM) data, and another algorithm is designed to generate variants with regard to product specifications. Genetic algorithm is used to generate new products to provide high product variability for testing algorithms. After the test, both algorithms are applied to a real industry problem. The BOM pattern is built automatically using CAD/CAM data, and variants are generated with regard to the pattern, and the results are discussed.     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.