Coordinated controller tuning of a boiler turbine unit with new binary particle swarm optimization algorithm

Coordinated controller tuning of the boiler turbine unit is a challenging task due to the nonlinear and coupling characteristics of the system. In this paper, a new variant of binary particle swarm optimization (PSO) algorithm, called probability based binary PSO (PBPSO), is presented to tune the parameters of a coordinated controller. The simulation results show that PBPSO can effectively optimize the control parameters and achieves better control performance than those based on standard discrete binary PSO, modified binary PSO, and standard continuous PSO.     

MIMO系统的MPSO-PID型神经网络解耦控制研究

针对多输入多输出系统(MIMO系统)多变量、非线性、强耦合的特点,提出采用改进粒子群优化算法(MPSO)对PID型神经网络的权值进行优化的方法,实现对MIMO系统的解耦控制.其中,与基本PSO算法相比,MPSO算法后期仍能保持种群的多样性和较大的搜索空间;PID型神经网络是一种3层前向神经网络,网络各层神经元个数、连接方式、连接权值的初值都是按PID控制规律确定的.通过仿真分析,该方法有很好的控制品质:跟踪快、鲁棒性强、解耦效果好,为实际应用中强耦合系统控制方法的改进提供了理论依据.     

Evolutionary algorithms based design of multivariable PID controller

In this paper, performance comparison of evolutionary algorithms (EAs) such as real coded genetic algorithm (RGA), modified particle swarm optimization (MPSO), covariance matrix adaptation evolution strategy (CMAES) and differential evolution (DE) on optimal design of multivariable PID controller design is considered. Decoupled multivariable PI and PID controller structure for Binary distillation column plant described by Wood and Berry, having 2 inputs and 2 outputs is taken. EAs simulations are carried with minimization of IAE as objective using two types of stopping criteria, namely, maximum number of functional evaluations (Fevalmax) and Fevalmax along with tolerance of PID parameters and IAE. To compare the performances of various EAs, statistical measures like best, mean, standard deviation of results and average computation time, over 20 independent trials are considered. Results obtained by various EAs are compared with previously reported results using BLT and GA with multi-crossover approach. Results clearly indicate the better performance of CMAES and MPSO designed PI/PID controller on multivariable system. Simulations also reveal that all the four algorithms considered are suitable for off-line tuning of PID controller. However, only CMAES and MPSO algorithms are suitable for on-line tuning of PID due to their better consistency and minimum computation time.     

AN EFFICIENT EVOLUTIONARY NEURAL FUZZY CONTROLLER FOR THE INVERTED PENDULUM SYSTEM

In this article we propose an evolutionary neural fuzzy controller for the planetary train–type inverted pendulum system (IPS) and verify its effectiveness. The novel hybrid particle swarm optimization (HPSO) learning algorithm of the proposed controller is based on approaches of the fuzzy entropy clustering (FEC), the modified PSO (MPSO), and recursive singular value decomposition (RSVD). The FEC is applied to generate base particles and the MPSO is proposed to effectively improve the performance of the traditional PSO. There are mainly two different characteristics between the MPSO and its original version; that is, the initial parameters of the MPSO are calculated by an effective local approximation method (ELAM), and the global optimum is chosen by the multi-elites strategy (MES). In addition, we use the RSVD to determine the optimal consequent parameters of fuzzy rules, in order to reduce requirements of the computational time and space. Experimental results show that the proposed approach outperforms the proportional–integral–derivative (PID), PSO, and MPSO in terms of better abilities of tracking and noise rejection for planetary train–type IPS.     

基于改进粒子群算法的PID控制器参数优化

粒子群优化算法是一种性能优越的寻优算法,但由于早熟问题,影响了算法性能的发挥,同时PID控制器是一类广泛使用的控制器,其参数的选取可等效为优化问题,在标准微粒子群算法的基础上,分析了惯性权重对不同粒子的影响,提出了一种基于适应度值的多惯性权重动态调整机制,同时针对标准微粒子群算法易陷入局部最优的特点,引入混沌扰动机制,利用混沌的遍历性、随机性来改善种群的多样性,并将该方法用于PID控制器参数整定,仿真结果表明了方法的有效性和优越性。     

基于合作粒子群算法的PID神经网络非线性控制系统

