粒子群优化算法在电网规划中的应用

粒子群算法适合求解连续变量优化问题,本文提出了粒子群算法的新离散化方法。常规粒子群算法在电力系统优化问题中取得了成功,但有"趋同性"。本文提出了改进多粒子群优化算法(IPPSO),IPPSO是两层结构:底层用多个粒子群相互独立地搜索解空间以扩大搜索范围;上层用1个粒子群追逐当前全局最优解以加快收敛。粒子群以及粒子状态更新策略不要求相同。

多粒子群协同优化算法的配电网网架规划

配电网网架规划是一个复杂的大规模组合优化问题。针对PSO易早熟、收敛慢的缺陷,本文提出一种基于粒子群算法的多粒子协同优化算法来求解配电网网架规划问题,以达到线路的规划年综合费用最小为目标函数。由于该算法在操作过程中不可避免产生不可行解,本文提出了一种将不可行解修复成满足辐射型要求的可行解的方法。该算法在求解配电网网架优化问题时,编码容易且能方便处理网络辐射性问题,求解效率高、速度快。最后,通过算例证明该方法的可行性和有效性。

基于PSO算法的电液伺服调节环节参数辨识

鉴于汽轮机电液伺服调节环节大量存在的非线性环节,并且常规辨识方法很难对调速系统中大量存在的非线性环节参数进行辨识,从而难以得到准确的数学模型,本研究将粒子群优化算法引入参数辨识研究中,针对算法易早熟收敛的缺点,采用了基于双层进化的多粒子群优化算法,同时,通过现场实验研究对参数辨识的方法及效果进行验证。试验结果表明,利用多粒子群优化算法对建立的汽轮机电液调节系统执行环节的参数进行辨识能取得理想效果,满足工程应用的需求。

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

A composite particle swarm algorithm for global optimization of multimodal functions

During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.

Improved PSO for integrating dynamic cell formation and layout problems

To decrease the impact of shorter product life cycles,dynamic cell formation problems(CFPs)and cell layout problems(CLPs)were simultaneously optimized.First,CFPs and CLPs were formally described.Due to the changes of product demands and the lim it of machine capacity,the existing layout needed to be rearranged to a high degree.Secondly,a mathematical model was established for the objective function of minimizing the total costs.Thirdly,a novel dynamic multi-swarm particle swarm optimization(DMS-PSO)algorithm based on the communication learning strategy(CLS)was developed.Toavoid falling into local optimum and slow convergence,each swarm shared their optimal locations before regrouping.Finally,simulation experiments were conducted under different conditions.Numerical results indicate that the proposed algorithm has better stability and it converges faster than other existing algorithms.

Multi-Objective Optimal Approach for Injection Molding Based on Surrogate Model and Particle Swarm Optimization Algorithm

An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization(PSO) algorithm was constructed.As a new surrogate model technology,Kriging model has better fitting precision for nonlinear problem.The Kriging model was adopted to replace computer aided engineering(CAE) simulation as fitness function of multi-objective PSO algorithm,and the computation cost can be reduced greatly.By introducing multi-objective handling mechanism of crowding distance and mutation operator to multiobjective PSO algorithm,the entire Pareto front can be approximated better.It is shown that the multi-objective optimization strategy can get higher solving accuracy and computation efficiency under small sample.

Multi-objective robust design optimization of a novel negative Poisson's ratio bumper system

Negative Poisson's ratio(NPR) structure has outstanding performances in lightweight and energy absorption, and it can be widely applied in automotive industries. By combining the front anti-collision beam, crash box and NPR structure, a novel NPR bumper system for improving the crashworthiness is first proposed in the work. The performances of the NPR bumper system are detailed studied by comparing to traditional bumper system and aluminum foam filled bumper system. To achieve the rapid design while considering perturbation induced by parameter uncertainties, a multi-objective robust design optimization method of the NPR bumper system is also proposed. The parametric model of the bumper system is constructed by combining the full parametric model of the traditional bumper system and the parametric model of the NPR structure. Optimal Latin hypercube sampling technique and dual response surface method are combined to construct the surrogate models. The multi-objective robust optimization results of the NPR bumper system are then obtained by applying the multi-objective particle swarm optimization algorithm and six sigma criteria. The results yielded from the optimizations indicate that the energy absorption capacity is improved significantly by the NPR bumper system and its performances are further optimized efficiently by the multi-objective robust design optimization method.