Search results

Path planning is an important part of UAV mission planning. The main purpose of this paper is to overcome the shortcomings of the standard particle swarm optimization (PSO) such as easy to fall into the local optimum, so that the improved PSO applied to the UAV path planning can enable the UAV to plan a better quality path.

Firstly, the adaptation function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself. Secondly, the standard PSO is improved, and the improved particle swarm optimization with multi-strategy fusion (MFIPSO) is proposed. The method introduces class sigmoid inertia weight, adaptively adjusts the learning factors and at the same time incorporates K-means clustering ideas and introduces the Cauchy perturbation factor. Finally, MFIPSO is applied to UAV path planning.

Simulation experiments are conducted in simple and complex scenarios, respectively, and the quality of the path is measured by the fitness value and straight line rate, and the experimental results show that MFIPSO enables the UAV to plan a path with better quality.

Aiming at the standard PSO is prone to problems such as premature convergence, MFIPSO is proposed, which introduces class sigmoid inertia weight and adaptively adjusts the learning factor, balancing the global search ability and local convergence ability of the algorithm. The idea of K-means clustering algorithm is also incorporated to reduce the complexity of the algorithm while maintaining the diversity of particle swarm. In addition, the Cauchy perturbation is used to avoid the algorithm from falling into local optimum. Finally, the adaptability function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself, which improves the accuracy of the evaluation model.

This paper aims to present a new hybrid algorithm of Particle Swarm Optimization and the Genetic Algorithm (PSOGA) to optimize the space trusses with continuous design variables. The PSOGA is an efficient hybridized algorithm to solve optimization problems.

These algorithms have shown outstanding performance in solving optimization problems with continuous variables. The PSO conceptually models the social behavior of birds, in which individual birds exchange information about their position, velocity and fitness. The behavior of a flock is influencing the probability of migration to other regions with high fitness. The GAs procedure is based on the mechanism of natural selection. The present study uses mutation, random selection and reproduction to reach the best genetic algorithm by the operators of natural genetics. Thus, only identical chromosomes or particles can be converged.

In this research, using the idea of hybridization PSO and GA algorithms are hybridized and a new meta-heuristic algorithm is developed to minimize the space trusses with continuous design variables. To showing the efficiency and robustness of the new algorithm, several benchmark problems are solved and compared with other researchers.

The results indicate that the hybrid PSO algorithm improved in both exploration and exploitation. The PSO algorithm can be used to minimize the weight of structural problems under stress and displacement constraints.

Ant Colony Optimization and Particle Swarm Optimization represent two widely used Swarm Intelligence (SI) optimization techniques. Information processing using Multiple-Valued Logic (MVL) is carried out using more than two discrete logic levels. In this paper, we compare two the SI-based algorithms in synthesizing MVL functions. A benchmark consisting of 50,000 randomly generated 2-variable 4-valued functions is used for assessing the performance of the algorithms using the benchmark. Simulation results show that the PSO outperforms the ACO technique in terms of the average number of product terms (PTs) needed. We also compare the results obtained using both ACO-MVL and PSO-MVL with those obtained using Espresso-MV logic minimizer. It is shown that on average, both of the SI-based techniques produced better results compared to those produced by Espresso-MV. We show that the SI-based techniques outperform the conventional direct-cover (DC) techniques in terms of the average number of product terms required.

Robotic arms’ interactions with the external environment are growing more intricate, demanding higher control precision. This study aims to enhance control precision by establishing a dynamic model through the identification of the dynamic parameters of a self-designed robotic arm.

This study proposes an improved particle swarm optimization (IPSO) method for parameter identification, which comprehensively improves particle initialization diversity, dynamic adjustment of inertia weight, dynamic adjustment of local and global learning factors and global search capabilities. To reduce the number of particles and improve identification accuracy, a step-by-step dynamic parameter identification method was also proposed. Simultaneously, to fully unleash the dynamic characteristics of a robotic arm, and satisfy boundary conditions, a combination of high-order differentiable natural exponential functions and traditional Fourier series is used to develop an excitation trajectory. Finally, an arbitrary verification trajectory was planned using the IPSO to verify the accuracy of the dynamical parameter identification.

Experiments conducted on a self-designed robotic arm validate the proposed parameter identification method. By comparing it with IPSO1, IPSO2, IPSOd and least-square algorithms using the criteria of torque error and root mean square for each joint, the superiority of the IPSO algorithm in parameter identification becomes evident. In this case, the dynamic parameter results of each link are significantly improved.

