基于子群混合与变异的微粒群算法及其应用

提出一种子群混合与变异的微粒群算法(SSMPSO),按适应值大小将微粒均匀分为两个子群分别进行目标优化,当子群在一定进化代数内未满足收敛条件时重新混合为一个种群.对混合种群中部分适应值差的微粒实施变异,用适应值好的微粒替代.微粒群反复进行分群进化、子群混合和种群变异操作,直至算法满足终止条件.SSMPSO算法通过几种典型高维非线性函数进行了测试,结果表明其性能明显优于基本微粒群算法.将SSMPSO算法用于常压塔汽油干点软测量,实验表明SSMPSO算法建立的汽油干点软测量模型比用基本微粒群算法所建软测量模型有了很大提高.     

A ε-indicator-based shuffled frog leaping algorithm for many-objective optimization problems

Many-objective optimization problems take challenges to multi-objective evolutionary algorithms. A number of non-dominated solutions in population cause a difficult selection towards the Pareto front. To tackle this issue, a series of indicatorbased multi-objective evolutionary algorithms(MOEAs) have been proposed to guide the evolution progress and shown promising performance. This paper proposes an indicator-based manyobjective evolutionary algorithm called ε-indicator-based shuffled frog leap...     

基于并行云变异蛙跳算法的梯级水库优化调度研究

本文针对混合蛙跳算法(shuffled frog leaping algorithm,SFLA)早熟收敛的问题,将云模型算法融合于SFLA算法中,形成一种云变异蛙跳算法(normal cloud mutation SFLA,NCM-SFLA),弥补混合蛙跳算法后期容易陷入局部最优的不足.同时利用算法易于并行的特点,在多核环境下基于.NET4的并行拓展库(parallel extensions)进行算法的并行优化.将其应用于梯级水库优化调度中,实例计算表明,与多维动态规划算法(MDP)相比,NCM-SFLA方法具有更好的全局寻优能力和较快的收敛速度,在现有的计算条件下该并行算法能有效缩短程序运行时间,求解梯级水库优化调度问题是合理、有效的.     

基于混合蛙跳算法的聚类问题研究

混合蛙跳算法(SFLA)是一种基于子群——种群进化模式的群智能优化算法,通过自身特有的分组算子实现不同解的合理分布,能够有效跳出局部最优;局部位置更新算子只对最差解进行更新,加快了算法的收敛速度。针对传统算法在解决聚类问题时存在聚类精度低和算法收敛速度较慢等缺点,本文提出了运用混合蛙跳算法来解决聚类问题,通过采用基于图像二维空间像素特征提取的方法构造青蛙个体解,设计青蛙进化的目标函数和青蛙位置更新策略,并通过数字,图形等验证了该算法解决聚类问题的有效性.     

Novel multi-objective optimization algorithm

Many multi-objective evolutionary algorithms （MOEAs） can converge to the Pareto optimal front and work well on two or three objectives, but they deteriorate when faced with manyobjective problems. Indicator-based MOEAs, which adopt various indicators to evaluate the fitness values （instead of the Paretodominance relation to select candidate solutions）, have been regarded as promising schemes that yield more satisfactory results than well-known algorithms, such as non-dominated sort- ing genetic algorithm （NSGA-II） and strength Pareto evolutionary algorithm （SPEA2）. However, they can suffer from having a slow convergence speed. This paper proposes a new indicatorbased multi-objective optimization algorithm, namely, the multi- objective shuffled frog leaping algorithm based on the ε indicator （ε-MOSFLA）. This algorithm adopts a memetic meta-heuristic, namely, the SFLA, which is characterized by the powerful capability of global search and quick convergence as an evolutionary strategy and a simple and effective E-indicator as a fitness assignment scheme to conduct the search procedure. Experimental results, in comparison with other representative indicator-based MOEAs and traditional Pareto-based MOEAs on several standard test problems with up to 50 objectives, show that ε-MOSFLA is the best algorithm for solving many-objective optimization problems in terms of the solution quality as well as the speed of convergence.     

