Search

Particle Swarm Optimization (PSO) provides a metaheuristic optimization technique for real-life functions with complex behavior. Inspired by the metaphor of social behavior as exhibited by swarms operating in natural surroundings, the algorithm captures the Emergent Complexity demonstrated by individual components of large groups which work together using simple rules and create complex, yet efficient, adaptive, and self-organizing systems. The paper seeks to rigorously analyze the hyperparameters of the algorithm to find the relative importance of cognitive(personal) vis-à-vis social (swarm) parameters of the algorithm so as to gain a perfect understanding of the importance of exploitation versus exploration parameters thus enabling us to enhance the application efficiency of the algorithm. The paper further suggests and applies a rolling coefficient updating technique to the algorithm parameters so as to use a formal statistical procedure in the initialization and subsequent iterations for updating coefficients rather than leaving it on trial and error or on a practitioner's knowledge. Results suggest that the technique employed provides an enhancement in the efficiency of the algorithm by creating a dynamic Emergent Complexity environment. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm which is mathematically modelled by amalgamating the superior features of recently developed Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), and Crow Search Algorithm (CSA). Researchers have already implemented the aforementioned three algorithms and obtained superior quality results for solving diverse optimization problems. The novel hybrid Variegated GWO Algorithm (VGWO) developed in this proposed research work is initially realized and validated for solving IEEE CEC-C06 2019 benchmark functions. Thereafter, the proposed VGWO is utilized as an optimization tool to solve three emerging and complex power system optimization problems which includes energy management of microgrid systems operated in both islanded and grid-connected mode, dynamic economic emission dispatch and reactive power planning (RPP) problem. A comparative analysis of the proposed VGWO approach with other established metaheuristics is undertaken for each optimization problem. Numerical results show that the novel hybrid VGWO algorithm outperformed an ample number of optimization techniques in providing better quality solutions. The proposed hybrid algorithm yielded a 36.93% reduction in active power loss and 36.80% reduction in operating cost with respect to base case condition for RPP problem. Likewise while solving microgrid energy management problems 9–30% savings was realized in the generation cost compared to the ones mentioned in literature. The capability of handling many complex constraints within a minimum amount of computational time to provide consistently best solutions prioritize the proposed hybrid algorithm among its kinds. Statistical analysis validates the authenticity and viability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper mainly focuses on the optimal design of a grid-dependent and off-grid hybrid renewable energy system (RES). This system consists of Photovoltaic (PV), Wind Turbine (WT) as well as Fuel Cell (FC) with hydrogen gas tank for storing the energy in the chemical form. The optimal components sizes of the proposed hybrid generating system are achieved using a novel metaheuristic optimization technique. This optimization technique, called Improved Artificial Ecosystem Optimization (IAEO), is proposed for enhancing the performance of the conventional Artificial Ecosystem Optimization (AEO) algorithm. The IAEO improves the convergence trends of the original AEO, gives the best minimum objective function, reaches the optimal solution after a few iterations numbers as well as reduces the falling into the local optima. The proposed IAEO algorithm for solving the multiobjective optimization problem of minimizing the Cost of Energy (COE), the reliability index presented by the Loss of Power Supply Probability (LPSP), and excess energy under the constraints are considered. The hybrid system is suggested to be located in Ataka region, Suez Gulf (latitude 30.0, longitude 32.5), Egypt, and the whole lifetime of the suggested case study is 25 years. To ensure the accurateness, stability, and robustness of the proposed optimization algorithm, it is examined on six different configurations, representing on-grid and off-grid hybrid RES. For all the studied cases the proposed IAEO algorithm outperforms the original AEO and generates the minimum value of the fitness function in less execution time. Furthermore, comprehensive statistical measurements are demonstrated to prove the effectiveness of the proposed algorithm. Also, the results obtained by the conventional AEO and IAEO are compared with those obtained by several well-known optimization algorithms, Particle Swarm Optimization (PSO), Salp Swarm Algorithm (SSA), and Grey Wolf Optimizer (GWO). Based on the obtained simulation results, the proposed IAEO has the best performance among other algorithms and it has successfully positioned itself as a competitor to novel algorithms for tackling the most complicated engineering problems. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization methods have been implemented for solving several problems. However, when it is required to implement those algorithms in hardware to run online, there is not enough information. This paper describes how could be programmed and implemented those optimization algorithms. Moreover, a complete evaluation is shown as well as a comparative study regarding the most important metaheuristic optimization algorithms. Thus, this paper presents a comparison between five optimization algorithms implemented into a cRIO field-programmable gate array (LabVIEW FPGA) NI-9030 of National Instruments T M (NI). The algorithms implemented were particle swarm optimization (PSO), bat algorithm (BA), grey wolf optimizer (GWO), earthquake algorithm (EA), and Nelder–Mead algorithm (NM). To analyze hardware device utilization and execution time by each algorithm, synthesis results were presented. In addition, a set of ten benchmark functions was selected to compare performance between algorithms. Results show the feasibility of this approach for NI FPGA hardware. From device utilization results, GWO presents the lowest placed usage (29%) while NM shows the fastest execution time (0.683 ms). Nevertheless, PSO, GWO and EA show better performance between benchmark functions due their exploration characteristics which make possible to find a better solution. [Display omitted] • Information about optimization implementation in hardware to run online is not enough • A hardware implementation of five optimization algorithms is described. • Five optimization algorithms were implemented into a cRIO LabVIEW FPGA. • Complete and comparative studies of those optimization algorithms are presented. • EA and GWO optimization algorithms are first time implemented into a FPGA. [ABSTRACT FROM AUTHOR]

