基于微粒群优化的模型参考自适应控制

针对复杂非线性对象提出了一种基于微粒群优化(PSO)的PID自适应控制方法.通过运用PSO算法对PID控制器参数进行在线调整,使模型参考自适应控制达到理想的控制效果.将该方法引入到连续搅拌反应釜这一复杂的非线性系统,仿真结果表明了该方法的良好性能.     

基于粒子群算法的改进模态参数识别方法

针对一类多模态振动衰减信号的模态参数识别,结合奇异值分解(singular value decomposition,SVD)、解析模态分解(analytical mode decomposition,AMD)、自回归功率谱和粒子群优化(particle swarm optimization,PSO)算法,提出了一种改进...     

Parallel asynchronous particle swarm optimization

The high computational cost of complex engineering optimization problems has motivated the development of parallel optimization algorithms. A recent example is the parallel particle swarm optimization (PSO) algorithm, which is valuable due to its global search capabilities. Unfortunately, because existing parallel implementations are synchronous (PSPSO), they do not make efficient use of computational resources when a load imbalance exists. In this study, we introduce a parallel asynchronous PSO (PAPSO) algorithm to enhance computational efficiency. The performance of the PAPSO algorithm was compared to that of a PSPSO algorithm in homogeneous and heterogeneous computing environments for small- to medium-scale analytical test problems and a medium-scale biomechanical test problem. For all problems, the robustness and convergence rate of PAPSO were comparable to those of PSPSO. However, the parallel performance of PAPSO was significantly better than that of PSPSO for heterogeneous computing environments or heterogeneous computational tasks. For example, PAPSO was 3.5 times faster than was PSPSO for the biomechanical test problem executed on a heterogeneous cluster with 20 processors. Overall, PAPSO exhibits excellent parallel performance when a large number of processors (more than about 15) is utilized and either (1) heterogeneity exists in the computational task or environment, or (2) the computation-to-communication time ratio is relatively small.     

Isolated particle swarm optimization with particle migration and global best adoption

Isolated particle swarm optimization (IPSO) segregates particles into several sub-swarms in order to improve the ability of the global optimization. In this study, particle migration and global best adoption (gbest adoption) are used to improve IPSO. Particle migration allows particles to travel among sub-swarms, based on the fitness of the sub-swarms. The use of gbest adoption allows sub-swarms to peep at the gbest proportionally or probably after a certain number of iterations, i.e. gbest replacing, and gbest sharing, respectively. Three well-known benchmark functions are utilized to determine the parameter settings of the IPSO. Then, 13 benchmark functions are used to study the performance of the designed IPSO. Computational experience demonstrates that the designed IPSO is superior to the original version of particle swarm optimization (PSO) in terms of the accuracy and stability of the results, when isolation phenomenon, particle migration and gbest sharing are involved.     

Multi-objective optimization of engineering systems using game theory and particle swarm optimization

This study proposes particle swarm optimization (PSO) based algorithms to solve multi-objective engineering optimization problems involving continuous, discrete and/or mixed design variables. The original PSO algorithm is modified to include dynamic maximum velocity function and bounce method to enhance the computational efficiency and solution accuracy. The algorithm uses a closest discrete approach (CDA) to solve optimization problems with discrete design variables. A modified game theory (MGT) approach, coupled with the modified PSO, is used to solve multi-objective optimization problems. A dynamic penalty function is used to handle constraints in the optimization problem. The methodologies proposed are illustrated by several engineering applications and the results obtained are compared with those reported in the literature.     

A parallel particle swarm optimization algorithm for multi-objective optimization problems

