共查询到19条相似文献,搜索用时 140 毫秒
1.
2.
3.
4.
5.
6.
随机扩散算法求解二次背包问题 总被引:1,自引:0,他引:1
针对二次背包问题,提出一种新的基于群体智能的随机扩散算法.算法采用一对一的通信机制;利用部分函数估计评价候选解;利用量子机制构造个体;采用1-OPT异或操作提高搜索性能.通过数值实验并与微粒群算法、蚁群算法作比较,结果表明算法具有较好的优化性能. 相似文献
7.
基于博弈策略强化学习的函数优化算法 总被引:2,自引:0,他引:2
该文提出了一种基于博弈论的函数优化算法。算法将优化问题的搜索空间映射为博弈的策略组合空间,优化目标函数映射为博弈的效用函数,通过博弈策略的强化学习过程智能地求解函数优化问题。文章给出了算法的形式定义及描述,然后在一组标准的函数优化测试集上进行了仿真运算,验证了算法的有效性。 相似文献
8.
定位是无线传感器网络(WSNs)的应用支撑,针对用最小二乘法处理DV—Hop算法第三阶段误差过大、定位精度差的问题,提出了遗传算法(GA)+单纯形法的混合GA后期优化处理DV—Hop算法。其中,DV—Hop定位算法第一,二阶段用跳距估计出信标节点与未知节点间的距离,再用GA(建立了代价函数与惩罚函数结合的适应度函数)与单纯形法(作为遗传算子增加了算法的局部搜索能力)结合的混合GA采用保优原则优化未知节点的坐标。通过仿真可知:该算法的定位精度高、网络覆盖率大,适合WSNs的定位。 相似文献
9.
10.
在元启发式算法自适应学习搜索框架下对分布估计算法和模拟退火算法的学习能力、深度搜索和广度搜索强度进行分析,针对分布估计算法广度搜索性能方面存在的问题,提出了一种将模拟退火算法融入分布估计算法的混合优化策略;以旅行商问题为例进行了仿真实验。实验结果表明,混合算法比分布估计算法和模拟退火算法具有更高的优化质量。 相似文献
11.
本文提出一种新的群集智能算法,在用Dijkstra算法基于链接图建模的地图中得到一个最优解的可行空间后,再用粒子群算法或蚂蚁算法优化得到全局的最优路径。因为群集智能算法是一种概率搜索算法,没有集中控制约束条件,不会因为个别个体的故障影响整个问题的求解,具有较强的鲁棒性,所以在机器人全局路径规划应用中具有较显著的优点。仿真结果表明了算法的有效性,是机器人路径规划的一个较好的方法。 相似文献
12.
针对机器人、无人机和其他智能系统的位置信息,研究了非视距(non line of sight, NLOS)环境中基于到达时间(time of arrival,TOA)测距的目标定位问题。在建模过程中,通过引入平衡参数来抑制NLOS误差对定位精度的影响,并成功将定位问题的形式与一个广义信赖域子问题(generalized trust region subproblem,GTRS)框架进行耦合。与其他凸优化算法不同的是,本文没有联合估计目标节点的位置和平衡参数,而是采用了一种迭代求精的思想,算法可以用二分法高速有效地进行求解。 所提算法与已有的算法相比,不需要任何关于NLOS路径的信息。此外,与大多数现有算法不同,所提算法的计算复杂度低,能够满足实时定位的需求。仿真结果表明:该算法具有稳定的NLOS误差抑制能力,在定位性能和算法复杂度之间有着很好的权衡。 相似文献
13.
具有适应性突变和惯性权重的粒子群优化(PSO)算法及其在动态系统参数估计中的应用 总被引:6,自引:0,他引:6
ALFI Alireza 《自动化学报》2011,37(5):541-549
An important problem in engineering is the unknown parameters estimation in nonlinear systems. In this paper, a novel adaptive particle swarm optimization (APSO) method is proposed to solve this problem. This work considers two new aspects, namely an adaptive mutation mechanism and a dynamic inertia weight into the conventional particle swarm optimization (PSO) method. These mechanisms are employed to enhance global search ability and to increase accuracy. First, three well-known benchmark functions namely Griewank, Rosenbrock and Rastrigrin are utilized to test the ability of a search algorithm for identifying the global optimum. The performance of the proposed APSO is compared with advanced algorithms such as a nonlinearly decreasing weight PSO (NDWPSO) and a real-coded genetic algorithm (GA), in terms of parameter accuracy and convergence speed. It is confirmed that the proposed APSO is more successful than other aforementioned algorithms. Finally, the feasibility of this algorithm is demonstrated through estimating the parameters of two kinds of highly nonlinear systems as the case studies. 相似文献
14.
15.
针对传统DV-Hop算法存在较大定位误差及忽略锚节点自身误差的问题,提出了一种基于最优跳距处理策略(PSOHD)的智能定位算法。该策略充分考虑了网络拓扑结构和锚节点自身误差对定位精度的影响,首先对锚节点引入两个通信半径,并分别统计每个锚节点通信半径范围内的节点数;然后采用加权最小二乘估计修正锚节点间的平均跳距;最后对用于未知节点位置估计的平均跳距进行筛选并加权处理。另外在定位阶段引入了粒子群优化(PSO)算法对未知节点进行定位。仿真结果表明,在适当增加节点能量消耗的条件下,改进算法的定位精度有明显改善,是一种可行的无线传感器网络(WSN)节点定位的解决方案。 相似文献
16.
基于狮群中狮王、母狮及幼狮的自然分工,模拟狮王守护、母狮捕猎、幼狮跟随3种群智能行为,提出群体智能算法——狮群算法.算法中不同种类的狮子位置更新方式不同.遵循自然界生物“适者生存”的竞争法则,狮王守护领土,优先享用食物,母狮合作捕猎,幼狮分为学习捕猎、饥饿进食和成年被驱逐.狮子位置更新方式的多样化保证算法快速收敛,不易陷入局部最优.最后,将算法应用于6个标准测试函数优化问题,并对比粒子群算法、骨干粒子群算法,测试结果表明,文中算法收敛速度较快,精度较高,能较好地获得全局最优解. 相似文献
17.
Group search optimizer (GSO) is a novel swarm intelligent (SI) algorithm for continuous optimization problem. The framework of the algorithm is mainly based on the producer-scrounger (PS) model. Comparing with ant colony optimization (ACO) and particle swarm optimization (PSO) algorithms, GSO emphasizes more on imitating searching behavior of animals. In standard GSO algorithm, more than 80% individuals are chosen as scroungers, and the producer is the one and only destination of them. When the producer cannot found a better position than the old one in some successive iterations, the scroungers will almost move to the same place, the group might be trapped into local optima though a small quantity of rangers are used to improve the diversity of it. To improve the convergence performance of GSO, an improved GSO optimizer with quantum-behaved operator for scroungers according to a certain probability is presented in the paper. In the method, the scroungers are divided into two parts, the scroungers in the first part update their positions with the operators of QPSO, and the remainders keep searching for opportunities to join the resources found by the producer. The operators of QPSO are utilized to improve the diversity of population for GSO. The improved GSO algorithm (IGSO) is tested on several benchmark functions and applied to train single multiplicative neuron model. The results of the experiments indicate that IGSO is competitive to some other EAs. 相似文献
18.
Incorporation of distributed generation (DG) in distribution network may reduce the network loss if DG of appropriate size is placed at proper strategic location. The current article presents determination of optimal size and location of DG in radial distribution network (RDN) for the reduction of network loss considering deterministic load demand and DG generation using symbiotic organisms search (SOS) algorithm. SOS algorithm is a meta-heuristic technique, inspired by the symbiotic relationship between different biological species. In this paper, optimal size and location of DG are obtained for two different RDNs (such as, 33-bus and 69-bus distribution networks). The obtained results, using the proposed SOS, are compared to the results offered by some other optimization algorithms like particle swarm optimization, teaching-learning based optimization, cuckoo search, artificial bee colony, gravitational search algorithm and stochastic fractal search. The comparison is done based on minimum loss of the distribution network as well as based on the convergence mobility of the fitness function offered by each of the comparative algorithms for both the networks under consideration. It is established that the proposed SOS algorithm offers better result as compared to other optimization algorithms under consideration. The results are also compared to the existing solution available in the literature. 相似文献
19.
樽海鞘群算法是一种新型的群智能优化算法.与其他智能优化算法相比,樽海鞘群算法的优化求解策略仍有待改进,以进一步提高该算法的求解精度和寻优效率.本文提出一种基于衰减因子和动态学习的改进樽海鞘群算法,通过在领导者更新阶段添加衰减因子,提高算法的局部开发能力,在跟随者更新阶段引入动态学习策略,提高算法的全局搜索能力.本文对16个测试函数进行实验,将提出的改进算法与其他智能优化算法比较,实验结果表明,本文提出的改进算法在收敛精度和收敛速度方面有较大提升,具有良好的优化性能. 相似文献