Particle swarm optimization technique for multilevel inverters in solar harvesting micro grid system

In on grid solar generation system the irradiance causes voltage mismatch as a result of this the nonlinearities increase in the output voltage of the multilevel inverter. The sunlight is not uniform at all places, variation in irradiance is inevitable when it comes to solar power. The Solar power is not similarly circulated there is a change in sun orientation with respect to geometrical positions. The un symmetrical voltage results in unbalancing and introduces more harmonics. The article proposed here analyses a topology where a DC-DC converter is utilized ahead of the multilevel inverter so as to overcome the voltage varieties, thereby reducing the harmonics in the system. Particle swarm optimization is carried out in minimizing the Harmonics. Different observation and studies working stages their simulations and results for both are studied and recorded. Since solar energy is an essential, a complete analysis of this is done. A variety of initial calculations in designing the converter are also carried out. Similar calculations are also carried out informing the solar panel and harvesting the energy. By facilitating MATLAB simulation of particle swarm optimization for firing angles employed in multilevel inverter along with the converter. The measure of total harmonic distortion THD obtained is taken as a measure of evaluation for the performance of this combined system.     

Cultural algorithm-based quantum-behaved particle swarm optimization

A hybrid quantum-behaved particle swarm optimization (QPSO) based on cultural algorithm (CA), which we call cultural QPSO, is proposed. Although QPSO is a promising algorithm for many optimization problems, it is apt to lose the diversity of the swarm in the later period of the search and prematurely converges to the local optimum. Inspired by the structure of human society, this paper uses the CA model to diversify the QPSO population and improve the QPSO's performance. In this model, the swarm is divided into two sub-swarms: the common particle and the elite particle sub-swarm. If a particle comes from a common sub-swarm, it will evolve according to the QPSO method, and during the evolvement, it will be affected not only by the other common particles but also by the elites. For the elites, the differential evolution (DE) method is adopted for evolvement. After each generation, the elites will be re-elected from the whole swarm according to fitness values. The simulation results on benchmark functions demonstrate that cultural QPSO outperforms the original QPSO for many problems.     

改进的樽海鞘群算法

针对樽海鞘群算法在对函数优化问题求解上出现的求解精度不高、收敛速度慢的缺点,提出了一种改进的群海鞘群算法.对于领导者引入加权重心取代最优个体位置,防止过早聚集在最优个体附近;对于追随者引入自适应惯性权重平衡算法的全局搜索和局部寻优能力;最后对于个体进行逐维随机差分变异,减少维间干扰,提高了种群的多样性.仿真实验结果表明改进的樽海鞘群算法在均值、标准差和收敛曲线优于标准樽海鞘群算法和其他改进算法,说明改进后的算法提高了寻优性能,有较高的求解精度和较快的收敛速度.     

A novel chaotic salp swarm algorithm for global optimization and feature selection

Salp Swarm Algorithm (SSA) is one of the most recently proposed algorithms driven by the simulation behavior of salps. However, similar to most of the meta-heuristic algorithms, it suffered from stagnation in local optima and low convergence rate. Recently, chaos theory has been successfully applied to solve these problems. In this paper, a novel hybrid solution based on SSA and chaos theory is proposed. The proposed Chaotic Salp Swarm Algorithm (CSSA) is applied on 14 unimodal and multimodal benchmark optimization problems and 20 benchmark datasets. Ten different chaotic maps are employed to enhance the convergence rate and resulting precision. Simulation results showed that the proposed CSSA is a promising algorithm. Also, the results reveal the capability of CSSA in finding an optimal feature subset, which maximizes the classification accuracy, while minimizing the number of selected features. Moreover, the results showed that logistic chaotic map is the optimal map of the used ten, which can significantly boost the performance of original SSA.     

Rank-driven salp swarm algorithm with orthogonal opposition-based learning for global optimization

Applied Intelligence - Salp swarm algorithm (SSA) is a relatively new and straightforward swarm-based meta-heuristic optimization algorithm, which is inspired by the flocking behavior of salps when...     

基于遗传粒子群算法的高维复杂函数优化方法

针对高维复杂函数优化的特点,提出了一种遗传算法与粒子群算法相结合的主-从结构算法。算法中,主级为全局搜索的遗传算法;从级为局部邻域搜索的粒子群算法。通过主-从协调机制和从级转换函数设计,使算法不依赖复杂的编码方式和进化算子进行全局精确搜索。通过仿真和比较实验,验证了算法对高维复杂函数优化的有效性。     

