Balanced performance enhancement of a linear generator: Solution of conflicting parametric requirements by design optimization

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.

This article proposes the hybrid Nelder–Mead (NM)–Particle Swarm Optimization (PSO) algorithm based on the NM simplex search method and PSO for the optimization of multimodal functions. The hybrid NM–PSO algorithm is very easy to implement, in practice, since it does not require gradient computation. This hybrid procedure performed the exploration with PSO and the exploitation with the NM simplex search method. In a suite of 17 multi-optima test functions taken from the literature, the computational results via various experimental studies showed that the hybrid NM–PSO approach is superior to the two original search techniques (i.e. NM and PSO) in terms of solution quality and convergence rate. In addition, the presented algorithm is also compared with eight other published methods, such as hybrid genetic algorithm (GA), continuous GA, simulated annealing (SA), and tabu search (TS) by means of a smaller set of test functions. On the whole, the new algorithm is demonstrated to be extremely effective and efficient at locating best-practice optimal solutions for multimodal functions.

The objective of the research work is to examine energy-efficient routing in wireless sensor networks for moving nodes by contrasting new evolutionary algorithms with the Particle Swarm Optimization (PSO) Algorithm. Comparative analysis of energy efficient routing is performed by a novel genetic algorithm where there are several samples (N = 10) and a PSO algorithm where there are several samples (N = 10) techniques with pre-test power of 80% using NS2. When routing wireless sensor networks with moving nodes, Various metrics, including delay, energy use, and packet delivery ratio, are used to compare PSO and genetic algorithms. The evolutionary algorithm outperforms the PSO algorithm in these ways in terms of packet delivery ratio, energy usage, and delay. (p < 0.05) indicates a statistically significant difference. The research's findings comprised the three metrics of delay, energy consumption and packet delivery ratio. The method shows that the novel Genetic algorithm outperforms the PSO algorithm for wireless sensor network energy-efficient routing for moving nodes by identifying a set of routes that can satisfy the delay restrictions.KeywordsNovel genetic algorithmParticle Swarm Optimization (PSO)Wireless sensor networkDelayEnergy consumptionPacket delivery ratio

The non-uniform inflow caused by the elbow inlet is one of the main reasons for the low actual operation performance of a centrifugal pump. Orthogonal experiment and GA_PSO algorithm are used to improve the head and efficiency of a centrifugal pump with an elbow inlet based on the method combining numerical simulation and prototype experiment in this paper. The effects of the design parameters, including elbow inlet radius ratio, blade inlet angle, blade number, blade wrap angle, blade outlet angle, impeller outlet diameter, blade outlet width and flow area ratio, on the pump head and efficiency are studied in the orthogonal experiment. The blade inlet angle is the major factor to match the non-uniform inflow and reduce the flow loss in the impeller inlet to contribute to enhancing the pump performance and cavitation characteristics. The particle swarm optimization (PSO) algorithm is optimized by integrating the genetic algorithm (GA), which ensures that the PSO-calculation result avoids falling into the local optimization and the global optimal solution is obtained as quickly as possible. The centrifugal pump with an elbow inlet is optimally designed by the GA_PSO algorithm. According to the performance test results, the efficiency of the optimized pump is 4.7% higher than that of the original pump.

In this paper, we present a comprehensive and in-depth investigation on the optimization of Proportional-Integral (PI) controller tuning for achieving stability and desired overshoot in the step response. The main objective of this study is to compare the effectiveness of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) techniques in finding the optimal parameters for the PI controller. The PI controller is a widely used control algorithm that plays a crucial role in many industrial processes. Its tuning greatly affects the system's performance, particularly in terms of stability and overshoot. Therefore, finding the optimal tuning parameters is of utmost importance. To address this optimization problem, we propose the utilization of two popular metaheuristic algorithms, GA and PSO. These algorithms are known for their ability to efficiently search through large solution spaces and find near-optimal solutions. By applying these algorithms to the PI controller tuning problem, we aim to determine which technique yields better results in terms of stability and overshoot tuning. In our comparative study, we provide a detailed explanation of both GA and PSO algorithms, focusing on their working principles and mathematical formulations. We also describe how these algorithms can be applied to the PI controller tuning problem. Furthermore, we highlight the key differences between GA and PSO, shedding light on their strengths and weaknesses. To assess the performance of GA and PSO, we conduct several experiments using different benchmark functions and step response models. We measure the stability and overshoot metrics for various parameter settings obtained through GA and PSO. By thoroughly analyzing the obtained results, we draw meaningful conclusions regarding the effectiveness of each technique. Our findings demonstrate that both GA and PSO exhibit promising results in optimizing PI controller tuning. These observations provide valuable insights and guidelines for choosing the appropriate algorithm based on specific control requirements. In conclusion, this comparative study is thought to contribute to the field of control systems engineering by offering a comprehensive analysis of GA and PSO techniques in the context of PI controller tuning. By highlighting their strengths and weaknesses, it is aimed to provide researchers and practitioners with valuable information for making informed decisions when optimizing control parameters for stability and overshoot reduction purposes.

