共查询到19条相似文献,搜索用时 171 毫秒
1.
2.
针对微粒群优化算法在解决复杂优化问题时易于出现早熟收敛现象,提出了一种多阶段多模型的改进微粒群优化算法。考虑寻优不同阶段的开发与探测能力需求的差异,算法将寻优过程分成3个阶段,各阶段采用不同的模型进行进化。第一阶段利用标准微粒群优化算法发现局部极值的邻域;第二阶段利用Cognition Only模型快速找到局部极值点,提高寻优效率;第三阶段,提出了一种改进的进化模型,利于粒子快速跳出局部极值点,寻找到全局最优点。4种复杂测试函数的实验结果表明:该算法比标准微粒群优化算法(PSO)和基于不同进化模型的两群优化算法(TSE-PSO)更容易找到全局最优解,相比两群微粒群优化算法,还能在一定程度上提高优化效率。 相似文献
3.
为进一步提高多粒子群协同进化算法的寻优精度, 并有效改善粒子群易陷入局部极值及收敛速度慢的问题, 结合遗传算法较强的全局搜索能力和极值优化算法的局部搜索能力, 提出了一种改进的多粒子群协同进化算法. 对粒子群优化算法提出改进策略, 并在种群进化过程中, 利用遗传算法增加粒子的多样性及优良性, 经过一定次数的迭代, 利用极值优化算法加快收敛速度. 实验结果表明该算法具有较好的性能, 能够摆脱陷入局部极值点的问题, 并具有较快的收敛速度. 相似文献
4.
5.
粒子群算法(PSO)的拓扑结构是影响算法性能的关键因素,为了从根源上避免粒子群算法易陷入局部极值及早熟收敛等问题,提出一种混合拓扑结构的粒子群优化算法(MPSO)并将其应用于软件结构测试数据的自动生成中。通过不同邻域拓扑结构对算法性能影响的分析,采用一种全局寻优和局部寻优相结合的混合粒子群优化算法。通过观察粒子群的多样性反馈信息,对每一代种群粒子以进化时选择全局拓扑结构模型(GPSO)或局部拓扑结构模型(LPSO)的方法进行。实验结果表明,MPSO使得种群的多样性得到保证,避免了粒子群陷入局部极值,提高了算法的收敛速度。 相似文献
6.
一种更简化而高效的粒子群优化算法 总被引:66,自引:0,他引:66
针对基本粒子群优化(basic particle swarm optimization,简称bPSO)算法容易陷入局部极值、进化后期的收敛速度慢和精度低等缺点,采用简化粒子群优化方程和添加极值扰动算子两种策略加以改进,提出了简化粒子群优化(simple particle swarm optimization,简称sPSO)算法、带极值扰动粒子群优化(extremum disturbed particle swarm optimization,简称tPSO)算法和基于二者的带极值扰动的简化粒子群优化(ext 相似文献
7.
8.
针对标准粒子群优化算法(SPSO)易陷入局部最优,进化后期收敛速度慢的缺点,提出一种基于滑动平均极值的粒子群优化算法(MWAPSO).改进了标准粒子群算法中的速度更新方程,使得粒子在进化过程中追随个体极值、全局极值和滑动平均极值.将该算法应用于4个典型的测试函数,实验结果表明,与标准粒子群算法相比,该算法在运行初期具有更强的探索能力,能够有效地避免粒子群体陷入早熟收敛.有更好的收敛性和更快的收敛速度. 相似文献
9.
研究以最小化完工时间为目标的模糊加工时间零等待多产品厂间歇调度问题, 提出一种基于差分进化粒子群优化(DEPSO) 的间歇调度算法. 以基本粒子群算法为整体进化框架, 采用基于反向学习的方法初始化种群, 引入群体极值保持代数作为阈值, 利用基于排序的差分进化算法优化粒子个体极值位置, 改变粒子的搜索范围, 防止粒子陷入局部极值. 仿真实验验证了所提算法在解决模糊加工时间零等待多产品厂间歇调度问题上的有效性和优越性.
相似文献10.
粒子群算法是一种仿生进化算法,源于对鸟群觅食行为的模拟,由于其计算简单、快速,被广泛应用。但是,基本粒子群算法在求解的过程中存在着全局搜索能力和局部求精能力两个性能指标之间的矛盾,算法容易陷入局部极值,进化后期的收敛速度慢。针对上述问题,提出了基于混沌变异算子的粒子群算法,可以使粒子摆脱局部极值,继续优化,加快收敛速度。将基于混沌变异的粒子群算法与模糊算法相结合,用于控制倒立摆系统的平衡。仿真实验表明,混沌变异粒子群算法优化了倒立摆系统模糊控制器的设计,改善了控制效果。 相似文献
11.
基于混沌和差分进化的混合粒子群优化算法 总被引:1,自引:0,他引:1
研究粒子群算法优化问题,由于标准粒子群优化算法(PSO)在高维复杂函数优化中易早收敛,影响全系统优化。为改进的混合粒子群优化算法,提出了一种基于混沌和差分进化的混合粒子群优化算法(CDEHPSO)。把基于Logistic映射的混沌序列引入到种群初始化操作中。在算法进化过程中,通过一种粒子早熟判断机制,在基本粒子群优化算法中引入了差分变异、交叉和选择操作,对早熟粒子个体进行差分进化操作,从而维持了种群的多样性并有效避免了算法陷入局部最优。仿真结果表明,相比于粒子群优化算法和差分进化算法(DE),CDEHPSO算法具有收敛速度快、搜索能力强的优点。 相似文献
12.
DongLi Jia GuoXin Zheng BoYang Qu Muhammad Khurram Khan 《Computers & Industrial Engineering》2011,61(4):1117-1122
In recent years, particle swarm optimization (PSO) emerges as a new optimization scheme that has attracted substantial research interest due to its simplicity and efficiency. However, when applied to high-dimensional problems, PSO suffers from premature convergence problem which results in a low optimization precision or even failure. To remedy this fault, this paper proposes a novel memetic PSO (CGPSO) algorithm which combines the canonical PSO with a Chaotic and Gaussian local search procedure. In the initial evolution phase, CGPSO explores a wide search space that helps avoid premature convergence through Chaotic local search. Then in the following run phase, CGPSO refines the solutions through Gaussian optimization. To evaluate the effectiveness and efficiency of the CGPSO algorithm, thirteen high dimensional non-linear scalable benchmark functions were examined. Results show that, compared to the standard PSO, CGPSO is more effective, faster to converge, and less sensitive to the function dimensions. The CGPSO was also compared with two PSO variants, CPSO-H, DMS-L-PSO, and two memetic optimizers, DEachSPX and MA-S2. CGPSO is able to generate a better, or at least comparable, performance in terms of optimization accuracy. So it can be safely concluded that the proposed CGPSO is an efficient optimization scheme for solving high-dimensional problems. 相似文献
13.
一种高效粒子群优化算法 总被引:4,自引:1,他引:3
针对标准粒子群算法收敛速度慢和易出现早熟收敛等问题,提出一种高效粒子群优化算法.首先利用局部搜索算法的局部快速收敛性,对整个粒子群目前找到的最优位置进行局部搜索;然后,为了跳出局部最优,保持粒子的多样性,给出一个学习算子.该算法能增强算法的全局探索和局部开发能力.通过对10个标准测试函数的仿真实验并与其他算法相比较,结果表明了所提出的算法具有较快的收敛速度和很强的跳出局部最优的能力,优化性能得到显著提高. 相似文献
14.
15.
Dongping Tian 《Intelligent Automation and Soft Computing》2018,24(2):331-342
Particle swarm optimization (PSO) is a population based swarm intelligence algorithm that has been
deeply studied and widely applied to a variety of problems. However, it is easily trapped into the
local optima and premature convergence appears when solving complex multimodal problems. To
address these issues, we present a new particle swarm optimization by introducing chaotic maps (Tent
and Logistic) and Gaussian mutation mechanism as well as a local re-initialization strategy into the
standard PSO algorithm. On one hand, the chaotic map is utilized to generate uniformly distributed
particles to improve the quality of the initial population. On the other hand, Gaussian mutation as
well as the local re-initialization strategy based on the maximal focus distance is exploited to help
the algorithm escape from the local optima and make the particles proceed with searching in other
regions of the solution space. In addition, an auxiliary velocity-position update strategy is exclusively
used for the global best particle, which can effectively guarantee the convergence of the proposed
particle swarm optimization. Extensive experiments on eight well-known benchmark functions with
different dimensions demonstrate that the proposed PSO is superior or highly competitive to several
state-of-the-art PSO variants in dealing with complex multimodal problems. 相似文献
16.
融合可行基规则的粒子群优化算法及其应用 总被引:1,自引:1,他引:0
基本粒子群优化算法对于离散的优化问题处理不佳,容易陷入局部最优。针对基本粒子群优化算法处理离散型优化问题时的缺陷,提出了一种融合可行基规则的改进型粒子群优化算法,并用该算法求解车辆路径问题。实验结果表明,该算法的优化性能和求解精度均优于其他文献算法,在求解车辆路径问题中具有较高的应用价值。 相似文献
17.
18.
求解工程约束优化问题的PSO-ABC混合算法* 总被引:1,自引:1,他引:0
针对包含约束条件的工程优化问题,提出了基于人工蜂群的粒子群优化PSO-ABC算法。将PSO中较优的粒子作为ABC算法的蜜源,并使用禁忌表存储其局部极值,克服粒子群优化算法易陷入局部最优的缺陷。采用可行性规则进行约束处理,将粒子种群分为可行子群和不可行子群,并在ABC算法产生蜜源的过程中保留部分较优的可行解和不可行解的信息,弥补了可行性规则处理最优点位于约束边界附近的问题时存在的不足。四个典型工程优化设计的实验结果表明,该算法能够寻得更优的约束最优化解,且稳健性更强。 相似文献
19.
In recent years, particle swarm optimization (PSO) has extensively applied in various optimization problems because of its simple structure. Although the PSO may find local optima or exhibit slow convergence speed when solving complex multimodal problems. Also, the algorithm requires setting several parameters, and tuning the parameters is a challenging for some optimization problems. To address these issues, an improved PSO scheme is proposed in this study. The algorithm, called non-parametric particle swarm optimization (NP-PSO) enhances the global exploration and the local exploitation in PSO without tuning any algorithmic parameter. NP-PSO combines local and global topologies with two quadratic interpolation operations to increase the search ability. Nineteen (19) unimodal and multimodal nonlinear benchmark functions are selected to compare the performance of NP-PSO with several well-known PSO algorithms. The experimental results showed that the proposed method considerably enhances the efficiency of PSO algorithm in terms of solution accuracy, convergence speed, global optimality, and algorithm reliability. 相似文献