Blind Source Separation in Post-nonlinear Mixtures Using Natural Gradient Descent and Particle Swarm Optimization Algorithm

Collaborative beamforming in wireless sensor networks using a novel particle swarm optimization algorithm variant

The particle swarm optimization (PSO) algorithm presents a new way for finding optimal solutions of complex optimization problems. In this paper a modified particle swarm optimization algorithm is presented. We modify the PSO algorithm in some aspects. Firstly, a contractive factor is introduced to the position update equation, and the particles are limited in search region. A new strategy for updating velocity is then adopted, in which the velocity is weakened linearly. Thirdly, using an idea of intersecting two modified PSO algorithms. Finally, adding an item of integral control in the modified algorithm can improve its global search ability. Based on these strategies, we proposed a new PSO algorithm named crossed PSO algorithm. Simulation results show that the crossed PSO is superior to the original PSO algorithm and can get overall promising performance over a wide range of problems.

Neural Network system for SoC is one topic in the world. Recently, SoC began to combine AI technique by Python. When developers consider Intelligent system on SoC, the co-design software and hardware are significant. In this case, small devices and embedded system are target system. For IoT, those techniques will grow up in the world. Those cases, avoiding premature convergence while keeping performance is a challenge in training the neural network, especially in a case of large NNs or a large number of training data. In this case, one problem is a huge memory and processing power. For tiny memory and processing system as SoC, we propose an improved particle swarm optimization (PSO) algorithm called the PSOseed2 algorithm for training NN. The PSOseed2 algorithm solves the premature convergence of the standard PSO (SPSO) algorithm by slightly modifying the velocity update function without adding many computational tasks to the SPSO algorithm. We evaluated this algorithm on field programmable gate array (FPGA)-based NN and software-based NN and trained these NNs with different PSO algorithms that are SPSO, PSOseed, PSOseed2, and dissipative PSO. Experimental results with different datasets confirmed that the NNs trained by the proposed PSOseed2 algorithm had better recognition rates and lower global learning errors than the NN trained by other PSO algorithms. In this talk, I would like to talk those relational research in the world and our results and discussion.

The maximum power point tracking (MPPT) system ensures that the solar cell operates at its maximum power point, which is the point at which it produces the most power for a given set of conditions. This study uses an artificial bee colony (ABC) algorithm and particle swarm optimization (PSO) algorithms to optimize the boost converter. The ABC and PSO algorithms help to optimize the boost converter by finding the best possible duty cycle and other parameters that maximize efficiency. The resulting duty cycle of 20% produced the highest efficiency of 78.26% obtained from the boost converter. A system-wide test was conducted between 9:00 and 11:10 WIB. In MPPT systems using boost converters with the PSO algorithm, the average power is 16.80 W, while in MPPT systems using boost converters with the ABC algorithm, the average power is 14.53 W. The novelty of the study discusses a system designed to optimize power by using a boost converter in order to increase power output from solar panels. The algorithms PSO and ABC are used to analyze the data from the PV and adjust the converter parameters to optimize the output in order to increase the efficiency of the system.

In order to solve the problem of interaction between multiple evaluation indexes of seed metering performance under multiple factors of centralized seed feeding device, a multi-objective optimization of structure based on particle swarm optimization (PSO) algorithm was proposed in this paper. The wheat centralized seed feeding device was taken as the research object, and the experimental factors were cone angle of type hole, working speed and seed filling gap. The working process of wheat centralized seed feeding device was simulated by discrete element method (DEM). The average seed number of type hole, the variation coefficient of the average seed number of type hole, and the maximum tangential force between seed and seed feeding mechanism were selected as the evaluation indexes. Through the variance analysis of the evaluation indexes by the experimental factors, the optimization objective function was constructed. Using PSO algorithm, the multi-objective optimization was carried out for the wheat centralized seed feeding device. The optimization results show that the best structural combination parameters of the wheat centralized seed feeding device are the hole cone angle of 31.6° and the seed filling gap of 4.6 mm. The validity of the method was verified by simulation and field test. The results show that the PSO algorithm multi-objective optimization method proposed in this paper can provide a reference for the structural improvement and optimal design of the centralized seed feeding device. Keywords: centralized seed feeding device, multi-objective, optimization, PSO algorithm DOI: 10.25165/j.ijabe.20201306.5665 Citation: Wang Q Q, Li Z D, Wang W W, Zhang C L, Chen L Q, Wan L. Multi-objective optimization design of wheat centralized seed feeding device based on particle swarm optimization (PSO) algorithm. Int J Agric & Biol Eng, 2020; 13(6): 76–84.

