共查询到20条相似文献，搜索用时 479 毫秒
1.
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. 相似文献
2.
分布式水循环模型的参数优化算法比较及应用 总被引：1，自引：0，他引：1
分布式水文模型的优势在于还原水文过程的时空变异性,可以很好地模拟和反映各种水文要素和下垫面因素的时空分布不均匀性。由此也导致模型参数过多,在子流域过多的情况下,人工调节参数繁琐复杂,应用优化算法实现参数自动调节成为首选。本文选取石羊河流域九条岭站1988-2005年实测径流资料,分别应用SCE-UA算法、遗传算法(GA)和粒子群算法(PSO)对分布式水循环模型(时变增益模型)进行参数率定,对比3种算法的收敛速度、所需迭代次数和算法稳定性。结果表明:通过SCE-UA、GA和PSO的优化,模型水平衡系数都控制在0.0左右,而相关系数和效率系数分别能达到0.90和0.84以上,模拟精度较好。但粒子群算法的全局搜索能力和收敛速度优于SCE-UA和遗传算法,所需迭代次数最少,初值敏感性小,更适合时变增益模型的参数寻优,有很高的扩展性和改进潜力。 相似文献
3.
混合遗传蚁群算法的改进及在TSP问题中的应用研究 总被引：1，自引：0，他引：1
蚁群算法(ACA)与遗传算法(GA)都属于仿生型优化算法,是解决组合优化问题的强有力工具,并都分别成功应用于旅行商问题(TSP)中.本文将两种算法进行融合,并给出了新的融合方式.实验结果表明,新的遗传蚁群混合算法有效地改进了算法的全局收敛性,并加快了收敛速度. 相似文献
4.
This paper presents the design and performance analysis of Proportional Integral Derivate (PID) controller for an Automatic Voltage Regulator (AVR) system using recently proposed simplified Particle Swarm Optimization (PSO) also called Many Optimizing Liaisons (MOL) algorithm. MOL simplifies the original PSO by randomly choosing the particle to update, instead of iterating over the entire swarm thus eliminating the particles best known position and making it easier to tune the behavioral parameters. The design problem of the proposed PID controller is formulated as an optimization problem and MOL algorithm is employed to search for the optimal controller parameters. For the performance analysis, different analysis methods such as transient response analysis, root locus analysis and bode analysis are performed. The superiority of the proposed approach is shown by comparing the results with some recently published modern heuristic optimization algorithms such as Artificial Bee Colony (ABC) algorithm, Particle Swarm Optimization (PSO) algorithm and Differential Evolution (DE) algorithm. Further, robustness analysis of the AVR system tuned by MOL algorithm is performed by varying the time constants of amplifier, exciter, generator and sensor in the range of ?50% to +50% in steps of 25%. The analysis results reveal that the proposed MOL based PID controller for the AVR system performs better than the other similar recently reported population based optimization algorithms. 相似文献
5.
电网故障诊断的基本思想是根据保护动作原理将故障诊断问题表示为0-1规划问题。为了保证电网故障诊断的准确性和实时性,提出了一种改进的人工鱼群算法——二进制人工鱼群算法。分析了人工鱼群群聚行为和追尾行为最优方向的前进速度。并在此基础上与遗传算法、粒子群算法和量子免疫算法作了对比分析。结果表明:追尾行为最优方向的前进速度优于群聚行为,二进制人工鱼群算法综合性能优于遗传算法、粒子群算法和量子免疫算法。研究表明二进制人工鱼群算法具有收敛速度快、种群规模小和搜索能力强的特点。 相似文献
6.
7.
《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. 相似文献
8.
针对高斯混合模型算法（GMM）对初始参数敏感、易陷入局部最优的问题,本文提出一种基于改进海洋捕食者算法优化的GMM算法（MMPA-GMM）。首先基于混沌序列和伪对立学习策略初始化种群,引入非线性收敛因子平衡MPA算法的全局与局部搜索,同时提出融入社会等级制度的位置更新策略;然后从搜索能力和收敛速度对改进的MPA进行分析;最后以S_Dbw指标作为算法的适应度函数,利用改进的MPA优化GMM算法的初始参数。实验结果表明,改进的MPA在4种测试函数上表现良好,并且MMPA-GMM算法对4个数据集的聚类效果均有改善,有效避免了GMM算法陷入局部最优的问题。 相似文献
9.
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. 相似文献
10.
Since Proportional?+?Integral?+?Derivative (PID) controller is still the workhorse in taking over the workload of process control systems, this article introduces a new design methodology toward improving the performance of such controller. After a PI control law with windup protection is given, it is combined with a derivative path employing a first-order low pass filter in an innovative way to develop a performant controller called PI?+?DF controller. In attempting to attain a high level of control performance, gains of this controller including proportional, integral, derivative and filter gains are tuned choosing the recently introduced Stochastic Fractal Search (SFS) algorithm owing to its superiority to many state-of-the-art algorithms considering convergence, accuracy and robustness. To evaluate the efficacy of SFS, Particle Swarm Optimization (PSO) is also applied to the case study. Furthermore, the presented SFS optimized PI?+?DF controller is compared to a recently reported control scheme through simulation and experimental tests on an identical DC servo system. After providing the stability proof, SFS tuned PI?+?DF controller is found to be the pioneer in exhibiting the most accurate speed response profile under complicated scenarios, which is followed by PSO tuned PI?+?DF controller and the existing control approach, respectively. 相似文献
11.
本文采用栅格法建立机器人的环境模型,把免疫算法应用到机器人的路径规划中,通过提出一种新的多因素适应度函数,使对个体的评估更符合机器人所需要的最优路径。仿真结果表明该方法可行,而且有效,可以提高收敛速度,并与遗传算法进行比较,发现使用该免疫算法解决了遗传算法后期的波动现象。 相似文献
12.
13.
《Journal of The Franklin Institute》2023,360(8):5609-5633
In this paper, we propose a fault diagnosis (FD) approach for a class of nonlinear uncertain systems based on the deterministic learning approach (DLA). Specifically, an adaptive learning observer is constructed, in which the adaptive neural networks (NNs) are constructed to approximate the unknown system dynamics under normal and fault modes. Based on the strictly positive real (SPR) condition, the convergence of the state estimation can be guaranteed. When the system is undergoing a periodic or periodic-like (recurrent) motion, the states of the observer will also become recurrent. Thus through DLA, the partial persistent excitation (PE) condition of the associated subvectors of NNs is satisfied. By utilizing the partial (PE) condition, the uniformly completely observable (UCO) property of the identification system is analyzed and the exponential convergence condition of the identification system is derived. Under this condition, the unknown dynamics under normal and fault modes can be accurately identified along the system trajectory. And by utilizing the knowledge obtained in the identification phase, the fault can be detected in the diagnosis phase. The main attraction of this paper lies in the analytical result, which shows that the exponential convergence condition of the learning observer not only depends on the observer gain matrix, but also depends on the PE level of the regressor subvector of NN. Simulation results are included to illustrate the effectiveness of the proposed scheme. 相似文献
14.
《Journal of The Franklin Institute》2017,354(11):4457-4480
Due to the hopeful application of gathering information from unreachable position, wireless sensor network creates an immense challenge for data routing to maximize the communication with more energy efficiency. In order to design the energy efficient routing, the optimization based clustering protocols are more preferred in wireless sensor network. In this paper, we have proposed competent optimization based algorithm called Fractional lion (FLION) clustering algorithm for creating the energy efficient routing path. Here, the proposed clustering algorithm is used to increase the energy and lifetime of the network nodes by selecting the rapid cluster head. In addition, we have proposed multi-objective FLION clustering algorithm to develop the new fitness function based on the five objectives like intra-cluster distance, inter-cluster distance, cluster head energy, normal nodes energy and delay. Here, the proposed fitness function is used to find the rapid cluster centroid for an efficient routing path. Finally, the performance of the proposed clustering algorithm is compared with the existing clustering algorithms such as low energy adaptive clustering hierarchy (LEACH), particle swarm optimization (PSO), artificial bee colony (ABC) and Fractional ABC clustering algorithm. The results proved that the lifetime of the wireless sensor nodes is maximized by the proposed FLION based multi-objective clustering algorithm as compared with existing protocols. 相似文献
15.
针对现有水资源配置模型存在的不精确问题,在现有水资源模型基础上增加了决策偏好系数和排放污染物种类以提高模型精确性,以吉林市水资源基础数据初始化水资源优化配置模型,针对目前对模型进行优化的粒子群算法易出现局部最优等情况,引入萤火虫算法对其进行改进,通过萤火虫趋向最优解的原理改善粒子群算法出现局部最优的情况,并加速其收敛速度。应用改进粒子群算法对模型进行优化求解,得出水资源优化配置方案,以满足经济效益、社会效益、生态环境效益的全面要求。 相似文献
16.
Nassim Tahouni M. Hassan Panjeshahi Abtin Ataei 《Journal of The Franklin Institute》2011,348(7):1456-2446
A great deal of attention has been paid to design and optimization of low-temperature liquefaction and gas separation problems over the past years, due to their difficult nature. In this paper, two approaches featuring sequential and simultaneous methods for selection and arrangement of sub-ambient separation systems and their associated refrigeration cycles are compared. The effect of ignoring heat integration within the separation system and between the separation and refrigeration systems is addressed as well as fixing the sequence order of separation. The optimization is carried out using two famous stochastic search methods i.e. Genetic Algorithm (GA) and Simulated Annealing (SA). Three case studies are examined to illustrate the significant differences between optimization results. Also, the design optimality is re-checked with respect to usage of different refrigerants and the resulting structure is verified by application of a comprehensive exergy analysis. 相似文献
17.
This article presents a novel tuning design of Proportional-Integral-Derivative (PID) controller in the Automatic Voltage Regulator (AVR) system by using Cuckoo Search (CS) algorithm with a new time domain performance criterion. This performance criterion was chosen to minimize the maximum overshoot, rise time, settling time and steady state error of the terminal voltage. In order to compare CS with other evolutionary algorithms, the proposed objective function was used in Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms for PID design of the AVR system. The performance of the proposed CS based PID controller was compared to the PID controllers tuned by the different evolutionary algorithms using various objective functions proposed in the literature. Dynamic response and a frequency response of the proposed CS based PID controller were examined in detail. Moreover, the disturbance rejection and robustness performance of the tuned controller against parametric uncertainties were obtained, separately. Energy consumptions of the proposed PID controller and the PID controllers tuned by the PSO and ABC algorithms were analyzed thoroughly. Extensive simulation results demonstrate that the CS based PID controller has better control performance in comparison with other PID controllers tuned by the PSO and ABC algorithms. Furthermore, the proposed objective function remarkably improves the PID tuning optimization technique. 相似文献
18.
J. Herrera A. Ibeas S. Alcántara M. de la Sen S.I. Serna-Garcés 《Journal of The Franklin Institute》2013,350(10):3128-3148
In this study, an approach to identify and control stable, unstable and integrating systems with unknown delays, framed on the generalized Pattern Search Method is presented. The proposed method inherits the global convergence properties of the generalized Pattern Search Method, allowing us to make a stability analysis of the proposed approach and delay identification capabilities. The proposed approach identifies the delay and guarantees closed-loop stability, which could be a difficult task since in unstable and integrating cases, open-loop experiments are not feasible. Simulation examples show the usefulness of the proposed strategy proving that the scheme is capable of identifying the delay and stabilizing the system even with long delay. 相似文献
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.
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noise-corrupted value of function at any chosen point in the parameter space is available. We first introduce a new continuous action-set learning automaton (CALA) and study its convergence properties. Then we give an algorithm for optimizing an unknown function. 相似文献