Hardware/software co-design for particle swarm optimization algorithm

This paper presents a hardware/software (HW/SW) co-design approach using SOPC technique and pipeline design method to improve design flexibility and execution performance of particle swarm optimization (PSO) for embedded applications. Based on modular design architecture, a Particle Updating Accelerator module via hardware implementation for updating velocity and position of particles and a Fitness Evaluation module implemented either on a soft-cored processor or Field Programmable Gate Array (FPGA) for evaluating the objective functions are respectively designed to work closely together to carry out the evolution process at different design stages. Thanks to the design flexibility, the proposed approach can tackle various optimization problems of embedded applications without the need for hardware redesign. To further improve the execution performance of the PSO, a hardware random number generator (RNG) is also designed in this paper in addition to a particle re-initialization scheme to promote exploration search during the optimization process. Experimental results have demonstrated that the proposed HW/SW co-design approach for PSO algorithms has good efficiency for obtaining high-quality solutions for embedded applications.     

基于锦标赛选择遗传算法的随机微粒群算法

以保证全局收敛的随机微粒群算法SPSO为基础。提出了一种改进的随机微粒群算法-GAT-SPSO。该方法是在SPSO的进化过程中．以锦标赛选择机制下的遗传算法所产生的最优个体来代替SPSO中停止的微粒,参与下一代的群体进化。通过时三个多峰的测试函数进行仿真,其结果表明：在搜索空间维数相同的情况下,GAT-SPSO的收敛率厦收敛速度均大大优于SPSO。     

A new gradient based particle swarm optimization algorithm for accurate computation of global minimum

Stochastic optimization algorithms like genetic algorithms (GAs) and particle swarm optimization (PSO) algorithms perform global optimization but waste computational effort by doing a random search. On the other hand deterministic algorithms like gradient descent converge rapidly but may get stuck in local minima of multimodal functions. Thus, an approach that combines the strengths of stochastic and deterministic optimization schemes but avoids their weaknesses is of interest. This paper presents a new hybrid optimization algorithm that combines the PSO algorithm and gradient-based local search algorithms to achieve faster convergence and better accuracy of final solution without getting trapped in local minima. In the new gradient-based PSO algorithm, referred to as the GPSO algorithm, the PSO algorithm is used for global exploration and a gradient based scheme is used for accurate local exploration. The global minimum is located by a process of finding progressively better local minima. The GPSO algorithm avoids the use of inertial weights and constriction coefficients which can cause the PSO algorithm to converge to a local minimum if improperly chosen. The De Jong test suite of benchmark optimization problems was used to test the new algorithm and facilitate comparison with the classical PSO algorithm. The GPSO algorithm is compared to four different refinements of the PSO algorithm from the literature and shown to converge faster to a significantly more accurate final solution for a variety of benchmark test functions.     

Comparison of particle swarm optimization and genetic algorithm for FACTS-based controller design

Recently, genetic algorithms (GA) and particle swarm optimization (PSO) technique have attracted considerable attention among various modern heuristic optimization techniques. The GA has been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, and the ability to effectively solve highly non-linear, mixed integer optimization problems that are typical of complex engineering systems. PSO technique is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. Since the two approaches are supposed to find a solution to a given objective function but employ different strategies and computational effort, it is appropriate to compare their performance. This paper presents the application and performance comparison of PSO and GA optimization techniques, for flexible ac transmission system (FACTS)-based controller design. The design objective is to enhance the power system stability. The design problem of the FACTS-based controller is formulated as an optimization problem and both PSO and GA optimization techniques are employed to search for optimal controller parameters. The performance of both optimization techniques in terms of computational effort, computational time and convergence rate is compared. Further, the optimized controllers are tested on a weakly connected power system subjected to different disturbances over a wide range of loading conditions and parameter variations and their performance is compared with the conventional power system stabilizer (CPSS). The eigenvalue analysis and non-linear simulation results are presented and compared to show the effectiveness of both the techniques in designing a FACTS-based controller, to enhance power system stability.     

基于粒子群算法的传感器网络室内定位系统优化

通过接收信号强度指示(RSSI)和欧氏距离的非线性函数映射关系来进行弱移动目标的距离估计.以最大似然估计(MLE)法为基础,结合电磁波在自由空间中的传播特性,重新构建基于粒子群优化(PSO)定位算法的适应度函数来提高无线定位精度.并提出了一种惯性权重优化的自适应学习机制来优化全局搜索能力和局部搜索精度,提升定位算法的容错能力.测试结果表明:本室内定位算法具有抗干扰强、鲁棒性好和无线定位精度高等优点.     

Reliability enhancement of a radial distribution system using coordinated aggregation based particle swarm optimization considering customer and energy based indices

This paper describes an algorithm for optimum modifications for failure rate and repair time for a radial electrical distribution system. The modifications are with respect to a penalty cost function minimization. The cost function has been minimized subject to the energy based and customer oriented indices, i.e. AENS, SAIFI, SAIDI and CAIDI. Coordinated aggregation based particle swarm optimization (CAPSO) has been used for optimization. The algorithm has been implemented on a sample radial distribution system. The results obtained have been compared with those obtained using PSO.