A multi-start central force optimization for global optimization

Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance.     

Optimal scheduling of single stage batch plants with direct heat integration

This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method.     

Group sequential crossover trial designs with strong control of the familywise error rate

Crossover designs are an extremely useful tool to investigators, and group sequential methods have proven highly proficient at improving the efficiency of parallel group trials. Yet, group sequential methods and crossover designs have rarely been paired together. One possible explanation for this could be the absence of a formal proof of how to strongly control the familywise error rate in the case when multiple comparisons will be made. Here, we provide this proof, valid for any number of initial experimental treatments and any number of stages, when results are analyzed using a linear mixed model. We then establish formulae for the expected sample size and expected number of observations of such a trial, given any choice of stopping boundaries. Finally, utilizing the four-treatment, four-period TOMADO trial as an example, we demonstrate that group sequential methods in this setting could have reduced the trials expected number of observations under the global null hypothesis by over 33%.     

Application of Vis–NIR hyperspectral imaging in classification between fresh and frozen-thawed pork Longissimus Dorsi muscles

Fresh and frozen-thawed (F-T) pork meats were classified by Vis–NIR hyperspectral imaging. Eight optimal wavelengths (624, 673, 460, 588, 583, 448, 552 and 609 nm) were selected by successive projections algorithm (SPA). The first three principal components (PCs) obtained by principal component analysis (PCA) accounted for over 99.98% of variance. Gray-level-gradient co-occurrence matrix (GLGCM) was applied to extract 45 textural features from the PC images. The correct classification rate (CCR) was employed to evaluate the performance of the partial least squares-discriminate analysis (PLS-DA) models, by using (A) the reflected spectra at full wavelengths and (B) those at the optimal wavelengths, (C) the extracted textures based on the PC images, and (D) the fused variables combining spectra at the optimal wavelengths and textures. The results showed that the best CCR of 97.73% was achieved by applying (D), confirming the high potential of textures for fresh and F-T meat discrimination.     

一种军棋机器博弈的多棋子协同博弈方法

针对在军棋博弈不完全信息对弈中，面对棋子不同价值、不同位置、不同搭配所产生的不同棋力，传统的单子意图搜索算法，不能满足棋子之间的协同性与沟通性，同时也缺乏对敌方的引诱与欺骗等高级对抗能力。本文提出一种结合UCT搜索策略的高价值棋子博弈方法，实现高价值棋子协同博弈的策略。实战经验表明:高价值多棋子军棋协同博弈策略优于单棋子军棋博弈策略。     

因素空间理论下基点分类算法研究

目前，基于因素空间理论的背景基提取算法计算过程复杂，初始化必须依赖各因素极值，基点数量提取冗余等原因，未能在应用中取得很好效果。为此，结合内点判别法和知识可继承、可扩展的思想，提出一种计算简单、初始化独立、基点数量小的改进的背景基提取算法。然后，利用改进的背景基提取算法构造出一种全新的数据分类算法-基点分类算法，基点分类算法以提取每一类样本的背景基为预测模型，再通过新定义的λ-背景基，优化预测模型。数值实验表明:基点分类算法原理简单、构造难度小、分类模型泛化能力强，预测能力准确率高，同时严格的模型限定区域又能为识别新类别提供新方法。     

基于ＰＩＤ控制算法的直流微网容错控制方法研究

构建直流微网容错控制对象模型，调节直流微电网的输出回路参数；以输出功率、直流微网的 参考电压、弱电网下系统惯性响应特征等为约束参量，构建直流微网容错控制目标函数，在不同电网强度下 进行直流微网容错控制的参数自整定性调节，采用无功环比例积分控制方法进行直流微网容错寻优分析， 建立模糊 ＰＩＤ控制模型，采用变结构的模糊 ＰＩＤ控制方法进行直流微网容错控制过程中的自适应加权学习 和误差反馈调节，实现直流微网容错控制改进设计。仿真结果表明，采用该方法进行直流微网控制的容错 性能较好，输出稳定性较强，具有较好的直流微网输出增益。     

基于改进NSGA-Ⅱ算法的乙烯裂解炉操作优化

现有的乙烯裂解炉优化通常只针对两个目标函数即产物乙烯和丙烯的收率，并且采用遗传算法的收敛效果一般，故提出一种基于改进NSGA-Ⅱ算法来研究一个多目标运行的解决方案，以此来解决乙烯裂解炉的固定周期操作优化问题，即在增大产物乙烯和丙烯收率的同时减少原料以及蒸汽流量来提高整体运行状况。把具体问题量化为数学模型，分析了原料气烃比、原料流量、出口温度对乙烯和丙烯收率的影响。实验结果表明，相较于原有操作条件，提出的优化方案具有良好的可行性。     

Static stress analysis of carbon nano-tube reinforced composite (CNTRC) cylinder under non-axisymmetric thermo-mechanical loads and uniform electro-magnetic fields

Static stresses analysis of carbon nano-tube reinforced composite (CNTRC) cylinder made of poly-vinylidene fluoride (PVDF) is investigated in this study. Non-axisymmetric thermo-mechanical loads are applied on cylinder in presence of uniform longitudinal magnetic field and radial electric field. The surrounded elastic medium is modeled by Pasternak foundation because of its advantages to the Winkler type. Distribution of radial, circumferential and effective stresses, temperature field and electric displacements in CNTRC cylinder are determined based on Mori–Tanaka theory. The detailed parametric study is conducted, focusing on the remarkable effects of magnetic field intensity, elastic medium, angle orientation and volume fraction of carbon nano-tubes (CNTs) on distribution of effective stress. Results demonstrated that fatigue life of CNTRC cylinder will be significantly dependent on magnetic intensity, angle orientation and volume fraction of CNTs. Results of this research can be used for optimum design of thick-walled cylinders under multi-physical fields.     

Learning fuzzy controllers in mobile robotics with embedded preprocessing

The automatic design of controllers for mobile robots usually requires two stages. In the first stage, sensorial data are preprocessed or transformed into high level and meaningful values of variables which are usually defined from expert knowledge. In the second stage, a machine learning technique is applied to obtain a controller that maps these high level variables to the control commands that are actually sent to the robot. This paper describes an algorithm that is able to embed the preprocessing stage into the learning stage in order to get controllers directly starting from sensorial raw data with no expert knowledge involved. Due to the high dimensionality of the sensorial data, this approach uses Quantified Fuzzy Rules (QFRs), that are able to transform low-level input variables into high-level input variables, reducing the dimensionality through summarization. The proposed learning algorithm, called Iterative Quantified Fuzzy Rule Learning (IQFRL), is based on genetic programming. IQFRL is able to learn rules with different structures, and can manage linguistic variables with multiple granularities. The algorithm has been tested with the implementation of the wall-following behavior both in several realistic simulated environments with different complexity and on a Pioneer 3-AT robot in two real environments. Results have been compared with several well-known learning algorithms combined with different data preprocessing techniques, showing that IQFRL exhibits a better and statistically significant performance. Moreover, three real world applications for which IQFRL plays a central role are also presented: path and object tracking with static and moving obstacles avoidance.