The Particle swarm optimization (PSO) algorithm is a population-based intelligent stochastic search technique encouraged from the intrinsic manner of bee swarm seeking for their food source. With flexibility for numerical experimentation, the PSO algorithm has been mostly used to resolve diverse kind of optimization problems. The PSO algorithm is frequently captured in local optima meanwhile handling the complex real-world problems. Many authors improved the standard PSO algorithm with different mutation strategies but an exhausted comprehensive overview about mutation strategies is still lacking. This article aims to furnish a concise and comprehensive study of problems and challenges that prevent the performance of the PSO algorithm. It has tried to provide guidelines for the researchers who are active in the area of the PSO algorithm and its mutation strategies. The objective of this study is divided into two sections: primarily to display the improvement of the PSO algorithm with mutation strategies that may enhance the performance of the standard PSO algorithm to great extent and secondly, to motivate researchers and developers to use the PSO algorithm to solve the complex real-world problems. This study presents a comprehensive survey of the various PSO algorithms based on mutation strategies. It is anticipated that this survey would be helpful to study the PSO algorithm in detail for researchers.

In our previous research applied to the job shop scheduling problem (JSSP) for machine tool production, the multi-objective optimisation model based on the particle swarm optimization (PSO) research had an imbalance performance between the convergence rate and the convergence precision. In this article, a new hybrid algorithm using PSO and generic algorithm (GA) is proposed to solve this particular problem. In this new algorithm, named hybrid PSO-GA algorithm (HPGA), the PSO algorithm is redefined and modified by introducing genetic operators, i.e. the crossover operator and the mutation operator, to update the particles in the population. The HPGA is then applied in heavy machinery company with minimising machines’ makespan and minimising jobs’ tardiness as the two optimal objectives. The comparisons with actual application report have illustrated that the proposed HPGA can obtain higher quality of schedule solution for machine tool production. Furthermore, with solution quality and convergence rate as the two estimation measurements metrics, some comparisons are performed in order to illustrate that the HPGA has superiority over the PSO, GA and simulated annealing algorithm (SA). Results have indicated that, with the combination of the merits of PSO and GA, the proposed HPGA approach can achieve not only better solution quality but also faster convergence rate than the PSO, GA and SA, within a reasonable computation time for high dimensions JSSP.

A dynamic adaptive particle swarm optimization and genetic algorithm is presented to solve constrained engineering optimization problems. A dynamic adaptive inertia factor is introduced in the basic particle swarm optimization algorithm to balance the convergence rate and global optima search ability by adaptively adjusting searching velocity during search process. Genetic algorithm–related operators including a selection operator with time-varying selection probability, crossover operator, and n-point random mutation operator are incorporated in the particle swarm optimization algorithm to further exploit optimal solutions generated by the particle swarm optimization algorithm. These operators are used to diversify the swarm and prevent premature convergence. Tests on nine constrained mechanical engineering design optimization problems with different kinds of objective functions, constraints, and design variables in nature demonstrate the superiority of the dynamic adaptive particle swarm optimization and genetic algorithm against several other meta-heuristic algorithms in terms of solution quality, robustness, and convergence rate in most cases.

To solve the strong randomicity and slow convergence of the Particle Swarm Optimization(PSO) algorithms, two new particle’s position renewal formulas were analyzed on the basis of extrapolation in mathematics. A new modified PSO algorithms (called Leading PSO algorithms) was put forward. The Direct Torque Control(DTC) System was built in the environment of Matlab(Simulink). The weight and threshold values of BP Neural Network were trained using the modified PSO algorithms. Some disadvantages such as slow convergence speed and easily plunging into the local solution were avoided effectively. The simulation result shows that the system works well, and the rotor speed identifier has great static and dynamic performance.

