This paper proposes Parallelized Linear Time-Variant Acceleration Coefficients and Inertial Weight of Particle Swarm Optimization algorithm(PLTVACIW-PSO).Its designed has introduced the benefits of Parallel computing ...This paper proposes Parallelized Linear Time-Variant Acceleration Coefficients and Inertial Weight of Particle Swarm Optimization algorithm(PLTVACIW-PSO).Its designed has introduced the benefits of Parallel computing into the combined power of TVAC(Time-Variant Acceleration Coefficients)and IW(Inertial Weight).Proposed algorithm has been tested against linear,non-linear,traditional,andmultiswarmbased optimization algorithms.An experimental study is performed in two stages to assess the proposed PLTVACIW-PSO.Phase I uses 12 recognized Standard Benchmarks methods to evaluate the comparative performance of the proposed PLTVACIWPSO vs.IW based Particle Swarm Optimization(PSO)algorithms,TVAC based PSO algorithms,traditional PSO,Genetic algorithms(GA),Differential evolution(DE),and,finally,Flower Pollination(FP)algorithms.In phase II,the proposed PLTVACIW-PSO uses the same 12 known Benchmark functions to test its performance against the BAT(BA)and Multi-Swarm BAT algorithms.In phase III,the proposed PLTVACIW-PSO is employed to augment the feature selection problem formedical datasets.This experimental study shows that the planned PLTVACIW-PSO outpaces the performances of other comparable algorithms.Outcomes from the experiments shows that the PLTVACIW-PSO is capable of outlining a feature subset that is capable of enhancing the classification efficiency and gives the minimal subset of the core features.展开更多
In this paper, a hybrid particle swarm optimization （PSO） algorithm with differential evolution （DE） is proposed for numerical benchmark problems and optimization of active disturbance rejection controller （ADRC...In this paper, a hybrid particle swarm optimization （PSO） algorithm with differential evolution （DE） is proposed for numerical benchmark problems and optimization of active disturbance rejection controller （ADRC） parameters. A chaotic map with greater Lyapunov exponent is introduced into PSO for balancing the exploration and exploitation abilities of the proposed algorithm. A DE operator is used to help PSO jump out of stagnation. Twelve benchmark function tests from CEC2005 and eight real world opti- mization problems from CEC2011 are used to evaluate the performance of the proposed algorithm. The results show that statistically, the proposed hybrid algorithm has performed consistently well compared to other hybrid variants. Moreover, the simulation results on ADRC parameter optimization show that the optimized ADRC has better robustness and adaptability for nonlinear discrete-time systems with time delays.展开更多
In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matri...In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matrix-based reduction method depends on whether the numerical attributes can be properly discretized or not.So a discretization algorithm based on particle swarm optimization(PSO) is proposed. Moreover, hybrid weights are adopted in the process of particles evolution. Comparative calculations for certain equipment are completed to demonstrate the effectiveness of the proposed algorithm. The results indicate that the proposed algorithm has better performance than other popular algorithms such as class-attribute interdependence maximization(CAIM)discretization method and entropy-based discretization method.展开更多
This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of...This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of electric machine design problems are discussed,followed by benchmark studies comparing generic algorithms(GA),differential evolution(DE)algorithms and particle swarm optimizations(PSO)on a 6/4 switched reluctance machine design with seven independent variables and a strong nonlinear multi-objective Pareto front.To better quantify the quality of the Pareto fronts,five primary quality indicators are employed to serve as the algorithm testing metrics.The results show that the three algorithms have similar performances when the optimization employs only a small number of candidate designs or ultimately,a significant amount of candidate designs.However,DE tends to perform better in terms of convergence speed and the quality of Pareto front when a relatively modest amount of candidates are considered.展开更多
针对压电柔性机械臂运行过程中的弹性振动问题,提出了基于粒子群优化算法(particle swarm optimization,简称PSO)自整定比例积分微分(proportional integral differential,简称PID)控制器参数的柔性臂振动抑制方法。采用标准粒子群优化...针对压电柔性机械臂运行过程中的弹性振动问题,提出了基于粒子群优化算法(particle swarm optimization,简称PSO)自整定比例积分微分(proportional integral differential,简称PID)控制器参数的柔性臂振动抑制方法。采用标准粒子群优化算法,以时间乘绝对误差积(integrated time and absolute error,简称ITAE)准则为适应度函数,整定PID控制器的3个控制参数Kp,Ki和Kd,并采用Matlab Simulink平台建立双连杆压电柔性机械臂振动控制仿真模型,研制基于虚拟仪器技术的柔性臂振动控制试验系统。仿真与试验结果表明,采用常规PID控制算法和基于PSO自整定的PID控制算法均能有效地抑制柔性机械臂的弹性振动,但后者的振动抑制效果、鲁棒性与稳定性优于前者。展开更多
基金funded by the Prince Sultan University,Riyadh,Saudi Arabia.
文摘This paper proposes Parallelized Linear Time-Variant Acceleration Coefficients and Inertial Weight of Particle Swarm Optimization algorithm(PLTVACIW-PSO).Its designed has introduced the benefits of Parallel computing into the combined power of TVAC(Time-Variant Acceleration Coefficients)and IW(Inertial Weight).Proposed algorithm has been tested against linear,non-linear,traditional,andmultiswarmbased optimization algorithms.An experimental study is performed in two stages to assess the proposed PLTVACIW-PSO.Phase I uses 12 recognized Standard Benchmarks methods to evaluate the comparative performance of the proposed PLTVACIWPSO vs.IW based Particle Swarm Optimization(PSO)algorithms,TVAC based PSO algorithms,traditional PSO,Genetic algorithms(GA),Differential evolution(DE),and,finally,Flower Pollination(FP)algorithms.In phase II,the proposed PLTVACIW-PSO uses the same 12 known Benchmark functions to test its performance against the BAT(BA)and Multi-Swarm BAT algorithms.In phase III,the proposed PLTVACIW-PSO is employed to augment the feature selection problem formedical datasets.This experimental study shows that the planned PLTVACIW-PSO outpaces the performances of other comparable algorithms.Outcomes from the experiments shows that the PLTVACIW-PSO is capable of outlining a feature subset that is capable of enhancing the classification efficiency and gives the minimal subset of the core features.
基金supported by National Natural Science Foundation of China(Nos.61174140 and 61203016)Ph.D.Programs Foundation of Ministry of Education of China(No.20110161110035)China Postdoctoral Science Foundation Funded Project(No.2013M540628)
文摘In this paper, a hybrid particle swarm optimization （PSO） algorithm with differential evolution （DE） is proposed for numerical benchmark problems and optimization of active disturbance rejection controller （ADRC） parameters. A chaotic map with greater Lyapunov exponent is introduced into PSO for balancing the exploration and exploitation abilities of the proposed algorithm. A DE operator is used to help PSO jump out of stagnation. Twelve benchmark function tests from CEC2005 and eight real world opti- mization problems from CEC2011 are used to evaluate the performance of the proposed algorithm. The results show that statistically, the proposed hybrid algorithm has performed consistently well compared to other hybrid variants. Moreover, the simulation results on ADRC parameter optimization show that the optimized ADRC has better robustness and adaptability for nonlinear discrete-time systems with time delays.
基金the National Natural Science Foundation of China(No.51775090)the General Program of Civil Aviation Flight University of China(No.J2015-39)
文摘In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matrix-based reduction method depends on whether the numerical attributes can be properly discretized or not.So a discretization algorithm based on particle swarm optimization(PSO) is proposed. Moreover, hybrid weights are adopted in the process of particles evolution. Comparative calculations for certain equipment are completed to demonstrate the effectiveness of the proposed algorithm. The results indicate that the proposed algorithm has better performance than other popular algorithms such as class-attribute interdependence maximization(CAIM)discretization method and entropy-based discretization method.
文摘This paper systematically evaluates and compares three well-engineered and popular multi-objective optimization algorithms for the design of switched reluctance machines.The multi-physics and multi-objective nature of electric machine design problems are discussed,followed by benchmark studies comparing generic algorithms(GA),differential evolution(DE)algorithms and particle swarm optimizations(PSO)on a 6/4 switched reluctance machine design with seven independent variables and a strong nonlinear multi-objective Pareto front.To better quantify the quality of the Pareto fronts,five primary quality indicators are employed to serve as the algorithm testing metrics.The results show that the three algorithms have similar performances when the optimization employs only a small number of candidate designs or ultimately,a significant amount of candidate designs.However,DE tends to perform better in terms of convergence speed and the quality of Pareto front when a relatively modest amount of candidates are considered.
文摘针对压电柔性机械臂运行过程中的弹性振动问题,提出了基于粒子群优化算法(particle swarm optimization,简称PSO)自整定比例积分微分(proportional integral differential,简称PID)控制器参数的柔性臂振动抑制方法。采用标准粒子群优化算法,以时间乘绝对误差积(integrated time and absolute error,简称ITAE)准则为适应度函数,整定PID控制器的3个控制参数Kp,Ki和Kd,并采用Matlab Simulink平台建立双连杆压电柔性机械臂振动控制仿真模型,研制基于虚拟仪器技术的柔性臂振动控制试验系统。仿真与试验结果表明,采用常规PID控制算法和基于PSO自整定的PID控制算法均能有效地抑制柔性机械臂的弹性振动,但后者的振动抑制效果、鲁棒性与稳定性优于前者。