In this article, a new proposal of using particle swarm optimization algorithms to solve multi-objective optimization problems is presented. The algorithm is constructed based on the concept of Pareto dominance, as well as a state-of-the-art ‘parallel’ computing technique that intends to improve algorithmic effectiveness and efficiency simultaneously. The proposed parallel particle swarm multi-objective evolutionary algorithm (PPS-MOEA) is tested through a variety of standard test functions taken from the literature; its performance is compared with six noted multi-objective algorithms. The computational experience gained from the first two experiments indicates that the algorithm proposed in this article is extremely competitive when compared with other MOEAs, being able to accurately, reliably and robustly approximate the true Pareto front in almost every tested case. To justify the motivation behind the research of the parallel swarm structure, the computational results of the third experiment confirm the PPS-MOEA's merit in solving really high-dimensional multi-objective optimization problems.     

Multi-objective feasibility enhanced particle swarm optimization

This article introduces a new method entitled multi-objective feasibility enhanced partical swarm optimization (MOFEPSO), to handle highly-constrained multi-objective optimization problems. MOFEPSO, which is based on the particle swarm optimization technique, employs repositories of non-dominated and feasible positions (or solutions) to guide feasible particle flight. Unlike its counterparts, MOFEPSO does not require any feasible solutions in the initialized swarm. Additionally, objective functions are not assessed for infeasible particles. Such particles can only fly along sensitive directions, and particles are not allowed to move to a position where any previously satisfied constraints become violated. These unique features help MOFEPSO gradually increase the overall feasibility of the swarm and to finally attain the optimal solution. In this study, multi-objective versions of a classical gear-train optimization problem are also described. For the given problems, the article comparatively evaluates the performance of MOFEPSO against several popular optimization algorithms found in the literature.     

Solving constrained optimization problems with a hybrid particle swarm optimization algorithm

This article presents a particle swarm optimization algorithm for solving general constrained optimization problems. The proposed approach introduces different methods to update the particle's information, as well as the use of a double population and a special shake mechanism designed to avoid premature convergence. It also incorporates a simple constraint-handling technique. Twenty-four constrained optimization problems commonly adopted in the evolutionary optimization literature, as well as some structural optimization problems are adopted to validate the proposed approach. The results obtained by the proposed approach are compared with respect to those generated by algorithms representative of the state of the art in the area.     

求解复杂优化问题的双层多种群粒子群优化算法

为解决粒子群优化算法存在的易早熟和精度低问题,提出了一种双层多种群粒子群优化算法.此算法采用上下两层,即下层N个基础种群和上层一个精英种群.各个基础种群相互独立进化,并从精英种群中得到优良信息指导自己的进化.上层精英种群首先通过接受各基础种群的当前最优粒子来更新自己的粒子集合,然后执行自适应变异操作,最后随机地向每一个基础种群输送出本次进化后的一个最优粒子来改进其下一轮搜索.该算法的并行双进化机制增加了群体的随机性和多样性,提高了全局搜索能力和收敛精度.实例仿真表明该算法具有较好的性能,尤其对于复杂多峰函数优化,成功率显著提高.     

Parallel global optimization with the particle swarm algorithm

Present day engineering optimization problems often impose large computational demands, resulting in long solution times even on a modern high-end processor. To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the particle swarm optimization (PSO) algorithm. Parallel PSO performance was evaluated using two categories of optimization problems possessing multiple local minima-large-scale analytical test problems with computationally cheap function evaluations and medium-scale biomechanical system identification problems with computationally expensive function evaluations. For load-balanced analytical test problems formulated using 128 design variables, speedup was close to ideal and parallel efficiency above 95% for up to 32 nodes on a Beowulf cluster. In contrast, for load-imbalanced biomechanical system identification problems with 12 design variables, speedup plateaued and parallel efficiency decreased almost linearly with increasing number of nodes. The primary factor affecting parallel performance was the synchronization requirement of the parallel algorithm, which dictated that each iteration must wait for completion of the slowest fitness evaluation. When the analytical problems were solved using a fixed number of swarm iterations, a single population of 128 particles produced a better convergence rate than did multiple independent runs performed using sub-populations (8 runs with 16 particles, 4 runs with 32 particles, or 2 runs with 64 particles). These results suggest that (1) parallel PSO exhibits excellent parallel performance under load-balanced conditions, (2) an asynchronous implementation would be valuable for real-life problems subject to load imbalance, and (3) larger population sizes should be considered when multiple processors are available.     

