基于分布式猴群算法的传感器优化布置方法研究

建立了针对具有较多自由度的大型结构传感器优化布置的分布式猴群算法。通过引入双重编码的方式, 克服了原猴群算法只能解决连续变量的缺陷;针对单个猴群全局搜索能力较弱的问题, 提出了一种将初始化产生的大量猴子个体按照指定的方式分配到多个猴群进行同步并行搜索的方法;考虑原猴群算法能够跳出局部最优的特点以及和声算法较强的局部搜索能力, 提出将每个猴群得到的初步最优解作为初始和声记忆库, 采用基本和声算法进行二次搜索的方法, 来获取传感器的最终布设方案。文末以大连国贸大厦为例, 进行了参数敏感性分析以及传感器优化布置方案的选择, 结果表明分布式猴群算法具有较强的全局寻优能力, 非常适用于具有较多自由度的大型结构传感器优化布置。     

基于自适应引力算法的桥梁监测传感器优化布置

针对桥梁健康监测中传感器布置优化问题,提出了一种基于自适应引力算法的传感器优化布置方法。以模态置信准则为基础,构造满足传感器优化布置的适应度函数;针对引力搜索算法开发能力不足,对衰减因子α进行了自适应改进。搜索初期α较小,粒子以较大步长进行全局搜索,增强了算法的搜索效率;搜索后期α较大,粒子以较小的步长进行局部搜索,提高了算法的搜索能力,避免落入局部极值点。改进后的自适应引力算法通过双重编码的方式,使算法可以解决离散型的传感器布置问题;以马水河大桥为例,验证算法的可行性。结果表明,改进后的算法有很好的寻优能力,能够准确高效的确定传感器优化位置。     

基于自适应猴群算法的传感器优化布置方法研究

针对猴群算法中爬过程和望过程的搜索方式较为机械,以及跳过程的方式较为单一的问题,提出了一种用于传感器优化布置的自适应猴群算法。采用双重编码的方式,克服了原猴群算法只能解决连续变量优化问题的缺陷;对爬过程和望过程进行了改进,使其能够自适应选择这两个搜索方式以提高算法的局部搜索能力和效率;提出了两种全新的跳过程,即反射跳和变异跳,来增强算法的全局搜索能力。文末以大连国贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择,结果表明自适应猴群算法的搜索效率较原猴群算法有了大幅提高,能较好地解决传感器优化布置问题。     

基于改进萤火虫算法的摩擦模型参数辨识及补偿

针对影响电液伺服系统跟踪性能的非线性摩擦干扰问题，提出了一种改进的萤火虫算法对摩擦模型的参数进行辨识，通过将自适应步长和惯性因子相结合，对丧失移动能力的萤火虫进行随机优化处理，并引入全局并行搜索能力，提高了萤火虫算法的寻优能力。通过函数寻优和参数辨识测试，结果表明改进的萤火虫算法具有更好的寻优性能。最后基于辨识模型搭建摩擦状态观测器，对于仿真中速度零点的抖振现象，引入SIGMOID函数修正摩擦观测器，实验结果表明，经修正的前馈模糊控制器可以有效地抑制摩擦对伺服系统的不利影响，进一步提高伺服系统的跟踪性能。     

基于改进萤火虫算法优化BP神经网络的水电站厂房振动预测

利用萤火虫算法优化BP神经网络权值和阈值基础上,建立水电站厂房振动响应预测模型。针对萤火虫算法存在的收敛速度慢、易陷入局部最优等问题,引入动态随机局部搜索机制加快收敛速度,对当前最优解进行变异操作避免陷入局部最优,提出动态步长更新措施提高计算精度,改进最优解振荡问题。仿真实例表明,基于改进萤火虫算法优化的BP网络模型预测精度和收敛速度等性能得到明显改善,可用于水电站厂房结构振动响应预测。     

基于小生境猴群算法的传感器优化布置方法研究

