Multi-objective optimization design of wheat centralized seed feeding device based on particle swarm optimization (PSO) algorithm

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

Cable-driven parallel robots (CDPRs) have been widely used in engineering fields because of their significant advantages including high load-bearing capacity, large workspace, and low inertia. However, the impact of convergence speed and solution accuracy of optimization approaches on optimal performances can become a key issue when it comes to the optimal design of CDPR applied to large storage space. An adaptive adjustment inertia weight particle swarm optimization (AAIWPSO) algorithm is proposed for the multi-objective optimal design of CDPR. The kinematic and static models of CDPR are established based on the principle of virtual work. Subsequently, two performance indices including workspace and dexterity are derived. A multi-objective optimization model is established based on performance indices. The AAIWPSO algorithm introduces an adaptive adjustment inertia weight to improve the convergence efficiency and accuracy of traditional particle swarm optimization (PSO) algorithm. Numerical examples demonstrate that final convergence values of the objective function by the AAIWPSO algorithm can almost be 14∼20% and 19∼40% higher than those by the PSO algorithm and genetic algorithm (GA) for the optimal design of CDPR with different configurations and masses of end-effectors, respectively.

As an important transportation hub connecting the two sides of the Yellow River, the Yellow River Grand Bridge is of great significance for strengthening regional exchanges and promoting the high-quality development of the Yellow River Basin. However, due to the complex terrain, changeable climate, high sediment concentration, long construction duration, complicated process, strong dynamic, and many factors affecting construction. It often brings many problems, including low quality, waste of resources, and environmental pollution, which makes it difficult to achieve the balance of multiple objectives at the same time. Therefore, it is very important to carry out multi-objective optimization research on the construction of the Yellow River Grand Bridge. This paper takes the Yellow River Grand Bridge on a highway as the research object and combines the concept of “green construction” and the national policy of “carbon neutrality and carbon peaking” to construct six major construction projects, including construction time, cost, quality, environment, resources, and carbon emission. Then, according to the multi-attribute utility theory, the objectives of different attributes are normalized, and the multi-objective equilibrium optimization model of construction time-cost-quality-environment-resource-carbon emission of the Yellow River Grand Bridge is obtained; finally, in order to avoid the shortcomings of a single algorithm, the particle swarm optimization algorithm and the simulated annealing algorithm are combined to obtain the simulated annealing particle swarm optimization (SA-PSO) algorithm. The multi-objective equilibrium optimization model of the construction of the Yellow River Grand Bridge is solved. The optimization result is 108 days earlier than the construction period specified in the contract, which is 9.612 million yuan less than the maximum cost, 6.3% higher than the minimum quality level, 11.1% lower than the maximum environmental pollution level, 4.8% higher than the minimum resource-saving level, and 3.36 million tons lower than the maximum carbon emission level. It fully illustrates the effectiveness of the SA-PSO algorithm for solving multi-objective problems.

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.

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.

Hippopotamus algorithm for optimal sizing of hybrid renewable energy system

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.

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.

Design and multi-objective optimization of hairpin motor cooling system based on orthogonal design method and composite algorithm

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.

In this paper, a multi-objective hybrid firefly and particle swarm optimization (MOHFPSO) was proposed for different multi-objective optimal power flow (MOOPF) problems. Optimal power flow (OPF) was formulated as a non-linear problem with various objectives and constraints. Pareto optimal front was obtained by using non-dominated sorting and crowding distance methods. Finally, an optimal compromised solution was selected from the Pareto optimal set by applying an ideal distance minimization method. The efficiency of the proposed MOHFPSO technique was tested on standard IEEE 30-bus and IEEE 57-bus test systems with various conflicting objectives. Simulation results were also compared with non-dominated sorting based multi-objective particle swarm optimization (MOPSO) and different optimization algorithms reported in the current literature. The achieved results revealed the potential of the proposed algorithm for MOOPF problems.

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 multi-objective 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.

Particle swarm optimization (PSO) is a powerful optimization technique that has been applied to solve a number of complex optimization problems. One such optimization problem is topology design of distributed local area networks (DLANs). The problem is defined as a multi-objective optimization problem requiring simultaneous optimization of monetary cost, average network delay, hop count between communicating nodes, and reliability under a set of constraints. This paper presents a multi-objective particle swarm optimization algorithm to efficiently solve the DLAN topology design problem. Fuzzy logic is incorporated in the PSO algorithm to handle the multi-objective nature of the problem. Specifically, a recently proposed fuzzy aggregation operator, namely the unified And-Or operator (Khan and Engelbrecht in Inf. Sci. 177: 2692---2711, 2007), is used to aggregate the objectives. The proposed fuzzy PSO (FPSO) algorithm is empirically evaluated through a preliminary sensitivity analysis of the PSO parameters. FPSO is also compared with fuzzy simulated annealing and fuzzy ant colony optimization algorithms. Results suggest that the fuzzy PSO is a suitable algorithm for solving the DLAN topology design problem.

PurposeA set of routers that are connected over communication channels can from network-on-chip (NoC). High performance, scalability, modularity and the ability to parallel the structure of the communications are some of its advantages. Because of the growing number of cores of NoC, their arrangement has got more valuable. The mapping action is done based on assigning different functional units to different nodes on the NoC, and the way it is done contains a significant effect on implementation and network power utilization. The NoC mapping issue is one of the NP-hard problems. Therefore, for achieving optimal or near-optimal answers, meta-heuristic algorithms are the perfect choices. The purpose of this paper is to design a novel procedure for mapping process cores for reducing communication delays and cost parameters. A multi-objective particle swarm optimization algorithm standing on crowding distance (MOPSO-CD) has been used for this purpose.Design/methodology/approachIn the proposed approach, in which the two-dimensional mesh topology has been used as base construction, the mapping operation is divided into two stages as follows: allocating the tasks to suitable cores of intellectual property; and plotting the map of these cores in a specific tile on the platform of NoC.FindingsThe proposed method has dramatically improved the related problems and limitations of meta-heuristic algorithms. This algorithm performs better than the particle swarm optimization (PSO) and genetic algorithm in convergence to the Pareto, producing a proficiently divided collection of solving ways and the computational time. The results of the simulation also show that the delay parameter of the proposed method is 1.1 per cent better than the genetic algorithm and 0.5 per cent better than the PSO algorithm. Also, in the communication cost parameter, the proposed method has 2.7 per cent better action than a genetic algorithm and 0.16 per cent better action than the PSO algorithm.Originality/valueAs yet, the MOPSO-CD algorithm has not been used for solving the task mapping issue in the NoC.