基于粒子群算法的空间直线度误差评定

提出了一种满足最小区域法的空间直线度误差评价的新方法--粒子群算法。根据最小区域条件,建立了空间直线的数学模型以及优化目标函数。阐述了粒子群优化算法的原理和实现方法,然后根据粒子群算法优化求解。实例表明该方法对于空间直线度误差评定等非线性优化问题能得到最优解,可用于三坐标测量机等测量系统的空间直线度误差测量的数据处理。     

Applicability of surrogates to improve efficiency of particle swarm optimization for simulation-based problems

Particle swarm optimization (PSO) is a population-based, heuristic technique based on social behaviour that performs well on a variety of problems including those with non-convex, non-smooth objective functions with multiple minima. However, the method can be computationally expensive in that a large number of function calls is required. This is a drawback when evaluations depend on an off-the-shelf simulation program, which is often the case in engineering applications. An algorithm is proposed which incorporates surrogates as a stand-in for the expensive objective function, within the PSO framework. Numerical results are presented on standard benchmarking problems and a simulation-based hydrology application to show that this hybrid can improve efficiency. A comparison is made between the application of a global PSO and a standard PSO to the same formulations with surrogates. Finally, data profiles, probability of success, and a measure of the signal-to-noise ratio of the the objective function are used to assess the use of a surrogate.     

Solving constrained optimization problems with hybrid particle swarm optimization

Constrained optimization problems (COPs) are very important in that they frequently appear in the real world. A COP, in which both the function and constraints may be nonlinear, consists of the optimization of a function subject to constraints. Constraint handling is one of the major concerns when solving COPs with particle swarm optimization (PSO) combined with the Nelder–Mead simplex search method (NM-PSO). This article proposes embedded constraint handling methods, which include the gradient repair method and constraint fitness priority-based ranking method, as a special operator in NM-PSO for dealing with constraints. Experiments using 13 benchmark problems are explained and the NM-PSO results are compared with the best known solutions reported in the literature. Comparison with three different meta-heuristics demonstrates that NM-PSO with the embedded constraint operator is extremely effective and efficient at locating optimal solutions.     

A new images segmentation method based on modified particle swarm optimization algorithm

The partitioning of an image into several constituent components is called image segmentation. Many approaches have been developed; one of them is the particle swarm optimization (PSO) algorithm, which is widely used. PSO algorithm is one of the most recent stochastic optimization strategies. In this article, a new efficient technique for the magnetic resonance imaging (MRI) brain images segmentation thematic based on PSO is proposed. The proposed algorithm presents an improved variant of PSO, which is particularly designed for optimal segmentation and it is called modified particle swarm optimization. The fitness function is used to evaluate all the particle swarm in order to arrange them in a descending order. The algorithm is evaluated by performance measures such as run time execution and the quality of the image after segmentation. The performance of the segmentation process is demonstrated by using a defined set of benchmark images and compared against conventional PSO, genetic algorithm, and PSO with Mahalanobis distance based segmentation methods. Then we applied our method on MRI brain image to determinate normal and pathological tissues. © 2013 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 23, 265–271, 2013     

Guided particle swarm optimization method to solve general nonlinear optimization problems

The development of hybrid algorithms is becoming an important topic in the global optimization research area. This article proposes a new technique in hybridizing the particle swarm optimization (PSO) algorithm and the Nelder–Mead (NM) simplex search algorithm to solve general nonlinear unconstrained optimization problems. Unlike traditional hybrid methods, the proposed method hybridizes the NM algorithm inside the PSO to improve the velocities and positions of the particles iteratively. The new hybridization considers the PSO algorithm and NM algorithm as one heuristic, not in a sequential or hierarchical manner. The NM algorithm is applied to improve the initial random solution of the PSO algorithm and iteratively in every step to improve the overall performance of the method. The performance of the proposed method was tested over 20 optimization test functions with varying dimensions. Comprehensive comparisons with other methods in the literature indicate that the proposed solution method is promising and competitive.     