基于模型迁移的磨矿过程混合蛙跳算法-小波神经网络软测量建模及重构

摘要：
以磨矿过程的关键工艺指标(磨矿粒度和磨机排矿速率)为预测对象,提出一种基于小波神经网络（WNN）的自适应软测量建模方法.通过对磨矿过程工艺的分析,选取了软测量模型的辅助变量,利用混合蛙跳算法(SFLA)对WNN软测量模型的结构参数(小波函数伸缩因子、平移因子和网络连接权重)进行优化,实现软测量模型输入输出变量之间的非线性映射;并采用模型迁移思想及输入输出修正规划方法实现软测量模型的重构,以解决输入矿石品位改变这一动态工况下的模型自适应校正问题.仿真结果表明,所提出的模型能够显著提高磨矿过程中经济技术指标预测的精度和鲁棒性,满足磨矿生产过程的实时控制要求.
关键词：
磨矿过程; 软测量; 小波神经网络; 混合蛙跳算法; 模型迁移
中图分类号： TK 232
文献标志码： A     

混合蛙跳算法的收敛性分析及其改进

在分析混合蛙跳算法（SFL）收敛性的基础上,针对早熟收敛和收敛速度慢的问题,提出一种改进算法（MSFL）.MSFL利用变公比数列分析更新轨迹的收敛性,并引入离散度和适应度方差作为指标,自适应地调节数列公比取值范围,以平衡收敛精度和收敛速度.以6个Benchmark函数分2组实验,测试MSFL的性能.结果表明：提出的MSFL算法具有较强的全局搜索和局部搜索能力,且具有收敛速度快、收敛精度高的优点.     

Membrane-inspired quantum shuffled frog leaping algorithm for spectrum allocation

To solve discrete optimization difficulty of the spectrum allocation problem,a membrane-inspired quantum shuffled frog leaping(MQSFL) algorithm is proposed.The proposed MQSFL algorithm applies the theory of membrane computing and quantum computing to the shuffled frog leaping algorithm,which is an effective discrete optimization algorithm.Then the proposed MQSFL algorithm is used to solve the spectrum allocation problem of cognitive radio systems.By hybridizing the quantum frog colony optimization and membrane computing,the quantum state and observation state of the quantum frogs can be well evolved within the membrane structure.The novel spectrum allocation algorithm can search the global optimal solution within a reasonable computation time.Simulation results for three utility functions of a cognitive radio system are provided to show that the MQSFL spectrum allocation method is superior to some previous spectrum allocation algorithms based on intelligence computing.     

基于免疫蛙跳算法的梯级水库群优化调度

针对混洗蛙跳算法存在的问题,结合克隆选择算法和混洗蛙跳算法各自优势,提出了一种免疫蛙跳算法(ISFLA),并将其应用于梯级水库群优化调度中. ISFLA将克隆选择算法嵌入到混洗蛙跳算法框架中,对整个群体循环进行分组进化与混合,在混合之后构造子群体执行克隆选择操作, 以提高算法的局部搜索能力.通过实际工程验证了该算法的可行性与高效性,从而为梯级水库群发电调度问题的求解提供了一种新的途径.     

改进SCEM-UA算法在概念性降雨-径流模型参数优选中的应用

在系统研究SCEM-UA算法基础上, 借鉴自适应Metropolis算法的思想, 对SCEM-UA算法中推荐分布的协方差策略和 接受率策略进行了改进, 改进后的算法能有效确保样本多样性的丰富和保持, 增强算法全局搜索能力, 避免'早熟收敛'. 以岷江流域降雨-径流模型参数优选研究为例, 分析了改进算法在推求参数后验分布的搜索性 能和效率, 计算结果表明, 改进SCEM-UA算法的参数推荐分布和接受率随着计算过程自动更新, 整体计算效率和 解的精度要明显优于传统的SCEM-UA算法.