将小生境进化理论引入到猴群算法中,提出了一种用于传感器优化布置的小生境猴群算法。采用双重编码的方式,克服了原猴群算法只能解决连续变量优化问题的缺陷,并采用混沌搜索的方式产生初始猴群位置,使猴群均匀分布;将猴群分为多个小生境猴群系统,形成各自独立的搜索空间;基于共享适应度的方法对小生境猴群进行末尾淘汰,并随机初始化产生新的猴子,提高小生境猴群的多样性;利用各个小生境猴群的平均适应度替换机制使得优良猴子位置信息能够得到共享,提高算法的整体搜索性能和收敛效率。文末以大连国贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择,结果表明小生境猴群算法的搜索效率较原猴群算法有了大幅提高,能较好地解决传感器优化布置问题。     

利用分布式狼群算法进行三维传感器优化布置的方法研究

考虑传感器优化布置中的模态置信准则MAC只能对三维传感器的某一方向进行优化,而不能确保在三个方向同时实现优化布置的问题,提出将节点的三个平动自由度作为一个单元,通过节点的Fisher信息阵来获取结构所布置传感器的Fisher信息阵,并借鉴传统一维模态置信准则的思想,构建了一种全新的三维模态置信准则TMAC。为提高算法的求解效率,提出了一种分布式狼群算法,采用双重编码方式,克服原狼群算法只能求解连续变量优化的问题;采用狼群分组的方法,通过组内狼个体的信息交流,提高了算法的搜索效率。文末以中佛罗里达大学建立的基准模型为例,进行了参数敏感性分析以及三维传感器优化布置方案的选择,结果表明:分布式狼群算法的搜索能力较原狼群算法有了大幅提高,能较好地解决传感器优化布置问题。     

多种群遗传算法在篦冷机二次风温预测中的应用

针对GA遗传算法种群多样性差、局部寻优能力差等问题,提出了多种群遗传算法(MGA)。该算法利用间断平衡理论,构建多种群、多交叉算子操作方式并结合局部搜索方法和种群动态调整策略,提高算法的局部寻优能力和寻优速度。通过与GA和ISGA算法相比,MGA运行时间短,搜索性能强。利用MGA优化MKLSSVM参数,建立基于MGA-MKLSSVM的水泥篦冷机二次风温预测模型。结果表明,此模型辨识精度高、泛化能力强。     

基于改进遗传算法的桥梁结构传感器优化布置

为了解决桥梁结构健康监测中的传感器优化布置问题,提出一种基于二重结构编码遗传算法的传感器优化布置方法.首先改进了编码方法,采用二重结构编码进行种群的初始化、交叉和变异,然后选择时采用最优保存策略,交叉时采用自适应部分匹配交叉,变异时采用自适应逆位变异.该法克服了传统遗传算法应用于大型结构时收敛速度慢且易陷入局部最优的缺陷,大大加快了收敛速度,并确保能够搜索到最优解.最后通过一个桥梁工程的实例分析,证明了该法在搜索能力、计算效率和可靠性方面明显优于序列法,可广泛地应用于桥梁结构的健康监测.     

求解VRP问题的混沌模拟退火萤火虫算法

目的使萤火虫优化算法(GSO)能够适用于车辆路径问题(VRP)的求解,同时提高该算法的求解性能。方法通过对GSO算法的改进,提出求解VRP问题的混沌模拟退火萤火虫优化算法(CSAGSO)。首先,设计改进的GSO算法(IGSO)使IGSO算法能够适应VRP问题的求解;其次,在IGSO算法中引入模拟退火机制,提出模拟退火萤火虫优化算法(SAGSO),使IGSO算法可有效避免陷入局部极小并最终趋于全局最优。然后,在SAGSO算法中引入混沌机制,提出CSAGSO算法,对SAGSO算法的荧光素浓度值进行混沌初始化和混沌扰动;最后,对标准算例集进行仿真测试。结果与遗传算法、蚁群算法和粒子群算法相比,CSAGSO算法的全局寻优能力、收敛速度及稳定性均改善了50%以上。结论对GSO算法的改进是合理的,且CSAGSO算法的全局优化能力、收敛速度和稳定性均优于遗传算法、蚁群算法和粒子群算法。     

A Pareto firefly algorithm for multi-objective disassembly line balancing problems with hazard evaluation