PID神经元网络 (PIDNN)模型为一种新型的神经网络模型,兼有PID与神经网络的共同优点,应用于复杂的控制系统.取得优良控制性能,但其后向传播算法 (BP)限制了该模型的应用范围.为实现对非线性多变量系统的有效控制,扩展神经网络的应有范围,本文采用PIDNN神经网络设计了多变量PIDNN神经网络 (MPIDNN)控制器,并用本文作者提出的合作粒子群算法 (CPSO)取代了传统BP后向传播算法,通过比较MPIDNN_CPSO、MPIDNNCRPSO、MPIDNN_PSO和MPIDNN_BP4种控制器的控制性能,仿真结果表明,基于CPSO算法的MPIDNN控制器实现了对非线性多变量不对称系统的有效控制.与传统的BP算法相比,CPSO算法提高了控制系统的稳定性、精确性与鲁棒性.     

Optimal design of fractional-order PID controller for five bar linkage robot using a new particle swarm optimization algorithm

This paper introduces a new version of the particle swarm optimization (PSO) method. Two basic modifications for the conventional PSO algorithm are proposed to improve the performance of the algorithm. The first modification inserts adaptive accelerator parameters into the original velocity update formula of the PSO which speeds up the convergence rate of the algorithm. The ability of the algorithm in escaping from local optima is improved using the second modification. In this case, some particles of the swarm, which are named the superseding particles, are selected to be mutated with some probability. The proposed modified PSO (MPSO) is simple to be implemented, fast and reliable. To validate the efficiency and applicability of the MPSO, it is applied for designing optimal fractional-order PID (FOPID) controllers for some benchmark transfer functions. Then, the introduced MPSO is applied for tuning the parameters of FOPID controllers for a five bar linkage robot. Sensitivity analysis over the fractional order of the PID controller is also provided. Numerical simulations reveal that the MPSO can optimally tune the parameters of FOPID controllers.     

On the robust PID adaptive controller for exoskeletons: A particle swarm optimization based approach

This article proposes a robust PID adaptive controller for nonlinear systems with one or more degrees of freedom (DoF). The adaptive controller aims at minimizing the errors in trajectory tracking without requiring a prior modeling of the targeted nonlinear system. Furthermore, the proposed controller requires only the inputs and outputs of the system. And it is based on modified particle swarm optimization algorithm whose goal is to find the best PID parameters that optimize the execution of desired task by minimizing an objective function. The adaptation by the controller addresses two critical problems: The first problem is the instability of the control signal provided by the convergence phase of the classical PSO algorithm. This behavior adversely affects the lifetime of any actuator and, therefore, is undesirable. The second problem is the stagnation of the classical PSO algorithm after convergence at the immediately found optimal solution. The proposed adaptive PID controller is initially tested in simulation on a dynamical model of a robot manipulator evolving in the vertical plan. Which is followed by experimental tests performed on an actuated joint orthosis worn by human subjects having different morphologies. A comparative study with two other algorithms has been also conducted. Based on the obtained results, we conclude the efficiency of the proposed approach.     

A modified particle swarm optimization for aggregate production planning

Particle swarm optimization (PSO) originated from bird flocking models. It has become a popular research field with many successful applications. In this paper, we present a scheme of an aggregate production planning (APP) from a manufacturer of gardening equipment. It is formulated as an integer linear programming model and optimized by PSO. During the course of optimizing the problem, we discovered that PSO had limited ability and unsatisfactory performance, especially a large constrained integral APP problem with plenty of equality constraints. In order to enhance its performance and alleviate the deficiencies to the problem solving, a modified PSO (MPSO) is proposed, which introduces the idea of sub-particles, a particular coding principle, and a modified operation procedure of particles to the update rules to regulate the search processes for a particle swarm. In the computational study, some instances of the APP problems are experimented and analyzed to evaluate the performance of the MPSO with standard PSO (SPSO) and genetic algorithm (GA). The experimental results demonstrate that the MPSO variant provides particular qualities in the aspects of accuracy, reliability, and convergence speed than SPSO and GA.     

基于改进粒子群算法的PID参数优化与仿真

提出了一种基于改进的粒子群优化（PSO）算法的PID控制器参数整定方法。该方法采用了PSO的惯性权值自适应调整机制和粒子种群的动态更新策略,用以加速优化算法的收敛和维持群体的多样性。与常规的PSO算法相比,该方法简单易行,更容易找到全局最优解,优化效率和性能明显提高。将该算法应用非最小相位、一阶滞后等系统的PID控制器参数的优化,能够使控制系统获得较好的动态特性和很强的鲁棒性。仿真实验表明了所提出算法的有效性和优越性。     

多策略粒子群优化算法