The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.

Multidisciplinary design optimization (MDO) was performed on a helicopter rotor blade. The blade was modeled as a rigid flapping blade for dynamics; Blade Element Theory (BET) was the analysis approach to model the aerodynamic loading, and a simple linearly elastic hollowed rectangular section was the main structural component. MATLAB was used to solve the flapping differential equations and its Sequential Quadratic Programming (SQP) and Genetic Algorithm (GA) were used for the optimization. A Particle Swarm Optimization (PSO) routine was also tested. The optimization process consisted of three cases. The first case was a simple cantilever beam under centrifugal and an assumed bending loads. The optimization was performed using the SQP, GA, and PSO algorithms. The SQP resulted in the superior design with 75.45 compared to the GA's 87.1 and the PSO's 79.2, but a local minimum was present. The second case was an expansion of the first case by turning it into multidisciplinary problem. Aerodynamics was included in the design variables and objective function. Only the SQP algorithm was used and there was a reduction in hub vertical shear by 33.6%. The blade mass increased by 36.84%. The last case was an improvement to the second by creating a multiobjective problem by including the hub radial shear and the results were improved significantly by reducing the hub vertical shear by 34.06% and radial shear by 17.87% with a reduction of blade mass by 23.86%.

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.

In this paper, new optimized multilevel biphase pulse compression codes (MBPCC) with low peak side lobe (PSL) and mean side lobes (MSL) have been investigated. Amplitude and phase coding have been used during the optimization process. In previous studies, biphase codes were optimized using genetic algorithm (GA). The robustness of genetic algorithm in solving optimization problems degrades simultaneously as the code length increases. Particle swarm optimization (PSO) algorithm has been used with MBPCC to solve this problem. PSO algorithm has the merits of rapid convergence to the global optimum. Complete description of PSO implementation process has been clarified. Swarm intelligence boasts a number of advantages due to the use of mobile agents. Set of novel codes with optimum PSL ranging between -27.06 dB and -38.26 dB for codes of length 5 up to 45 has been introduced. Optimization results obtained using both PSO and GA has been compared. Comparative study shows both the optimality and superiority of PSO algorithm over GA for different code lengths. MBPCC have a precision of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> (-30) dB, which can be feasibly implemented using digital attenuators at element level with optimum performance and hardware implementation facility.

In this paper, a real-valued genetic algorithm (RGA) and a particle swarm optimization (PSO) algorithm with a new fitness function method are proposed to design a PID controller for the Automatic Voltage Regulator (AVR) system. The proposed fitness function can let the RGA and PSO algorithm search a high-quality solution effectively and improve the transient response of the controlled system. The proposed algorithms are applied in the PID controller design for the AVR system. Some simulation and comparison results are presented. We can see that the proposed RGA and PSO algorithm with this new fitness function can find a PID control parameter set effectively so that the controlled AVR system has a better control performance.

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.

Optimisation of fixture layout is critical to reduce geometric and form error of the workpiece during the machining process. In this paper the optimal placement of fixture elements (locator and clamp locations) under dynamic conditions is investigated using evolutionary techniques. The application of the newly developed particle swarm optimisation (PSO) algorithm and widely used genetic algorithm (GA) is presented to minimise elastic deformation of the workpiece considering its dynamic response. To improve the performances of GA and PSO, an improved GA (IGA) obtained by basic GA (GA) with sharing and adaptive mutation and an improved PSO (IPSO) obtained by basic PSO (PSO) incorporated into adaptive mutation are developed. ANSYS parametric design language (APDL) of finite element analysis is employed to compute the objective function for a given fixture layout. Three layout optimisation cases derived from the high speed slot milling case are used to test the effectiveness of the GA, IGA, PSO and IPSO based approaches. The comparisons of computational results show that IPSO seems superior to GA, IGA and PSO approaches with respect to the trade-off between global optimisation capability and convergence speed for the presented type problems.

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.

Developing dielectric capacitors with both a high power density and a high energy density for application in power electronics has been a long-standing challenge. Glass-ceramics offer the potential of retaining the high relative permittivity of ceramics and at the same time of exhibiting the high dielectric breakdown strength and fast charge/discharge rate of glasses, thus producing concurrently high power and energy densities in a single material. In this work, glass-ceramics are fabricated to achieve simultaneously high power and energy densities, high efficiency, and thermal stability by tuning the glass crystallization process via a suitable nucleating agent and a high oxygen partial pressure. Under the same practical charge-discharge test conditions, the as-prepared glass-ceramics combine the high energy density of ceramics and ultrafast discharge rate of glasses, producing the highest power density among glass- and ceramic-based dielectric materials. This work demonstrates the significant potential of achieving both high power and energy densities in glass-ceramics by optimizing the glass crystallization process.

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