To improve the simulation accuracy of disease prediction model, a modified hybrid algorithm combining BP neural network (BPNN) with particle swarm optimization (PSO) algorithm based on chaos theory optimization is proposed considering BPNN is easy to fall into the local extremum. The chaos theory is used to optimize PSO algorithm to overcome the premature convergence of the traditional PSO algorithm. Then, the improved CAPSO algorithm is used to train the BPNN, to make full use of the global search characteristic of PSO algorithm and the local search ability of BPNN. The fitness function of the PSO algorithm is used as the energy function, and the optimization method of the improved hybrid algorithm is selected according to the specified number of evolution. An optimized network model was used to predict the prevalence of coronary heart disease. Compared with other algorithms such as BP neural network, the results show that the proposed algorithm has high accuracy and can significantly improve the quality of prediction.

In this paper, we present a concept of a transistor level implementation of the Particle Swarm Optimization (PSO) algorithm that belongs to the group of unsupervised learning algorithms aimed at the design of artificial neural networks (ANNs). The algorithm exhibits an ability to search for an optimal solution in a multidimensional data space, in which many sub-optimal solutions may exist. The ANN that operates in accordance with the PSO algorithm is composed of a set of cooperating particles (agents) that explore an input data space and communicate information on the best found solution to other particles. The PSO algorithm is usually implemented in software. We in our investigations focus on its transistor level realization. Such an approach enables parallel data processing, in which the overall data rate only moderately depends on the number of particles. Most of the operations and components of such implemented PSO algorithm may be reused considering our former CMOS realizations of other self-organizing learning algorithms. This allowed us to assess main parameters of the PSO.

Improved Adaptive PSO-based Gain Tuning for PID Controllers in Utility Boilers

An improved particle swarm optimization (PSO) algorithm is proposed to solve a typical batching problem in a batch processing plant of the process industry. The batching problem (BP) is to transform the primary requirements for products into sets of batches for each task with the objective of minimizing the total workload. On the basis of some preliminary properties, a novel particle solution representation is designed for the BP. Unlike the ordinary idea of taking an objective function as the fitness function for PSO, the original objective function incorporated with a constraint function is to act as the fitness function of the PSO where the constraint and the objective functions are evaluated successively. Such a fitness function, together with a forward repair mechanism, makes it possible for a faster convergence. Further, for each iterative generation, a local search heuristic is used to improve the global best particle found so far. To verify the performance of the proposed PSO algorithm, the well-k...

Based on the deficiency of the traditional stochastic resonance method in multi-parameters optimization and the difficulty of adaptive stochastic resonance with genetic algorithm in multiple line-spectrums detection, a new method of adaptive swept stochastic resonance based on particle swarm optimization (PSO) is proposed. The signal-noise-ratio (SNR) of outputs of bistable system is determined as the fitness function of PSO and the line-spectrum can be detected by the synchronous optimization of multi-parameters. Simultaneously, the adaptive swept stochastic resonance, combined with twice sampling algorithm and PSO algorithm, achieves the detection of multiple line-spectrums. The simulation results show that the proposed method can detect multiple line- spectrums signal effectively, and has advantages of simplicity and fast convergence speed.

The performance of the Particle Swarm Optimization (PSO) algorithm can be greatly improved if the parameters are appropriately tuned. However, tuning the control parameters for PSO algorithms has traditionally been a time-consuming, empirical process. Furthermore, ideal parameters may be time-dependent. To address the issue of parameter tuning, self-adaptive PSO (SAPSO) algorithms adapt the PSO control parameters over time. While many such SAPSO techniques have been proposed, their behaviour is not well understood as no in-depth critical analysis of their adaptation mechanisms has been performed. This study examines the convergence behaviour of eight SAPSO algorithms both analytically and empirically. Evidence clearly indicates that the field of self-adaptive PSO algorithms is in a sad state, given that many techniques either demonstrate divergent behaviour coupled with excessive invalid particles, and thus infeasible solutions, or have prohibitively low particle step sizes caused by rapid convergence.