A new parameter identification model was proposed and validated. Based on the experimental results, the stability of the identification results was improved, providing more accurate parameter identification for further applications.

Reliability and maintainability estimation of any system depends on the identification of the best-fitted probability distribution of failure and repair rates. The parameters of the best-fitted probability distribution are also contributing significantly to reliability estimation. In this work, a case study of load haul dump (LHD) machines is illustrated that consider the optimization of failure and repair rate parameters using two well established metaheuristic approaches, namely, genetic algorithm (GA) and particle swarm optimization (PSO). This paper aims to analyze the aforementioned points.

The data on time between failures (TBF) and time to repairs (TTR) are collected for a LHD machine. The descriptive statistical analysis of TBF & TTR data is performed, trend and serial correlation tested and using Anderson–Darling (AD) value best-fitted distributions are identified for repair and failure times of various subsystems. The traditional methods of estimation like maximum likelihood estimation, method of moments, least-square estimation method help only in finding the local solution. Here, for finding the global solution two well-known metaheuristic approaches are applied.

The reliability of the LHD machine after 60 days on the real data set is 28.55%, using GA on 250 generations is 17.64%, and using PSO on 100 generations and 100 iterations is 30.25%. The PSO technique gives the global best value of reliability.

The present work will be very convenient for reliability engineers, researchers and maintenance managers to understand the failure and repair pattern of LHD machines. The same methodology can be applied in other process industries also.

In this case study, initially likelihood function of the best-fitted distribution is optimized by GA and PSO. Reliability and maintainability of LHD machines evaluated by the traditional approach, GA and PSO are compared. These results will be very helpful for maintenance engineers to plan new maintenance strategies for better functioning of LHD machines.

The purpose of this paper is to cut down energy consumption and eliminate production waste on mixed-model assembly lines. Therefore, a supermarket integrated dynamic cyclic kitting system with the application of electric vehicles (EVs) is introduced. The system resorts to just-in-time (JIT) and segmented sub-line assignment strategies, with the objectives of minimizing line-side inventory and energy consumption.

Hybrid opposition-based learning and variable neighborhood search (HOVMQPSO), a multi-objective meta-heuristics algorithm based on quantum particle swarm optimization is proposed, which hybridizes opposition-based learning methodology as well as a variable neighborhood search mechanism. Such algorithm extends the search space and is capable of obtaining more high-quality solutions.

Computational experiments demonstrated the outstanding performance of HOVQMPSO in solving the proposed part-feeding problem over the two benchmark algorithms non-dominated sorting genetic algorithm-II and quantum-behaved multi-objective particle swarm optimization. Additionally, using modified real-life assembly data, case studies are carried out, which imply HOVQMPSO of having good stability and great competitiveness in scheduling problems.

The feeding problem is based on static settings in a stable manufacturing system with determined material requirements, without considering the occurrence of uncertain incidents. Current study contributes to assembly line feeding with EV assignment and could be modified to allow cooperation between EVs.

The dynamic cyclic kitting problem with sub-line assignment applying EVs and supermarkets is solved by an innovative HOVMQPSO, providing both novel part-feeding strategy and effective intelligent algorithm for industrial engineering.

The cost-oriented robotic assembly line balancing problem (cRALBP) has practical importance in real-life manufacturing scenarios. However, only a few studies tackle the cRALBP using exact methods or metaheuristics. This paper aims to propose a hybrid particle swarm optimization (PSO) combined with dynamic programming (DPPSO) to solve cRALBP type-I.

Two different encoding schemes are presented for comparison. In the frequently used Scheme 1, a full encoding of task permutations and robot allocations is adopted, and a relatively large search space is generated. DPSO1 and DPSO2 with the full encoding scheme are developed. To reduce the search space and concern promising solution regions, in Scheme 2, only task permutations are encoded, and DP is used to obtain the optimal robot sequence for a given task permutation in a polynomial time. DPPSO is proposed.

A set of instances is generated, and the numerical experiments indicate that DPPSO achieves a tradeoff between solution quality and computation time and outperforms existing algorithms in solution quality.

