共查询到20条相似文献，搜索用时 250 毫秒
1.
针对传统粒子群算法在求解梯级水库调度问题时,容易陷入局部最优而早熟收敛的问题,提出自适应粒子群算法。该改进算法结合种群进化程度自适应调整算法控制参数,从而克服传统粒子群算法参数固定引起的搜索能力不足的问题。同时,采用种群局部重建策略解决种群进化后期多样性下降的问题。将改进的粒子群算法应用于清江梯级水电站的发电调度求解,模拟计算结果表明,文章提出的改进算法具有较强的全局寻优能力,可以进一步提高算法的搜索性能和求解精度。 相似文献
2.
针对传统的细菌觅食算法限于梯度信息优化,对非线性特征数据挖掘效果不好的缺陷,提出一种基于趋化繁殖算法的细菌觅食种群寻优方法,并有效应用海量非线性特征数据挖掘中。首先根据现有细菌觅食算法,引入细菌趋化算子和细菌繁殖算子,设计一种新的个体编码方式及进化模式。然后通过设计种群的自适应调整因子增强个体活力,并融合禁忌搜索算法,提高种群搜索寻优能力,克服算法易于陷入过早收敛和限于梯度信息优化的不足,提高对非线性特征数据挖掘性能。仿真实验表明,新算法可以搜索到种群最优组合,非线性特征数据挖掘跟踪曲线表明,算法具有较好的预测和数据挖掘能力,特征数据挖掘准确率提高显著,收敛速度高。 相似文献
3.
4.
5.
本文主要研究对象是变风量空调机组中的送风管道静压控制回路,将具有良好全局寻优能力的细菌觅食算法应用到该控制回路中,同时为了改善细菌觅食算法收敛速度较慢的缺点,将粒子群算法引入到细菌觅食算法中,对细菌觅食算法中的细菌位置更新进行优化,并利用优化后的细菌觅食算法对PID控制器的三个参数进行整定,将整定后的参数应用到控制回路中。通过matlab仿真,并将细菌觅食算法、粒子群算法,粒子群优化的细菌觅食算法进行比较,结果表明经过粒子群优化的细菌觅食算法收敛速度明显加快。 相似文献
6.
针对单变量边缘分布算法（UMDA）求解复杂优化问题时的局限性,本文将均匀变异机制引入分布估计算法（EDAs）领域,提出了一种基于均匀变异的单变量边缘分布算法。该算法利用均匀变异操作保持种群的多样性,提高混合算法的全局搜索能力。通过对算法的分析和仿真实验表明与单变量边缘分布算法（UMDA）相比,改进后的保持种群多样性的单变量边缘分布算法具有更高的优化性能。 相似文献
7.
8.
9.
针对旅行商(traveling salesman problem,TSP)是一个NP问题,本文使用改进的人工鱼群算法(improved artificial fish swarm algorithm,AFSA)进行线路的优化.首先阐述了TSP问题基本概念,其次针对基本的人工鱼群算法分别优化:(1)使用Laplace进行种群初始化,提高种群多样性;(2)使用正弦余弦算法取代觅食行为,保证算法在全局和局部范围内具有一定的平衡性;(3)利用人工蜂群算法对每一次迭代后的个体进行筛选,保证了算法的解的质量.仿真实验中本文算法在TSP路径规划方面具有一定的效果. 相似文献
10.
11.
12.
We consider the problem of placing copies of objects in a distributed web server system to minimize the cost of serving read and write requests when the web servers have limited storage capacities. We formulate the problem as a 0–1 optimization problem and present a hybrid particle swarm optimization algorithm to solve it. The proposed hybrid algorithm makes use of the strong global search ability of particle swarm optimization (PSO) and the strong local search ability of tabu search to obtain high quality solutions. The effectiveness of the proposed algorithm is demonstrated by comparing it with the genetic algorithm (GA), simple PSO, tabu search, and random placement algorithm on a variety of test cases. The simulation results indicate that the proposed hybrid approach outperforms the GA, simple PSO, and tabu search. 相似文献
13.
给出一种结合梯度法和正交遗传算法的混合算法。实验表明,它通过对问题的解空间交替进行全局和局部搜索,能更有效地求解函数优化问题。 相似文献
14.
传统遗传算法在面对一些搜索空间巨大的复杂问题时,其表现往往难以令人满意。作者针对传统遗传算法解决高维多峰值问题时可能会出现的困难进行了分析,然后根据困难出现的原因,基于PVM设计了并行分布式遗传算法,并对适应度评估、交叉、变异算子做了一些改进,旨在加强算法的全局搜索能力,提高算法的收敛速度。为了验证算法多项措施的有效性,对一多峰函数在高维条件下进行多方面的测试,实验结果表明这几项措施是有效的。 相似文献
15.
16.
17.
In recent years, evolutionary and meta-heuristic algorithms have been extensively used as search and optimization tools in various problem domains, including science, commerce, and engineering. Ease of use, broad applicability, and global perspective may be considered as the primary reason for their success. The honey-bee mating process has been considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of real honey-bee mating. In this paper, the honey-bee mating optimization (HBMO) algorithm is presented and tested with a nonlinear, continuous constrained problem with continuous decision and state variables to demonstrate the efficiency of the algorithm in handling the single reservoir operation optimization problems. It is shown that the performance of the model is quite comparable with the results of the well-developed traditional linear programming (LP) solvers such as LINGO 8.0. Results obtained are quite promising and compare well with the final results of the other approach. 相似文献
18.
对标准PSO算法进行分析的基础上,针对PSO算法中的早熟收敛问题,提出了一种基于混沌序列的PSO算法（CPSO）。CPSO算法能够保证粒子种群的多样性,使粒子能够有效进行全局搜索;并以典型的基准优化问题进行了仿真实验,验证了CPSO的有效性。 相似文献
19.
A new design method based on artificial bee colony algorithm for digital IIR filters 总被引：11，自引：0，他引：11
Nurhan Karaboga Author Vitae 《Journal of The Franklin Institute》2009,346(4):328-348
Digital filters can be broadly classified into two groups: recursive (infinite impulse response (IIR)) and non-recursive (finite impulse response (FIR)). An IIR filter can provide a much better performance than the FIR filter having the same number of coefficients. However, IIR filters might have a multi-modal error surface. Therefore, a reliable design method proposed for IIR filters must be based on a global search procedure. Artificial bee colony (ABC) algorithm has been recently introduced for global optimization. The ABC algorithm simulating the intelligent foraging behaviour of honey bee swarm is a simple, robust, and very flexible algorithm. In this work, a new method based on ABC algorithm for designing digital IIR filters is described and its performance is compared with that of a conventional optimization algorithm (LSQ-nonlin) and particle swarm optimization (PSO) algorithm. 相似文献
20.
基于混沌搜索的LS-SVM预测算法 总被引：1，自引：0，他引：1
为利用最小二乘支持向量机(LS-SVM)来进行预测,首先要确定影响LS-SVM模型的两个主要参数γ和σ,针对该问题提出了采用混沌搜索算法来搜索该模型的最优参数组合。混沌搜索的运动轨迹具有遍历性,随机性,可以进行全局和局部寻优,利用该算法搜索最优参数来确定预测模型,然后将该预测模型用于预测实践。实验结果表明,该模型具有较精确的预测精度和适用性。 相似文献