基于VMD和BSA-KELM的高陡边坡位移预测模型研究

边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明：和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。     

Designing optical glasses by machine learning coupled with a genetic algorithm

Engineering new glass compositions have experienced a sturdy tendency to move forward from (educated) trial-and-error to data- and simulation-driven strategies. In this work, we developed a computer program that combines data-driven predictive models (in this case, neural networks) with a genetic algorithm to design glass compositions with desired combinations of properties. First, we induced predictive models for the glass transition temperature (T_g) using a dataset of 45,302 compositions with 39 different chemical elements, and for the refractive index (n_d) using a dataset of 41,225 compositions with 38 different chemical elements. Then, we searched for relevant glass compositions using a genetic algorithm informed by a design trend of glasses having high n_d (1.7 or more) and low T_g (500 °C or less). Two candidate compositions suggested by the combined algorithms were selected and produced in the laboratory. These compositions are significantly different from those in the datasets used to induce the predictive models, showing that the used method is indeed capable of exploration. Both glasses met the constraints of the work, which supports the proposed framework. Therefore, this new tool can be immediately used for accelerating the design of new glasses. These results are a stepping stone in the pathway of machine learning-guided design of novel glasses.     

Transition from random packing to stable state in a continuously avalanching granular flow

We investigate the transition evolution from the initial state with the random packing of the particles to the stable state in which successive avalanches exhibit consistent characteristics under the slumping regime. It is found that there exist three distinct stages in the transition evolution, considering the change of the volume fraction. The coordination number is almost unchanged during the transition evolution, which indicates the particle contact form is consistent in the three stages. The pause phenomena are discovered in some avalanches, and the probability of pause occurrence increases continuously in the three consecutive stages. We also explore the distribution of particles in the passive layer at the stable state. The particles in the middle region of the passive layer have the closest packing status, and the deeper the region is located, the later it reaches the stable state.     

A novel strategy based on salp swarm algorithm for extracting the maximum power of proton exchange membrane fuel cell

Cell temperature and water content of the membrane have a significant effect on the performance of fuel cells. The current-power curve of the fuel cell has a maximum power point (MPP) that is needed to be tracked. This study presents a novel strategy based on a salp swarm algorithm (SSA) for extracting the maximum power of proton-exchange membrane fuel cell (PEMFC). At first, a new formula is derived to estimate the optimal voltage of PEMFC corresponding to MPP. Then the error between the estimated voltage at MPP and the actual terminal voltage of the fuel cell is fed to a proportional-integral-derivative controller (PID). The output of the PID controller tunes the duty cycle of a boost converter to maximize the harvested power from the PEMFC. SSA determines the optimal gains of PID. Sensitivity analysis is performed with the operating fuel cell at different cell temperature and water content of the membrane. The obtained results through the proposed strategy are compared with other programmed approaches of incremental resistance method, Fuzzy-Logic, grey antlion optimizer, wolf optimizer, and mine-blast algorithm. The obtained results demonstrated high reliability and efficiency of the proposed strategy in extracting the maximum power of the PEMFC.     

Revealing cracking and breakage behaviours of gibbsite particles

Mitigating gibbsite particle cracking and breakage during industrial alumina production can increase the quality of smelter grade alumina product by reducing the ultrafine particle content. Therefore, it is essential to investigate the particle cracking during static calcination and the breakage of calcined gibbsite particles under external force. In this work, we investigated the impact of the calcination ramping rate and the crystallite size on gibbsite particle cracking during static calcination. A slow ramping rate and a large pristine crystallite size tend to increase particle cracking. Apart from the study of particle cracking behaviour, we also investigated the breakage of calcined gibbsite particle under external force. Cracks on the particle surface can initiate breakage within the crystallite and along the grain boundary under external force. The breakage within crystallite occurs as the cleavage of the crystallite, while the breakage along the grain boundary leads to the shedding of a whole crystallite. We further explored the factors influencing the strength of calcined gibbsite particles. With increasing calcination temperature, the strength of particle increases when gibbsite converts to boehmite, and then decreases when boehmite converts into amorphous alumina. Particles containing smaller crystallites and calcined with fast ramping rates exhibit higher resistance to breakage.     

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

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

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

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

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

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

Robust optimisation of sustainable food grain transportation with uncertain supply and intentional disruptions

The proliferating need for sustainability intervention in food grain transportation planning is anchoring the attention of researchers in the interests of stakeholders and environment at large. Uncertainty associated with food grain supply further intensifies the problem steering the need for designing robust, cost-efficient and sustainable models. In line with this, this paper aims to develop a robust and sustainable intermodal transportation model to facilitate single type of food grain commodity shipments while considering procurement uncertainty, greenhouse gas emissions, and intentional hub disruption. The problem is designed as a mixed integer non-linear robust optimisation model on a hub and spoke network for evaluating near optimal shipment quantity, route selection and hub location decisions. The robust optimisation approach considers minimisation of total relative regret associated with total cost subject to several real-time constraints. A version of Particle Swarm Optimisation with Differential Evolution is proposed to tackle the resulting NP-hard problem. The model is tested with two other state-of the art meta-heuristics for small, medium, and large datasets subject to different procurement scenarios inspired from real time food grain operations in Indian context. Finally, the solution is evaluated with respect to total cost, model and solution robustness for all instances.