共查询到20条相似文献，搜索用时 156 毫秒
1.
本文针对粒子群算法具有不易陷入局部极小、收敛速度快等特点,提出了一种基于粒子群的小波神经网络学习算法,优化了小波神经网络中的各个参数,并将应用于函数仿真试验。试验表明,该算法能减少迭代次数、提高收敛精度,是小波网络的有效训练算法。 相似文献
2.
软硬件划分算法是软硬件协同设计系统中的关键部分。文章介绍了遗传算法(GA)和离散化的粒子群算法(PSO),并将两者混合成算法GA-PSO。利用任务流图对系统进行建模后,在MATLAB平台对算法进行仿真实验;实验结果表明,文章提出的算法GA-PSO能综合GA和PSO两种算法的优点,在嵌入式系统的软硬件划分中应用效果较好。 相似文献
3.
惯性权重是粒子群算法的一项重要参数,其值变化形式直接影响粒子群算法的性能。在介绍粒子群基本算法的基础上,分析已有固定惯性权重、时变惯性权重和动态自适应惯性权重粒子群算法的基本原理。通过4个典型测试函数的仿真实验,证明不同算法的收敛速度和全局寻优能力。 相似文献
4.
<正>近年来,智能优化算法层出不穷,如：灰狼优化算法（Grey Wolf Optimization,GWO）、鲸鱼优化算法（Whale Optimization Algorithm,WOA）、粒子群算法（Particle Swarm Optimization,PSO）、遗传算法（Genetic Algorithm,GA）等。由于智能优化算法参数较少,容易实现,受到各国学者的青睐。但是,随着优化功能的具体化和规模的庞大化,部分单一算法无法兼顾收敛速度和精度,无法满足实际应用的需求。 相似文献
5.
交通流量预测是智能交通系统研究的重要组成部分。提出了一种粒子群(PSO)优化RBF神经网络的交通流量预测方法。该方法以误差能量函数为适应度函数,利用PSO算法对RBF神经网络参数进行优化,有效克服交通流量数据非周期性、非线性和随机性等问题。仿真实验结果证明比单纯用RBF预测模型精度高、收敛速度快,表明粒子群优化的RBF神经网络模型具有良好的应用价值。 相似文献
6.
介绍了基本粒子群优化算法及其原理,针对其易陷入局部极值和后期收敛速度慢的缺点,研究了基于惯性权重因子的改进粒子群优化算法。通过测试函数对固定惯性权重和时变惯性权重参数的选择进行了系统的实验,并且分析了种群规模与学习因子参数对粒子群算法优化性能的影响。 相似文献
7.
差分进化算法(Differential Evolution Algorithms,DE)和粒子群算法(Particle Swarm Optimization,PSO)是一种基于种群的全局优化的通用的启发式算法,已经用来求解很多的问题。本文提出一种基于DE和PSO的双进化方式的种群进化策略。对于种群中的每个粒子可以随机选择按照差分进化或者按照粒子群进化。为了提高进化的收敛速度,对于每一代粒子选择一个最优的粒子提供给按照PSO算法进化的粒子使用。通过4个标准函数测试该算法并与PSO和DE算法进行比较,实验证明该算法是一种求解精度高,速度快,鲁棒性好的算法。 相似文献
8.
9.
研究了考试系统中一个关键的技术——组卷算法,提出了应用粒子群优化算法组卷。PSO算法源于蜜蜂群觅食,是一种智能寻优算法,它首先初始化一群随机粒子（随机解）,然后通过迭代找到最优解。PSO算法组卷是一个离散性求解问题,这是对PSO算法应用上的一个扩展。 相似文献
10.
基于GIS的分布式水文模型系统开发研究 总被引：2，自引：0，他引：2
近几年,随着计算机、地理信息系统GIS和遥感技术的发展,分布式水文模型得到了迅速发展。首先介绍了地理信息系统在分布式水循环模型的应用,探讨了地理信息系统与分布式水文模型的 4种集成模式;然后应用松散耦合结构开发了基于GIS的 水循环机理 系统理论相耦合的时变增益分布式水文模型"系统,并在甘肃省内板桥流域进行了实例验证,获得了良好的模拟效果。 相似文献
11.
Ashik Ahmed Md. Mehedi Hassan Galib Shafi Md. Kawsar Zaman Golam Sarowar 《Journal of The Franklin Institute》2018,355(1):197-217
In wind power system, low frequency oscillations are observed due to imbalance between mechanical input and electrical output. Hence, variable susceptance controllers are being adopted to mitigate these oscillations. However, improper modulation of control parameters also leads to system instability. Therefore, we propose an optimization methodology for mitigating low frequency oscillations in wind power generation system. To visualize our methodology, we use a lead-lag type variable susceptance controller for fixed speed induction generator (FSIG) based wind generation system. Then, we optimize gain and time constants of lead-lag controller using three optimization algorithms: particle swarm optimization (PSO), genetic algorithm (GA), and flower pollination algorithm (FPA). Later, we perform non-linear time domain simulation and quantitative analysis to find average fitness, standard deviation, run time, and iteration number for these optimization algorithms. Moreover, non-parametric statistical analysis, such as Kolmogorov–Smirnov and Wilcoxon signed-rank tests are employed for identifying statistically significant differences among these algorithms. 相似文献
12.
《Journal of The Franklin Institute》2022,359(16):9401-9421
This paper develops a distributed reconstruction algorithm, that can be implemented efficiently, for time-varying graph signals. The reconstruction problem is formulated as an unconstrained optimization problem that minimizes the weighted sum of the data fidelity term and the regularization term. The regularizer used is the nonsmoothness measure of the temporal difference signal. The classical Newton’s method can be used to solve the optimization problem. However, computation of the Hessian matrix inverse is required, and this does not scale well with the graph size. Furthermore, a distributed implementation is not possible. An approximation to the inverse Hessian, that exploits the graph topology, is developed here. The resulting iterative algorithm can be implemented in a distributed manner, and scales well with the graph size. Convergence analysis of the algorithm is presented, which shows convergence to the global optimum. Numerical results, using both synthetic and real world datasets, will demonstrate the superiority of the proposed reconstruction algorithm over existing methods. 相似文献
13.
粒子群优化（PSO）算法是一种模拟自然生物群体（swarm）行为的优化技术。PSO算法源于对鸟群觅食行为的研究,该算法简单易实现,可调参数少,已得到广泛研究和应用。PSO算法不仅仅是种算法,更是一种学习和思维的创新,体现出学科之间交互所发生的一些突破。它不但是计算机理论上极大的理论创新,而且在哲学上也具有丰富的内涵。对此进行了论述。 相似文献
14.
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. 相似文献
15.
电网故障诊断的基本思想是根据保护动作原理将故障诊断问题表示为0-1规划问题。为了保证电网故障诊断的准确性和实时性,提出了一种改进的人工鱼群算法——二进制人工鱼群算法。分析了人工鱼群群聚行为和追尾行为最优方向的前进速度。并在此基础上与遗传算法、粒子群算法和量子免疫算法作了对比分析。结果表明:追尾行为最优方向的前进速度优于群聚行为,二进制人工鱼群算法综合性能优于遗传算法、粒子群算法和量子免疫算法。研究表明二进制人工鱼群算法具有收敛速度快、种群规模小和搜索能力强的特点。 相似文献
16.
17.
18.
《Journal of The Franklin Institute》2022,359(18):10602-10627
This paper considers the finite-time distributed economic dispatch problem in smart grids: the power generated by individual generators are designed to satisfy a certain demand while minimizing the total generation cost in a distributed manner, which guarantees the convergence in finite time. The proposed method facilitates the solution of real time power dispatch problems. First, a class of distributed economic dispatch algorithm is proposed to achieve the optimal solution in finite-time with and without capacity limitations. Second, in order to reduce the information exchange requirements, a distributed, asynchronous event-triggered communication scheme is established which is free of Zeno with guaranteed finite-time convergence. Furthermore, both proposed algorithms are robust to the time-varying communication networks. Simulation results illustrate the effectiveness and scalability of the distributed algorithms. 相似文献
19.
《Information processing & management》2022,59(5):103005
In real-life applications, resources in construction projects are always limited. It is of great practical importance to shorten the project duration by using intelligent models (i.e., evolutionary computations such as genetic algorithm (GA) and particle swarm optimization (PSO) to make the construction process reasonable considering the limited resources. However, in the general EC-based model, for example, PSO easily falls into a local optimum when solving the problem of limited resources and the shortest period in scheduling a large network. This paper proposes two PSO-based models, which are resource-constrained adaptive particle swarm optimization (RC-APSO) and an input-adaptive particle swarm optimization (iRC-APSO) to respectively solve the static and dynamic situations of resource-constraint problems. The RC-APSO uses adaptive heuristic particle swarm optimization (AHPSO) to solve the limited resource and shortest duration problem based on the analysis of the constraints of process resources, time limits, and logic. The iRC-APSO method is a combination of AHPSO and network scheduling and is used to solve the proposed dynamic resource minimum duration problem model. From the experimental results, the probability of obtaining the shortest duration of the RC-APSO is higher than that of the genetic PSO and GA models, and the accuracy and stability of the algorithm are significantly improved compared with the other two algorithms, providing a new method for solving the resource-constrained shortest duration problem. In addition, the computational results show that iRC-APSO can obtain the shortest time constraint and the design scheme after each delay, which is more valuable than the static problem for practical project planning. 相似文献
20.
基于多目标鱼群-蚁群算法的水资源优化配置 总被引：2，自引：2，他引：0
为了解决复杂的水资源优化配置问题和丰富智能优化方法在水资源优化配置中的应用,建立了以经济、社会、环境综合效益最大为目标的水资源优化配置模型和多目标鱼群-蚁群算法。经济效益以区域供水带来的直接经济效益最大为目标;社会效益以区域总缺水量最小为目标;生态环境效益以区域重要污染物排放量最小为目标;约束条件包括供水、需水、水环境和经济发展协调度等。多目标鱼群-蚁群算法融合了人工鱼群算法的快速跟踪变化和跳出局部极值优点以及蚁群算法的信息素正反馈优点,并将人工鱼群算法中的拥挤度概念引入到蚁群算法中,避免了蚁群算法初期可能早熟的问题。通过实验仿真,此算法具有较快的收敛速度和较高的寻优性能,能有效地找到优化解,从而为解决复杂的水资源优化配置问题提供了新的思路。 相似文献