A new fusion of salp swarm with sine cosine for optimization of non-linear functions

Engineering with Computers - The foremost objective of this article is to develop a novel hybrid powerful meta-heuristic that integrates the salp swarm algorithm with sine cosine algorithm (called...     

Short-term scheduling of cascade reservoirs using an immune algorithm-based particle swarm optimization

This paper presents a new approach for short-term hydropower scheduling of reservoirs using an immune algorithm-based particle swarm optimization (IA-PSO). IA-PSO is employed by coupling the immune information processing mechanism with the particle swarm optimization algorithm in order to achieve a better global solution with less computational effort. With the IA-PSO technique, the hydro-electrical optimization model of reservoirs is formulated as a high-dimensional, dynamic, nonlinear and stochastic global optimization problem of a multi-reservoir hydropower system. The purpose of the proposed methodology is to maximize total hydropower production. Here it is applied to a reservoir system on the Qingjiang River, in the Yangtze watershed, that consists of two reservoirs. The results are compared with the results obtained through conventional operation method, the dynamic programming and the standard PSO algorithm. From the comparative results, it is found that the IA-PSO approach provides the most globally optimum solution at a faster convergence speed.     

Harmonized salp chain-built optimization

As an optimization paradigm, Salp Swarm Algorithm (SSA) outperforms various population-based optimizers in the perspective of the accuracy of obtained solutions and convergence rate. However, SSA gets stuck into sub-optimal solutions and degrades accuracy while solving the complex optimization problems. To relieve these shortcomings, a modified version of the SSA is proposed in the present work, which tries to establish a more stable equilibrium between the exploration and exploitation cores. This method utilizes two different strategies called opposition-based learning and levy-flight (LVF) search. The algorithm is named m-SSA, and its validation is performed on a well-known set of 23 classical benchmark problems. To observe the strength of the proposed method on the scalability of the test problems, the dimension of these problems is varied from 50 to 1000. Furthermore, the proposed m-SSA is also used to solve some real engineering optimization problems. The analysis of results through various statistical measures, convergence rate, and statistical analysis ensures the effectiveness of the proposed strategies integrated with the m-SSA. The comparison of the m-SSA with the conventional SSA, variants of SSA and some other state-of-the-art algorithms illustrate its enhanced search efficiency.

     

微粒群神经网络在绩效评价系统中的应用

绩效评价系统是人力资源系统3P模型中的重要一环,是定期考察和评价个人或小组工作业绩的一种正式制度。利用微粒群算法对神经网络进行训练,再将此网络模型应用到人力资源管理系统中的绩效评价系统。最后通过在各级评价标准内按随机均匀分布方式生成的训练样本和测试样本来检测该微粒群神经网络。结果表明微粒群神经网络具有较强的泛化能力,应用在绩效评价系统中具有很高的评价准确率。     

一种新型的樽海鞘群算法及其应用

为了解决樽海鞘群算法SSA在寻优过程中存在收敛速度慢、计算精度差等问题,提出一种新型的樽海鞘群算法NSSA。首先分析SSA中樽海鞘在追随领导者过程中的不足,然后借鉴灰狼优化算法中追随头狼的思想来改进樽海鞘追随领导者的方式。在23个基准函数上对NSSA与其他算法进行性能比较,并把该算法应用于图像匹配之中。所有实验结果表明,NSSA具有更好的收敛速度、计算精度和鲁棒性。     

面向全局搜索的自适应领导者樽海鞘群算法

为了进一步改善基本樽海鞘群算法容易陷入局部最优、寻优精度有时不高、求解结果不太稳定的不足,提出一种面向全局搜索的自适应领导者樽海鞘群算法.首先,在领导者位置更新公式中引入上一代樽海鞘群位置,增强全局搜索的充分性,有效避免算法陷入局部极值;然后,在领导者位置更新公式中加入惯性权重,并在全局和局部搜索的选择上引入领导者-跟...     

基于樽海鞘算法优化的帕金森病早期诊断模型研究与并行优化

帕金森病是一种常见的神经性慢性疾病,由于其病因尚不明确,导致早期诊断精度低的问题,提出一种改进的优化核极限学习机方法用于帕金森病的早期诊断.研究利用混沌理论和高斯变异方法改进樽海鞘算法(salp swarm algorithm,SSA),提出一种基于进化机制的智能诊断模型ISSA-KELM.改进的SSA算法同步实现特征选择和KELM核函数的参数优化,有效地解决了模型的参数设定和最优特征选择问题,并基于OpenMP平台多线程调度处理模型,在保证模型分类精度最大化的同时进一步提高计算效率.实验结果表明,提出模型在分类精度上高于已有方法,计算效率也得到极大提高,具有较好的综合性能,验证了本模型有着很好的应用前景,有助于辅助临床医生在诊断中作出更准确的决策.     

基于蚁群粒子群算法求解多目标柔性调度问题

通过分析多目标柔性作业车间调度问题中各目标的相互关系,提出一种主、从递阶结构的蚁群粒子群求解算法。算法中,主级为蚁群算法,在选择工件加工路径过程中实现设备总负荷和关键设备负荷最小化的目标;从级为粒子群算法,在主级工艺路径约束下的设备排产中实现工件流通时间最小化的目标。然后,以设备负荷和工序加工时间为启发式信息设计蚂蚁在工序可用设备间转移概率;基于粒子向量优先权值的大小关系设计解码方法实现设备上的工序排产。最后,通过仿真和比较实验,验证了该算法的有效性。     

蚁群-粒子群算法求解多模式资源受限项目调度问题

通过分析多模式项目调度问题的特点,提出一种主、从递阶结构的蚁群粒子群求解算法。算法中,主级为蚁群算法,完成任务模式选择;从级为粒子群算法,完成主级约束下的任务调度。然后,以工期最小和资源均衡分配为目标设计蚂蚁转移概率、模式优选概率和任务优选概率。最后,针对PSPLIB中的测试集对算法主要参数进行优化,并通过与其他算法比较验证了算法的有效性。     

基于混合策略改进的樽海鞘群算法

针对樽海鞘群算法(SSA)在求解复杂优化问题时存在的易陷入局部最优、收敛精度低等缺点,提出一种基于混合策略改进的樽海鞘群算法(ISSA).首先,采用Sobol序列实现樽海鞘种群的初始化,使初始种群在解空间中分布更加均匀,进而提高算法的全局寻优能力;其次,在领导者位置更新阶段引入步长控制因子,根据不同寻优时期自动调节领导者的搜索范围,有效平衡算法的全局搜索与局部搜索;然后,采用改进的透镜成像策略对领导者进行映射,避免算法陷入局部最优;此外,在追随者位置更新阶段,引入一种自主选择追随机制,改善追随者的盲从性,以提高算法的收敛精度;最后,与其他几种代表性优化算法在12个基准测试函数上进行仿真实验对比,并进行Wilcoxon秩和检验,实验结果表明所提出ISSA在收敛速度和精度上有明显提升,相较于其他优化算法具有更好的寻优效果和稳定性.另外,通过两个工程设计案例实验进行测试,进一步验证了所提出ISSA的可行性和适用性.     

混沌映射与动态学习的自适应樽海鞘群算法

针对传统樽海鞘群算法寻优精度低、易于陷入局部最优的问题,提出基于混沌映射与动态学习的自适应樽海鞘群算法.引入改进混沌Tent映射实现种群初始化,确保更加均匀的搜索空间;设计基于Logistic映射的领导者更新机制,有效增强种群多样性;利用基于动态学习的追随者更新机制,使算法跳出局部最优,提升全局搜索能力;设计领导者/追...     

Design and analysis of text document clustering using salp swarm algorithm

The Journal of Supercomputing - In the technological era, exponential increase of unorganized text documents offers increased difficulties retrieving the most relevant data. The document clustering...     

基于衰减因子和动态学习的改进樽海鞘群算法

樽海鞘群算法是一种新型的群智能优化算法.与其他智能优化算法相比,樽海鞘群算法的优化求解策略仍有待改进,以进一步提高该算法的求解精度和寻优效率.本文提出一种基于衰减因子和动态学习的改进樽海鞘群算法,通过在领导者更新阶段添加衰减因子,提高算法的局部开发能力,在跟随者更新阶段引入动态学习策略,提高算法的全局搜索能力.本文对16个测试函数进行实验,将提出的改进算法与其他智能优化算法比较,实验结果表明,本文提出的改进算法在收敛精度和收敛速度方面有较大提升,具有良好的优化性能.