为了克服粒子群优化算法易早熟、局部搜索能力弱的问题,提出了一种改进的粒子群优化算法--多策略粒子群优化算法。在群体寻优过程中,各粒子根据搜索到的最优位置的变动情况,从几种备选的策略中抉择出当代的最优搜索策略。其中,最优粒子有最速下降策略、矫正下降策略和随机移动策略可以选择,非最优粒子有聚集策略和扩散策略可以选择。四个典型测试函数的数值实验结果表明,新提出的算法比标准粒子群优化算法具有更强和更稳定的全局搜索能力。     

混合拓扑结构的粒子群算法及其在测试数据生成中的应用研究

粒子群算法(PSO)的拓扑结构是影响算法性能的关键因素,为了从根源上避免粒子群算法易陷入局部极值及早熟收敛等问题,提出一种混合拓扑结构的粒子群优化算法(MPSO)并将其应用于软件结构测试数据的自动生成中。通过不同邻域拓扑结构对算法性能影响的分析,采用一种全局寻优和局部寻优相结合的混合粒子群优化算法。通过观察粒子群的多样性反馈信息,对每一代种群粒子以进化时选择全局拓扑结构模型(GPSO)或局部拓扑结构模型(LPSO)的方法进行。实验结果表明,MPSO使得种群的多样性得到保证,避免了粒子群陷入局部极值,提高了算法的收敛速度。     

基于粒子群算法的一种非线性PID控制器

基于PID控制器各增益参数与偏差信号之间非线性关系,分析了一种P/I/D各部分参数关于误差的理想变化过程,根据控制与误差之间的调节规律,给定一组增益参数的连续非线性函数,构造出一种非线性PID控制器。粒子群算法具有对整个参数空间进行高效并行搜索的特点,采用该算法寻优整定该非线性PID控制器的各增益参数。仿真结果表明了所提算法的有效性和所设计控制器的优越性能。     

应用改进型微粒群算法优化语言模型

语言模型具有很好的可理解性特征，但在多数情况下，其精确性是难满足要求的．本文利用改进型微粒群算法（MPSO）优化输入变量的语言值及对应的正交模糊集参数，再应用Wang方法以形成语言模型，在保持可理解性情况下，获得较精确的语言模型．改进型微粒群算法采用惯性权重自适应动态调整策略，结果显示该改进算法在语言模型过程中更容易获得全局最优解，学习效率和优化性能明显提高．     

A modified particle swarm optimization for production planningproblems in the TFT Array process

In this study, a practical production planning problem in the TFT (thin film transistor) Array process is introduced. Several researchers have referred to the capacitated production lot-sizing allocation problems as NP-Hard. Naturally, it is harder to solve the capacitated production allocation problem considering its practical characteristics and constraints, such as allocation problems among bottleneck machines, photo masks, and products with different re-entrant layers. In response to this, we proposed a novel variation of the particle swarm optimization (PSO) model called the modified PSO (MPSO), which is a binary PSO model with dynamic inertia weight and mutation mechanism. It improves some weaknesses as opposed to the original version of the PSO, including a propensity for obstruction near the optimal solution regions that hardly improve solution quality by fine tuning. In addition, it is converted to be able to solve the model of binary decision variables. In order to illustrate effectiveness, the traditional PSO (TPSO), genetic algorithm (GA), and the proposed MPSO are compared by application of the literature’s well-known test problems as well as the practical production planning problem in the TFT Array process. Based on the results of the investigation, it can be concluded that the proposed MPSO is more effective than the other approaches in terms of superiority of solution and required CPU time.     

Multi‐objective robust fuzzy fractional order proportional–integral–derivative controller design for nonlinear hydraulic turbine governing system using evolutionary computation techniques

The present paper proposes a novel multi‐objective robust fuzzy fractional order proportional–integral–derivative (PID) controller design for nonlinear hydraulic turbine governing system (HTGS) by using evolutionary computation techniques. The fuzzy fractional order PID (FOPID) controller takes closed loop error and its fractional derivative as inputs and performs fuzzy logic operations. Then, it produces the output through the fractional order integrator. The predominant advantages of the proposed controller are its capability to handle complex nonlinear processes like HTGS in heuristic manner, due to fuzzy incorporation and extending an additional flexibility in tuning the order of fractional derivative/integral terms to enhance the closed loop performance. The present work formulates the optimal tuning problem of fuzzy FOPID controller for HTGS as a multi‐objective one instead of a traditional single‐objective one towards satisfying the conflicting criteria such as less settling time and minimum damped oscillations simultaneously to ensure the improved dynamic performance of HTGS. The multi‐objective evolutionary computation techniques such as non‐dominated sorting genetic algorithm‐II (NSGA‐II) and modified NSGA‐II have been utilized to find the optimal input/output scaling factors of the proposed controller along with the order of fractional derivative/integral terms for HTGS system under no load and load turbulence conditions. The performance of the proposed fuzzy FOPID controller is compared with PID and FOPID controllers. The simulations have been conducted to test the tracking capability and robust performance of HTGS during dynamic set point changes for a wide range of operating conditions and model parameter variations, respectively. The proposed robust fuzzy FOPID controller has ensured better fitness value and better time domain specifications than the PID and FOPID controllers, during optimization towards satisfying the conflicting objectives such as less settling time and minimum damped oscillations simultaneously, due to its special inheritance of fuzzy and FOPID properties.     