The contributions of this paper are three aspects. First, two different schemes of encoding are presented, and three PSO algorithms are developed for the purpose of comparison. Second, a novel updating mechanism of discrete PSO is adjusted to generate feasible task permutations for cRALBP. Finally, a set of instances is generated based on two cost parameters, then the performances of algorithms are systematically compared.

The purpose of the study is distributed generation planning in a radial delivery framework to identify an appropriate location with a suitable rating of DG units energized by renewable energy resources to scale back the power loss and to recover the voltage levels. Though several algorithms have already been proposed through the target of power loss reduction and voltage stability enhancement, further optimization of the objectives is improved by using a combination of heuristic algorithms like DE and particle swarm optimization (PSO).

The identification of the candidate buses for the location of DG units and optimal rating of DG units is found by a combined differential evolution (DE) and PSO algorithm. In the combined strategy of DE and PSO, the key merits of both algorithms are combined. The DE algorithm prevents the individuals from getting trapped into the local optimum, thereby providing efficient global optimization. At the same time, PSO provides a fast convergence rate by providing the best particle among the entire iteration to obtain the best fitness value.

The proposed DE-PSO takes advantage of the global optimization of DE and the convergence rate of PSO. The different case studies of multiple DG types are carried out for the suggested procedure for the 33- and 69-bus radial delivery frameworks and a real 16-bus distribution substation in Tamil Nadu to show the effectiveness of the proposed methodology and distribution system performance. From the obtained results, there is a substantial decrease in the power loss and an improvement of voltage levels across all the buses of the system, thereby maintaining the distribution system within the framework of system operation and safety constraints.

A comparison of an equivalent system with the DE, PSO algorithm when used separately and other algorithms available in literature shows that the proposed method results in an improved performance in terms of the convergence rate and objective function values. Finally, an economic benefit analysis is performed if a photo-voltaic based DG unit is allocated in the considered test systems.

This paper aims to focus on the inclusion of the frequency behavior of grounding system effect on surge arrester (SA) model parameters’ estimation.

The grounding system impedance and its frequency behavior are the factors that have influence on the SA performance. Up to now, the grounding system impedance effect and the frequency behavior of the soil parameters have not been studied for the estimation of the parameters of the SA frequency-dependent model. In this paper, the grounding system’s influence on the SA dynamic model has been simulated for rod- and counterpoise-shaped electrodes. Particle swarm optimization with a grey wolf optimization algorithm has been implemented as an optimization algorithm to adjust the parameters of the SA dynamic model.

The results show that the frequency behavior of the grounding impedance and soil electrical parameters can impress the optimum parameters of the SA frequency-dependent model and should be considered for more reliable results. Also, the results evidence that the proposed optimization method provides more accurate results compared to other optimization methods.

To the best of the authors’ knowledge, this work is one of the first attempts to investigate the effect of frequency grounding system on SA frequency-dependent model parameters.

In this study, the central objective is to foresee stock market signals with the use of a proper structure to achieve the highest accuracy possible. For this purpose, three hybrid models have been developed for the stock markets which are a combination of support vector machine (SVM) with meta-heuristic algorithms of particle swarm optimization (PSO), imperialist competition algorithm (ICA) and genetic algorithm (GA).All the analyses are technical and are based on the Japanese candlestick model.

Further as per the results achieved, the most suitable algorithm is chosen to anticipate sell and buy signals. Moreover, the authors have compared the results of the designed model validations in this study with basic models in three articles conducted in the past years. Therefore, SVM is examined by PSO. It is used as a classification agent to search the problem-solving space precisely and at a faster pace. With regards to the second model, SVM and ICA are tested to stock market timing, in a way that ICA is used as an optimization agent for the SVM parameters. At last, in the third model, SVM and GA are studied, where GA acts as an optimizer and feature selection agent.

As per the results, it is observed that all new models can predict accurately for only 6 days; however, in comparison with the confusion matrix results, it is observed that the SVM-GA and SVM-ICA models have correctly predicted more sell signals, and the SCM-PSO model has correctly predicted more buy signals. However, SVM-ICA has shown better performance than other models considering executing the implemented models.

In this study, the data for stock market of the years 2013–2021 were analyzed; the long length of timeframe makes the input data analysis challenging as they must be moderated with respect to the conditions where they have been changed.

In this study, two methods have been developed in a candlestick model; they are raw-based and signal-based approaches in which the hit rate is determined by the percentage of correct evaluations of the stock market for a 16-day period.