Stability assessment of earth slope using modified particle swarm optimization

This paper has proposed an effective method to determine the minimum factor of safety (FS) and associated critical failure surface in slope stability analysis. The search for the minimum FS based on limit equilibrium methods is a complex optimization problem as the objective function is non-smooth and non-convex. Recently, particle swarm optimization (PSO) as a meta-heuristic optimization algorithm has been developed with success in treating various types of problems. In the current study, a new approach of PSO is proposed to calculate the safety factor of earth slopes. The safety factors of the general slip surfaces are calculated using Spencer method of slices, and each new slip surface is randomly generated by straight line technique. The reliability and efficiency of the proposed algorithm are examined by considering a number of published cases. The results indicate that the new method can predict a more critical failure mechanism with a lower FS and can outperform the other methods in the literature as well as standard PSO. Finally, the proposed method will be validated by considering an existing slope failure in Ulu Klang, Malaysia.     

Sequential linear programming and particle swarm optimization for the optimization of energy districts

This article deals with the optimization of energy resource management of industrial districts, with the aim of minimizing customer energy expenses. A model of the district is employed, whose optimization gives rise to a nonlinear constrained optimization problem. Here the focus is on its numerical solution. Two different methods are considered: a sequential linear programming method and a particle swarm optimization method. Efficient implementations of both approaches are devised and the results of the tests performed on several energetic districts are reported, including a real case study.     

基于粒子群算法多目标优化液压支架四连杆

针对煤矿液压支架四连杆受力计算较为复杂,简化计算时易出现较大误差且稳定性较差的问题,提出从四连杆机构的空间受力出发并结合支架的运动轨迹,采用粒子群优化算法对四连杆机构展开优化研究。首先建立了四连杆优化模型,在优化模型中选取对结果影响较大的参数作为优化变量,以轨迹偏差、连杆长、连杆力之和作为目标函数,根据液压支架设计规范确定约束条件。然后使用粒子群算法对目标函数进行迭代求解并在求解过程中采用惩罚函数法解决优化模型中不等式约束问题。对比优化前后连杆的杆长、受力和稳定性数据,发现优化后的四连杆实现了轻量化,且受力较小,稳定性提高。研究结果对四连杆的设计有实际参考价值。     

Probabilistic optimal design of laminates using improved particle swarm optimization

A new approach to the particle swarm optimization (PSO) is proposed for the solution of non-linear optimization problems with constraints, and is applied to the reliability-based optimum design of laminated composites. Special mutation-interference operators are introduced to increase swarm variety and improve the convergence performance of the algorithm. The reliability-based optimum design of laminated composites is modelled and solved using the improved PSO. The maximization of structural reliability and the minimization of total weight of laminates are analysed. The stacking sequence optimization is implemented in the improved PSO by using a special coding technique. Examples show that the improved PSO has high convergence and good stability and is efficient in dealing with the probabilistic optimal design of composite structures.     

Genetic particle swarm parallel algorithm analysis of optimization arrangement on mistuned blades

This article introduces a method of mistuned parameter identification which consists of static frequency testing of blades, dichotomy and finite element analysis. A lumped parameter model of an engine bladed-disc system is then set up. A bladed arrangement optimization method, namely the genetic particle swarm optimization algorithm, is presented. It consists of a discrete particle swarm optimization and a genetic algorithm. From this, the local and global search ability is introduced. CUDA-based co-evolution particle swarm optimization, using a graphics processing unit, is presented and its performance is analysed. The results show that using optimization results can reduce the amplitude and localization of the forced vibration response of a bladed-disc system, while optimization based on the CUDA framework can improve the computing speed. This method could provide support for engineering applications in terms of effectiveness and efficiency.