A binary ABC algorithm based on advanced similarity scheme for feature selection

Feature selection is the basic pre-processing task of eliminating irrelevant or redundant features through investigating complicated interactions among features in a feature set. Due to its critical role in classification and computational time, it has attracted researchers’ attention for the last five decades. However, it still remains a challenge. This paper proposes a binary artificial bee colony (ABC) algorithm for the feature selection problems, which is developed by integrating evolutionary based similarity search mechanisms into an existing binary ABC variant. The performance analysis of the proposed algorithm is demonstrated by comparing it with some well-known variants of the particle swarm optimization (PSO) and ABC algorithms, including standard binary PSO, new velocity based binary PSO, quantum inspired binary PSO, discrete ABC, modification rate based ABC, angle modulated ABC, and genetic algorithms on 10 benchmark datasets. The results show that the proposed algorithm can obtain higher classification performance in both training and test sets, and can eliminate irrelevant and redundant features more effectively than the other approaches. Note that all the algorithms used in this paper except for standard binary PSO and GA are employed for the first time in feature selection.     

基于改进PSO算法的过热汽温神经网络预测控制

将改进粒子群优化算法(MPSO)融合到神经网络预测控制中,提出了基于MPSO-RBF混合优化策略的模型预测器,以及基于MPSO算法的非线性优化控制器.针对过热汽温的控制,构造了基十神经网络预测控制的串级控制系统,并就该系统在实现时所涉及到的预测模型、滚动优化算法、反馈校正、仿真参数设置问题等进行了分析,给出了MPSO算法的粒子编码、操作设计和混合优化算法步骤.对某超临界600 MW直流锅炉高温过热器的过热汽温控制,进行了仿真试验,结果表明该方法具有良好的性能指标和应用前景.     

基于改进遗传算法的深度神经网络优化研究

深度前馈神经网络在分类和回归问题上得到了很好的应用,但网络性能极大程度上受到其结构和超参数影响.为了获得高性能的神经网络,首先对遗传算法的选择策略进行改进,之后利用该改进遗传算法,采用二进制编码与实数编码的混合编码策略对深度前馈神经网络层数、每层节点量以及学习率和权重进行优化.改进的选择策略,在最优保存策略的基础上从父代和子代合并的2n个个体中,以一定的概率选择部分适应值较差个体作为新父代,以增加种群多样性,避免陷入局部最优.同时引入dropout方法减少网络过拟合训练数据.使用Ring、Breast cancer、Twonorm、Heart、Blood、Ionosphere、Monk共7个数据集进行数值实验,并与其他相关文献中的算法比较,仿真结果表明,改进的遗传算法能搜索到较高性能的神经网络.     

The impact of particular components of the PSO-based algorithm solving the Dynamic Vehicle Routing Problem

This paper presents and analyzes a Two-Phase Multi-Swarm Particle Swarm Optimizer (2MPSO) solving the Dynamic Vehicle Routing Problem (DVRP). The research presented in this paper focuses on finding a configuration of several optimization improvement techniques, dedicated to solving dynamic optimization problems, within the 2MPSO framework. Techniques, whose impact on results achieved for DVRP is analyzed, include: solving the current state of a problem with a capacitated clustering and routing heuristic algorithms, solving requests-to-vehicles assignment by the PSO algorithm, route optimization by a separate instance of the PSO algorithm, and knowledge transfer between subsequent states of the problem. The results obtained by the best chosen configuration of the 2MPSO are compared with the state-of-the-art literature results on a popular set of benchmark instances.Our study shows that strong results achieved by 2MPSO should be attributed to three factors: generating initial solutions with a clustering heuristic, optimizing the requests-to-vehicle assignment with a metaheuristic approach, direct passing of solutions obtained in the previous stage (times step) of the problem solving procedure to the next stage. Additionally, 2MPSO outperforms the average results obtained by other algorithms presented in the literature, both in the time limited experiments, as well as those restricted by the number of fitness function evaluations.