The safety hazards existing in the process of disassembling waste products pose potential harms to the physical and mental health of the workers. In this article, these hazards involved in the disassembly operations are evaluated and taken into consideration in a disassembly line balancing problem. A multi-objective mathematical model is constructed to minimise the number of workstations, maximise the smoothing rate and minimise the average maximum hazard involved in the disassembly line. Subsequently, a Pareto firefly algorithm is proposed to solve the problem. The random key encoding method based on the smallest position rule is used to adapt the firefly algorithm to tackle the discrete optimisation problem of the disassembly line balancing. To avoid the search being trapped in a local optimum, a random perturbation strategy based on a swap operation is performed on the non-inferior solutions. The validity of the proposed algorithm is tested by comparing with two other algorithms in the existing literature using a 25-task phone disassembly case. Finally, the proposed algorithm is applied to solve a refrigerator disassembly line problem based on the field investigation and a comparison of the proposed Pareto firefly algorithm with another multi-objective firefly algorithm in the existing literature is performed to further identify the superior performance of the proposed Pareto firefly algorithm, and eight Pareto optimal solutions are obtained for decision makers to make a decision.     

基于改进萤火虫算法的有限元模型修正

针对标准萤火虫算法后期收敛速度慢、收敛精度低、易陷入局部最优解的问题,提出了参数自适应策略的改进萤火虫算法,建立了基于改进萤火虫算法的有限元模型修正方法。通过隔代随机吸引度因子扩大了算法搜索路径,提升了算法遍历性,避免计算陷入局部最优;通过自适应步长因子使得算法寻优过程中能随迭代次数逐渐减少随机搜索范围,从而提高收敛速度。单、多峰测试函数计算结果表明,改进算法显著提高了收敛速率与收敛精度;简支梁数值算例与某刚构桥实桥有限元模型修正结果表明,简支梁参数最大误差由初始的66.7%降低至修正后的1.08%,刚构桥频率最大误差由14.47%降低至3.25%。所提方法具有良好的更新精度,适用于大型复杂结构的有限元模型修正。     

Gene expression feature selection for prostate cancer diagnosis using a two‐phase heuristic–deterministic search strategy

Here, a two‐phase search strategy is proposed to identify the biomarkers in gene expression data set for the prostate cancer diagnosis. A statistical filtering method is initially employed to remove the noisiest data. In the first phase of the search strategy, a multi‐objective optimisation based on the binary particle swarm optimisation algorithm tuned by a chaotic method is proposed to select the optimal subset of genes with the minimum number of genes and the maximum classification accuracy. Finally, in the second phase of the search strategy, the cache‐based modification of the sequential forward floating selection algorithm is used to find the most discriminant genes from the optimal subset of genes selected in the first phase. The results of applying the proposed algorithm on the available challenging prostate cancer data set demonstrate that the proposed algorithm can perfectly identify the informative genes such that the classification accuracy, sensitivity, and specificity of 100% are achieved with only nine biomarkers.Inspec keywords: cancer, biological organs, optimisation, feature extraction, search problems, particle swarm optimisation, pattern classification, geneticsOther keywords: biomarkers, gene expression feature selection, prostate cancer diagnosis, heuristic–deterministic search strategy, two‐phase search strategy, gene expression data, statistical filtering method, noisiest data, multiobjective optimisation, particle swarm optimisation algorithm, chaotic method, selection algorithm, discriminant genes, available challenging prostate cancer data, informative genes     

Impulse noise reduction using hybrid neuro-fuzzy filter with improved firefly algorithm from X-ray bio-images

Noise filtering performance in medical images is improved using a neuro-fuzy network developed with the combination of a post processor and two neuro-fuzzy (NF) filters. By the fact, the Sugeno-type is found to be less accurate during impulse noise reduction process. In this paper, we propose an improved firefly algorithm based hybrid neuro-fuzzy filter in both the NF filters to improve noise reduction performance. The proposed noise reduction system combines the advantages of the neural, fuzzy and firefly algorithms. In addition, an improved version of firefly algorithm called searching diversity based particle swarm firefly algorithm is used to reduce the local trapping problem as well as to determine the optimal shape of membership function in fuzzy system. Experimental results show that the proposed filter has proved its effectiveness on reducing the impulse noise in medical images against different impulse noise density levels.     

Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets

The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy.     

A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems

In this paper, a hybrid genetic-immune algorithm (HGIA) is proposed to reduce the premature convergence problem in a genetic algorithm (GA) in solving permutation flow-shop scheduling problems. A co-evolutionary strategy is proposed for efficient combination of GA and an artificial immune system (AIS). First, the GA is adopted to generate antigens with better fitness, and then the population in the last generation is transformed into antibodies in AIS. A new formula for calculating the lifespan of each antibody is employed during the evolution processes. In addition, a new mechanism including T-cell and B-cell generation procedures is applied to produce different types of antibodies which will be merged together. The antibodies with longer lifespan will survive and enter the next generation. This co-evolutionary strategy is very effective since chromosomes and antibodies will be transformed and evolved dynamically. The intensive experimental results show the effectiveness of the HGIA approach. The hybrid algorithm can be further extended to solve different combinatorial problems.     

Determination of particle size distribution by light extinction method using improved pattern search algorithm with Tikhonov smoothing functional

An inversion technique which combines the pattern search algorithm with the Tikhonov smoothing functional for retrieval of particle size distribution (PSD) by light extinction method is proposed. In the unparameterized shape-independent model, we first transform the PSD inversion problem into an optimization problem, with the Tikhonov smoothing functional employed to model the objective function. The optimization problem is then solved by the pattern search algorithm. To ensure good convergence rate and accuracy of the whole retrieval, a competitive strategy for determining the initial point of the pattern search algorithm is also designed. The accuracy and limitations of the proposed technique are tested by the inversion results of synthetic and real standard polystyrene particles immersed in water. In addition, the issues about the objective function and computation time are further discussed. Both simulation and experimental results show that the technique can be successfully applied to retrieve the PSD with high reliability and stability in the presence of random noise. Compared with the Phillips–Twomey method and genetic algorithm, the proposed technique has certain advantages in terms of reaching a more accurate and steady optimal solution with less computational effort, thus making this technique more suitable for quick and accurate measurement of PSD.     

A weight-based multiobjective immune algorithm: WBMOIA

A novel immune algorithm is suggested for finding Pareto-optimal solutions to multiobjective optimization problems based on opt-aiNET, the artificial immune system algorithm for multi-modal optimization. In the proposed algorithm, a randomly weighted sum of multiple objectives is used as a fitness function, and a local search algorithm is incorporated to facilitate the exploitation of the search space. Specifically, a new truncation algorithm with similar individuals (TASI) is proposed to preserve the diversity of the population. Also, a new selection operator is presented to create the new population based on TASI. Simulation results on seven standard problems (ZDT2, ZDT6, DEB, VNT, BNH, OSY and KIT) show that the proposed algorithm is able to find a much better spread of solutions and better convergence near the true Pareto-optimal front compared to the vector immune algorithm and the elitist non-dominated sorting genetic system.     

A hybrid Jaya algorithm for reliability–redundancy allocation problems

This article proposes an efficient improved hybrid Jaya algorithm based on time-varying acceleration coefficients (TVACs) and the learning phase introduced in teaching–learning-based optimization (TLBO), named the LJaya-TVAC algorithm, for solving various types of nonlinear mixed-integer reliability–redundancy allocation problems (RRAPs) and standard real-parameter test functions. RRAPs include series, series–parallel, complex (bridge) and overspeed protection systems. The search power of the proposed LJaya-TVAC algorithm for finding the optimal solutions is first tested on the standard real-parameter unimodal and multi-modal functions with dimensions of 30–100, and then tested on various types of nonlinear mixed-integer RRAPs. The results are compared with the original Jaya algorithm and the best results reported in the recent literature. The optimal results obtained with the proposed LJaya-TVAC algorithm provide evidence for its better and acceptable optimization performance compared to the original Jaya algorithm and other reported optimal results.     

Arterial cannula shape optimization by means of the rotational firefly algorithm

This article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm, is introduced. It is shown that the rotational firefly algorithm allows for better exploration of search spaces which results in faster convergence and better solutions in comparison with its standard version. This is particularly pronounced for smaller population sizes. Furthermore, it maintains greater diversity of populations for a longer time. A small population size and a low number of iterations are necessary to keep to a minimum the computational cost of the objective function of the problem, which comes from numerical solution of the nonlinear partial differential equations. Moreover, both versions of the firefly algorithm are compared to the state of the art, namely the differential evolution and covariance matrix adaptation evolution strategies.