• The path planning and path smoothing are combined through the high-order continuous Bezier curve. • An improved QPSO that incorporates two search mechanisms from bald eagle search (BES) is proposed. • The concept of semi-randomization is infused in some of our modifications in BES-MQPSO. • Enhanced intensive exploitation is performed by incorporating BES search and swoop mechanisms. • It may be the first time to apply BES tricks to help to enhance QPSO and into the path planning field. The design of path planning algorithms to obtain a smooth path that satisfies constraints such as obstacle avoidance, minimized cost, and dynamic feasibility for mobile robots in the workspace is a hot issue in the field of intelligent robotics. The metaheuristic optimization algorithm, which aims to solve path planning problems, is more efficient compared to traditional algorithms. In the current metaheuristic approaches, avoiding local minimum traps is the core goal of the scheme. In this paper, with the benefit of a high-order continuous Bezier curve, we construct an optimization problem of smooth path planning based on the length and the requirement of collision-free safety as constraints of the robot's expected path. Then, the smooth path planning problem is transformed into an optimization problem that searches the locations of control nodes of the Bezier curve. We solve the constructed path planning problem with our modified quantum particle swarm optimization algorithm (QPSO). Specifically, to overcome the shortcomings of the current PSO and QPSO-based particle swarm algorithms like prematurity, unbalanced global search, local exploitation, and local minima, we implement an improved QPSO algorithm denoted as BES-MQPSO that incorporates the search and swoop mechanisms from bald eagle search (BES) strategies. The method consists of four improved modifications: an improved local attractor, improved feature length, BES-enhanced intensive exploitation Strategy, and random variation mechanism. Our proposed BES-MQPSO with these four modifications is tested with benchmark functions and then applied to the smooth path planning problem. Finally, the superiority of BES-MQPSO is confirmed, and the ideal smooth path of the mobile robot is successfully planned. The planned path length is reduced by 4.45% and 2.82% compared to e-QPSO and SDEQPSO respectively, while the standard deviation is reduced by 67.46% and 69.82%, respectively. [ABSTRACT FROM AUTHOR]

