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

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

开关磁阻电机结构性转矩脉动抑制方法

开关磁阻电机具有结构简单、成本低和调速范围广等优势,但其双凸极结构和控制器的开关特性,导致存在转矩脉动现象,使得抑制转矩脉动成为焦点问题。首先从开关磁阻电机的结构和运行机理出发,针对线性解析方法难以分析转矩特征的问题,建立电机有限元模型求解出转矩特征并进行样机验证试验。分析样机结构参数对转矩脉动的影响,针对结构参数耦合问题,选择NSGA-Ⅱ算法在参数优化平台上对样机结构参数进行多目标寻优,在保证优化后样机的转矩脉动系数和平均转矩均优于初始电机的条件下,最终获得样机最优化结果。结果表明,不同结构参数对电机转矩的影响有较大的差异,对结构参数的优化能有效地抑制转矩脉动,该参数优化方法可以为开关磁阻电机结构性转矩脉动抑制提供参考。     

折臂式随车起重机转台的拓扑优化设计

为了使折臂式随车起重机转台在最大应力不超过材料许用应力的前提下实现轻量化设计的目的,通过ADAMS软件仿真确定其极限工况,对转台进行静力学分析及拓扑优化。通过拓扑优化得到了理想的材料分布。基于优化结果调整转台结构,并对改进后的转台进行静力学分析。结果表明,优化后的转台能够满足实际的使用需求。同时,转台质量降低了12%,证明了优化设计的有效性和可行性,并为折臂式随车起重机的相关设计提供了一定的借鉴。     

三种硫化氢吸收剂吸收效率对比及碘酸钾体系吸收条件优化研究

硫化氢具有腐蚀性与毒性，采用吸收剂吸收硫化氢气体是重要的脱硫处理方式。不同的吸收剂在吸收效率上存在较大差别。首先对比了三氯化铁体系、碘酸钾体系和碱性铁氰化钾体系三种不同硫化氢吸收剂的吸收效率。在此基础上重点优化了碘酸钾体系吸收条件参数，讨论了包含浓度、温度、pH、气体流量及时间等因素对硫化氢吸收效率的影响。并建立了四因素三水平正交试验研究较优吸收条件，得到正交试验优化吸收条件为：温度55℃，pH 6.01，硫化氢流量0.3 L·min^-1，吸收时间1 min，该条件下8%（质量）碘酸钾体系的三级吸收效率为51.56%。研究结果对硫化氢吸收处理提供了理论参考，也为间接电解法循环处理研究提供了支持。     

Looking ahead: Joint small group detection and tracking in crowd scenes

Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes.     

Research on optimization design of PWR flow distribution device based on numerical simulation

ABSTRACT

In the lower chamber of pressurized water reactor (PWR), the flow distribution device is the core module to distribute coolant into the core. It has complex structure and numerous design parameters. Therefore, it has important theoretical and practical significance to optimize the device. The mesh independence verification, turbulence model selection, and data processing all can influence the numerical simulation results of the lower chamber, in order to research the influence, a numerical simulation method based on the original model of CNP1000 reactor lower chamber is proposed in this paper. In the method, an optimization design method of flow distribution device is established based on surrogate model. The main design variables and optimization objectives are determined based on the device’s structure and function characteristics. And then it respectively adopts Kriging algorithm and multi-objective genetic algorithm to establish a surrogate model of flow distribution device and optimize it globally. Finally, the optimal design variables are obtained. Compared with the device’s performance before optimization, the after optimization has smaller total pressure loss and more uniform flow. The effectiveness and practicability of proposed optimization design method can be verified.     

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.