共查询到20条相似文献,搜索用时 109 毫秒
1.
为了解决盲源分离方法收敛速度慢、分离性能不高的问题,提出一种基于膜计算(Membrane Computing,MC)和粒子群算法(Particle Swarm Optimization,PSO)的盲源分离方法。算法以分离信号负熵作为粒子群的适应值函数,将粒子均匀分布到各基本膜中,将各基本膜内最优位置输出到表层膜并选择适应值最小的最优位置作为群体最优位置,通过粒子自身最优位置和群体最优位置对种群粒子进行速度和位置的更新。粒子群最优解调整盲源分离的步长函数,进行信号的分离。提出的算法简化了惯性权重取值问题,保证了PSO算法局部搜索的精度,满足了全局搜索的多样性。仿真实验和实例应用表明,提出的算法可以很好地分离混合信号,并且能避免PSO算法的早熟收敛问题,具有更快的收敛速度和更优异的分离性能。 相似文献
2.
摘 要:本文针对以结构动力响应为约束,最小重量为目标的桁架拓扑优化问题,提出了一种将微粒群算法和优化准则法结合的混合PSO算法。利用优化准则法的迭代关系找出群体中适应度最好的微粒,将其作为特殊微粒,其他微粒的寻优采用PSO的基本进化规则,位移响应约束利用特殊微粒的灵敏度信息近似计算。算例的计算结果表明,混合PSO算法适用于受简谐荷载以及脉冲荷载作用桁架结构的拓扑优化。混合PSO的计算效率比PSO算法高,其优化效果比优化准则法好。 相似文献
3.
4.
5.
针对绿色可持续发展问题,通过量化绿色指标评价方法,构建最小化最大完工时间、碳排放和噪声的多目标混合流水车间调度模型,并提出一种混合离散多目标帝国竞争算法(hybrid discrete multi-objective imperial competition algorithm,HDMICA)对模型进行求解。采用基于混沌反向学习策略的种群初始化方式提高初始化种群的多样性;基于本文模型设计3种有效的局部搜索策略以提升算法局部搜索能力;通过实验验证所提算法的有效性及优越性。 相似文献
6.
7.
《振动与冲击》2017,(20)
考虑智能优化:蚁群算法(ACO)、遗传算法(GA)和粒子群算法(PSO)各自优缺点,并为充分发挥蚁群、遗传算法较好的全局搜索能力和粒子群算法的分级搜索机制,提出混合蚁群和粒子群优化(ACO+PSO)和混合遗传算法和粒子群优化(GA+PSO)最小二乘支持向量机(LSSVM)的非高斯脉动风速预测模型,分别称为ACO+PSO-LSSVM和GA+PSO-LSSVM。运用ACO+PSO-LSSVM和GA+PSO-LSSVM预测模型对某超高层建筑的非高斯脉动风速进行了预测;为比较目的,同时给出ACO-LSSVM、PSO-LSSVM和GA-LSSVM的非高斯脉动风速预测结果。经仔细检查非高斯脉动风速时程预测值、相关函数预测值以及预测性能评价指标,验证了基于混合智能优化LSSVM对非高斯脉动风速预测的有效性和优势。 相似文献
8.
9.
目的针对粒子群算法(PSO)整定大时滞PID控制器参数过程中搜索范围较大,搜索能力较差,甚至出现不收敛的问题,提出一种基于H_∞理论的小范围搜索且带有目标性初始化粒子群的改进PSO算法(HOI-PSO)。方法利用H_∞理论确定PSO算法的初始搜索范围,融合信息熵对初始化粒子群进行评估、调整,从而获得分散性较高的初始种群。结果 Matlab仿真实验表明,HOI-PSO算法能够提高PSO算法的收敛速度,具有同大范围相似甚至更好的全局寻优能力;对于大时滞过程控制,闭环系统的控制性能得到很大改善。结论 HOI-PSO算法应用于长网造纸机定量回路的控制结果表明,采用信息熵PSO算法整定出的PID控制器参数对大时滞过程具有良好的控制效果,在实际生产中也具有一定的理论指导意义。 相似文献
10.
11.
IC-PSO算法的收敛性分析及应用研究 总被引:2,自引:0,他引:2
针对标准PSO算法后期迭代搜索效率不高,容易陷入局部最优的问题,提出将免疫克隆(IC)原理引入PSO算法中,把抗体视为粒子,根据亲和度的高低进行粒子克隆选择、克隆抑制和高频变异,提高了种群的多样性和全局搜索的能力.并将其应用于40Gh/s的传输系统中进行了DOP优化补偿实验,算法补偿所需时间约为71 ms.通过对比补偿前后的信号眼图可以发现,PMD补偿后,信号眼图张开度有明显改善,证明了算法的有效性. 相似文献
12.
微粒群算法在自动控制系统设计中的应用 总被引:2,自引:0,他引:2
提出了将微粒群优化(Particle Swarm Optimization,PSO)算法与控制系统设计相结合的系统设计思路和方法。系统设计过程包括两个部分:首先基于历史输入输出数据,用微粒群算法建立系统的模型,然后基于得到的模型进行控制器的设计,并用微粒群算法进行控制器的参数优化整定。仿真试验结果表明,微粒群算法在控制系统设计的模型建立、控制器参数优化等方面发挥了重要的作用,简化了控制系统设计任务,提高了设计效率。 相似文献
13.
14.
In evolutionary algorithms, elites are crucial to maintain good features in solutions. However, too many elites can make the evolutionary process stagnate and cannot enhance the performance. This article employs particle swarm optimization (PSO) and biogeography-based optimization (BBO) to propose a hybrid algorithm termed biogeography-based particle swarm optimization (BPSO) which could make a large number of elites effective in searching optima. In this algorithm, the whole population is split into several subgroups; BBO is employed to search within each subgroup and PSO for the global search. Since not all the population is used in PSO, this structure overcomes the premature convergence in the original PSO. Time complexity analysis shows that the novel algorithm does not increase the time consumption. Fourteen numerical benchmarks and four engineering problems with constraints are used to test the BPSO. To better deal with constraints, a fuzzy strategy for the number of elites is investigated. The simulation results validate the feasibility and effectiveness of the proposed algorithm. 相似文献
15.
16.
The development of hybrid algorithms is becoming an important topic in the global optimization research area. This article proposes a new technique in hybridizing the particle swarm optimization (PSO) algorithm and the Nelder–Mead (NM) simplex search algorithm to solve general nonlinear unconstrained optimization problems. Unlike traditional hybrid methods, the proposed method hybridizes the NM algorithm inside the PSO to improve the velocities and positions of the particles iteratively. The new hybridization considers the PSO algorithm and NM algorithm as one heuristic, not in a sequential or hierarchical manner. The NM algorithm is applied to improve the initial random solution of the PSO algorithm and iteratively in every step to improve the overall performance of the method. The performance of the proposed method was tested over 20 optimization test functions with varying dimensions. Comprehensive comparisons with other methods in the literature indicate that the proposed solution method is promising and competitive. 相似文献
17.
This work develops an augmented particle swarm optimization (AugPSO) algorithm using two new strategies,: boundary-shifting and particle-position-resetting. The purpose of the algorithm is to optimize the design of truss structures. Inspired by a heuristic, the boundary-shifting approach forces particles to move to the boundary between feasible and infeasible regions in order to increase the convergence rate in searching. The purpose of the particle-position-resetting approach, motivated by mutation scheme in genetic algorithms (GAs), is to increase the diversity of particles and to prevent the solution of particles from falling into local minima. The performance of the AugPSO algorithm was tested on four benchmark truss design problems involving 10, 25, 72 and 120 bars. The convergence rates and final solutions achieved were compared among the simple PSO, the PSO with passive congregation (PSOPC) and the AugPSO algorithms. The numerical results indicate that the new AugPSO algorithm outperforms the simple PSO and PSOPC algorithms. The AugPSO achieved a new and superior optimal solution to the 120-bar truss design problem. Numerical analyses showed that the AugPSO algorithm is more robust than the PSO and PSOPC algorithms. 相似文献
18.
19.
M. Senthil Arumugam Aarthi Chandramohan Gajula Ramana Murthy 《Optimization and Engineering》2011,12(3):371-392
7 This paper elucidates the computation of optimal controls for steel annealing processes as hybrid systems which comprise
of one or more furnaces integrated with plant-wide planning and scheduling operations. A class of hybrid system is considered
to capture the trade-off between metallurgical quality requirement and timely product delivery. Various optimization algorithms
including particle swarm optimization algorithm (PSO) with time varying inertia weight methods, PSO with globally and locally
tuned parameters (GLBest PSO), parameter free PSO (pf-PSO) and PSO like algorithm via extrapolation (ePSO), real coded genetic
algorithm (RCGA) and two-phase hybrid real coded genetic algorithm (HRCGA) are considered to solve the optimal control problems
for the steel annealing processes (SAP). The optimal solutions including optimal line speed, optimal cost, and job completion
time and convergence rate obtained through all these optimization algorithms are compared with each other and also those obtained
via the existing method, forward algorithm (FA). Various statistical analyses and analysis of variance (ANOVA) test and hypothesis
t-test are carried out in order to compare the performance of each method in solving the optimal control problems of SAP.
The comparative study of the performance of the various algorithms indicates that the PSO like algorithms, pf-PSO and ePSO
are equally good and are also better than all the other optimization methods considered in this chapter. 相似文献