• We integrate a PSO with a NN and ERNN to form PSO-NN and PSO-ERNN metaheuristic models. • The PSO trains the NN and ERNN to achieve faster convergence and avoid local minima. • The PSO-NN and PSO-ERNN models are evaluated using ten benchmark classification datasets. • The accuracy and computational efficiency of the models are improved. • The PSO-ERNN model outperforms the PSO-NN model for most of the tested datasets. There are several types of neural networks (NNs) that are widely used for data classification tasks. The supervised learning NN is an advanced network with a training algorithm for setting the weights and biases of the network in its training phase. However, traditional training algorithms such as backpropagation have some drawbacks, such as slow convergence speed and falling into local minima, which reduces the performance of the classifier. Therefore, different nature-inspired metaheuristic algorithms are integrated with the NN training algorithms to provide derivative-free solutions for complex classification problems. Consequently, this paper proposes the integration of a particle swarm optimization (PSO) algorithm with an improved Elman recurrent neural network (ERNN) to form a PSO-ERNN metaheuristic model. The key contribution of this study is the development of a new dimensional equation for ERNN architecture and the integration of PSO in ERNN learning to produce the PSO-ERNN model. The PSO is constructed to train the NN and ERNN models to achieve a fast convergence rate and avoid local minima problems. The PSO-ERNN model is validated by comparing it against the standard PSO-NN metaheuristic model and similar models from the literature. The PSO-NN and PSO-ERNN models are tested and evaluated using ten benchmark classification problems of breast cancer, heart, hepatitis, liver, wine, iris, lung cancer, yeast, Pima Indians diabetes, and ionosphere datasets. In the training phase, the results show that the PSO-ERNN model performs better than the PSO-NN model when the training set has a bigger size of samples. In the testing phase, the PSO-ERNN model outperforms the PSO-NN model for all the tested datasets except the lung cancer and yeast datasets, in which the accuracy percentage slightly decreases. In the validation phase, the PSO-ERNN model shows better performance quality in terms of accuracy percentage in six of the tested datasets. The average percentage of the training, testing, and validation accumulation show that the PSO-NN performs better than the PSO-ERNN in the lung cancer (87.27, 83.32), and heart (73.56, 70.64) datasets. On the other hand, the PSO-ERNN performs better than the PSO-NN in the iris (88.18, 86.74), hepatitis (88.60, 87.93), wine (89.16, 86.08), liver (73.56, 70.64), ionosphere (83.98, 78.94), and breast cancer (94.84, 91.17). PSO-NN and PSO-ERNN produce the same average results in the Pima Indians diabetes (84.00, 84.00) and yeast (91.31, 91.30) dataset. These results show clearly that the PSO-ERNN generally outperforms the PSO-NN when considering the overall results of the ten datasets. Nevertheless, the combinations of the PSO-NN and PSO-ERNN are proven to represent consistent and robust classification methods. The computational efficiencies of the training processes in both the PSO-NN and PSO-ERNN models are highly improved when coupled with the PSO. [ABSTRACT FROM AUTHOR]

This paper considers a variant of the classical capacitated vehicle routing problem called clustered vehicle routing problem (CluVRP). In CluVRP, customers are grouped into different clusters. A vehicle visiting a cluster cannot leave the cluster until all customers in the same cluster have been served. Each cluster and customer have to be served only once. A new hybrid metaheuristic, combining the particle swarm optimization (PSO) and variable neighborhood search (VNS) for the specific problem, is proposed to solve the CluVRP. In the hybrid PSO, the basic PSO principle ensures the solution diversity and VNS ensures solution intensity to bring the solution to the local optima. Extensive computational experiments have been performed on numerous benchmark instances with various sizes obtained from the CluVRP literature to evaluate the performance of the proposed hybrid PSO. The obtained results of the proposed algorithm are compared with the results found in the literature to validate the effectiveness of the proposed hybrid PSO. The proposed algorithm is proven to be superior to the state-of-the-art algorithms on the CluVRP. The proposed algorithm obtains 138 new best-known solutions among the 293 benchmark instances. • A variant of the CVRP called clustered vehicle routing problem is considered. • A new hybrid PSO metaheuristic is proposed. • Computational experiments are performed on benchmark instances with various sizes. • The new best-known solutions for a total of 138 instances are obtained. • The proposed algorithm shows the great implication in many practical scenarios. [ABSTRACT FROM AUTHOR]

Recent advances in metaheuristics have shown the advantages of using the Lévy distribution, which models a kind of random walk (named "Lévy flight") with occasional "big" steps. This characteristic makes Lévy flight especially useful for performing large "jumps" that allow the search to escape from a local optimum and restart in a different region of the search space. In this paper, we investigate this idea by applying Lévy flight to Jaya, a simple yet effective Swarm Intelligence optimization algorithm recently proposed in the literature. We perform experiments on the CEC 2014 benchmark as well as five industrial optimization problems taken from the CEC 2011 benchmark, and compare the performance of the proposed Lévy flight Jaya Algorithm (LJA) against several state-of-the-art algorithms for continuous optimization. Our numerical results show that, although both Jaya and LJA are in general less efficient than the most advanced algorithms on the CEC 2014 benchmark, LJA largely outperforms the original Jaya algorithm in most cases, and is also highly competitive on the tested industrial problems. • We present the Lévy flight Jaya Algorithm (LJA) for continuous optimization. • We evaluate the effect of the β parameter on LJA. • LJA consistently outperforms the original Jaya on most optimization problems. • We compare LJA with state-of-the-art algorithms on benchmark/industrial problems. [ABSTRACT FROM AUTHOR]