Parameter tuning of PVD process based on artificial intelligence technique

— In this paper, two optimization algorithms i.e., Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) are combined to produce a hybrid population-based algorithm PSOGSA. The approach of HPSOGSA is to use the assessment of PSO using the social thinking capability and the manipulation of GSA using the local search proficiency. To increase the performance of HPSOGSA, some benchmark functions are used. Two standard database ORL and YALE is used to assess the classification performance of the proposed method. Classification accuracy is compared for diverse number of training samples per class. Further lead of proposed method is confirmed by analyzing percentage improvement in classification accuracy. With limited accessibility of training sample, percentage enhancement is very successful for face recognition applications. Keywords: Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Particle Swarm Optimization and Gravitational Search Algorithm (PSOGSA), Hybrid Particle Swarm Optimization and Gravitational Search Algorithm (HPSOGSA). Cite this Article Purvaa Saxena, Gargi Mishra, Apoorva Aggarwal, Ayush Priyadarshi, Nitin Kumar, Rahul. Pattern Recognition Using Hybrid Meta-Heuristic. Journal of Artificial Intelligence Research & Advances. 2019; 6(2): 100–108p.

The history matching, a key step in the reservoir numerical simulation, is performed to obtain a set of appropriate reservoir parameters to match the modeling results with the oilfield historical production data. The history matching problem is solved conventionally with Gauss-Newton, L-M, BFGS, and LBFGS methods, which require calculation of the gradient of the objective function, and is very slow in solving large-scale problems. In recent years, modern optimization algorithms, such as the genetic algorithm, particle swarm optimization, and differential evolution algorithm, have been applied in the reservoir history matching. In this paper, the hybrid particle swarm optimization and gravitational search algorithm (PSOGSA) is used to carry out the research on the automatic reservoir history matching. First, the basic concepts of the particle swarm optimization (PSO) and the gravity search algorithm (GSA) were introduced. Then, the concept and algorithm of PSOGSA were described. Moreover, the actual oil field data were used to establish a geological model and an objective function, and the PSOGSA was used to carry out the automatic history matching. The PSOGSA was compared with other algorithms. Finally, the effects of parameters on the PSOGSA were analyzed. The results show that the PSOGSA has a good performance in the automatic reservoir history matching, increases the diversity of particles, improves the global search capability, and accelerates the convergence. The PSOGSA is superior to the PSO or the GSA.

Estimation of transformer parameters from nameplate data by imperialist competitive and gravitational search algorithms

Hybridization of Constriction Coefficient Based Particle Swarm Optimization and Gravitational Search Algorithm for Function Optimization

Particle swarm optimization (PSO) has been proven to show good performance for solving various optimization problems. However, it tends to suffer from premature stagnation and loses exploration ability in the later evolution period when solving complex problems. This paper presents a sequential hybrid particle swarm optimization and gravitational search algorithm with dependent random coefficients called HPSO-GSA, which first incorporates the gravitational search algorithm (GSA) with the PSO by means of a sequential operating mode and then adopts three learning strategies in the hybridization process to overcome the aforementioned problem. Specifically, the particles in the HPSO-GSA enter into the PSO stage and update their velocities by adopting the dependent random coefficients strategy to enhance the exploration ability. Then, the GSA is incorporated into the PSO by using fixed iteration interval cycle or adaptive evolution stagnation cycle strategies when the swarm drops into local optimum and fails to improve their fitness. To evaluate the effectiveness and feasibility of the proposed HPSO-GSA, the simulations were conducted on benchmark test functions. The results reveal that the HPSO-GSA exhibits superior performance in terms of accuracy, reliability, and efficiency compared to PSO, GSA, and other recently developed hybrid variants.

A good exploration ability can ensure that the method jumps out of local optimum in multimodal problems and a good exploitation can ensure an algorithm converge faster to global optimum values. So, this paper proposes a new hybrid sperm swarm optimization and genetic algorithm to obtain global optimal solutions termed HSSOGA which is developed based on the concept of balancing the exploration and exploitation capability by merging Sperm Swarm Optimization (SSO), which has a fast convergence rate, and a Genetic Algorithm (GA) that can explore a search domain efficiently. To ensure that the proposed method delivers good performance, it is evaluated with 11 standard test function problems consisting of 5 unimodal and 6 multimodal functions. The proposed HSSOGA set is compared with conventional GA and SSO methods, as well as with several hybrid methods such as Hybrid Firefly and Particle Swarm Optimization (HFPSO), hybrid Simulated Annealing and Genetic Algorithm (SAGA), Hybrid Particle Swarm Optimization and Genetic Algorithm (HFPSO), hybrid Particle Swarm Optimization and Grey Wolf Optimization (PSOGWO), and closely related Hybrid Sperm Swarm Optimization and Gravitational Search Algorithm (HSSOGSA). The results are evaluated in terms of each method’s best fitness, mean, standard deviation, and convergence rates. The numerical experiment results show that HSSOGA has better convergence towards the true global optimum values as compared to the conventional and existing hybrid methods in most unimodal and multimodal test function problems.

Power producers in a deregulated electricity market require a suitable strategy for bidding in order to maximize their benefit. Therefore, individual power supplier bids strategically for selecting coefficients of bid to oppose the strategy of rivals bidding. The oppositional learning based gravitational search algorithm (OGSA) is used in this paper to solve an optimal strategy of bidding problem. Gravitational search algorithm (GSA) is encouraged from mass interactions and law of gravity. In OGSA, opposite agents provide better optimal solutions compared to that of random agent solutions. The utilization of opposite agents in the evaluation process of GSA enables enhanced exploration of the search space. This prevents trapping of the search in local optimal solution and improves rate of convergence in GSA. The proposed method is tested on IEEE 30-bus system. The obtained results suggest that OGSA gives better solution in terms of profit as compared to other approaches such as Monte Carlo, Genetic Algorithm, Particle Swarm Optimization and Gravitational Search Algorithm.

This paper proposes a novel modelling and optimization approach for steady state and transient performance tune-up of an engine at idle speed. In terms of modelling, Latin hypercube sampling and multiple-input and multiple-output (MIMO) least-squares support vector machines (LS-SVMs) are proposed to build an engine idle-speed model based on experimental sample data. Then, a genetic algorithm (GA) and particle swarm optimization (PSO) are applied to obtain an optimal electronic control unit setting automatically, under various user-defined constraints. All of the above techniques mentioned are artificial intelligence techniques. To illustrate the advantages of the MIMO LS-SVM, a traditional multilayer feedforward neural network (MFN) is also applied to build the engine idle-speed model. The modelling accuracies of the MIMO LS-SVM and MFN are also compared. This study shows that the predicted results using the estimated model from the LS-SVM are in good agreement with the actual test results. Moreover, both the GA and PSO optimization results show an impressive improvement on idle-speed performance in a test engine. The optimization results also indicate that PSO is more efficient than the GA in an idle-speed control optimization problem based on the LS-SVM model. As the proposed methodology is generic, it can be applied to different engine modelling and control optimization problems.

Data clustering is a well-known data analysis technique for organizing unlabeled datapoints into clusters on the basis of similarity measures. The real-world applications of data clustering include bioinformatics, vector quantization, data mining, geographical information systems, pattern recognition, image processing, and wireless sensors. The data in a cluster are similar (minimizing the intra-cluster distance) and differ from the data in other clusters (maximizing the inter-cluster distance). The cluster problem has been proven to be NP-hard, but can be solved using meta-heuristic algorithms, such as ant colony optimization, genetic algorithms, gravitational search algorithm (GSA), and particle swarm optimization (PSO). This paper proposes a memetic clustering algorithm with efficient search and fast convergence, respectively, based on PSO and GSA, called the memetic particle gravitation optimization (MPGO) algorithm. The two main mechanisms of MPGO are hybrid operation and diversity enhancement. The former involves the exchange of individuals from two subpopulations after a predefined number of function evaluations (FEs), whereas the latter involves an enhancement operator, which is similar to the crossover process of differential evolution, for enhancing the diversity of each system. Individuals from the PSO and GSA systems are selected for the exchange of solutions by using the roulette-wheel approach. The performance of the proposed algorithm was evaluated on 52 benchmark test functions, six UCI machine learning benchmarks, and image segmentation of six well-known images. A comparison with existing algorithms verified the superior performance of the proposed algorithm in terms of a fitness value, an accuracy rate, and a peak signal-to-noise ratio.

The development of a novel hybrid algorithm (AOA) with the aid of simulated annealing technique is discussed in this paper. The novel algorithm, named modified arithmetic optimization algorithm (mAOA), is proposed as an effective tool for optimizing power system stabilizer (PSS) adopted in a single-machine infinite-bus power system. To perform the assessments, MATLAB/Simulink software was used. The evaluations on the proposed algorithm are initially performed using several benchmark functions that have unimodal and multimodal natures. The results are then compared with five of the other competitive approaches (arithmetic optimization algorithm, simulated annealing algorithm, genetic algorithm, particle swarm optimization and gravitational search algorithm). The comparisons with respect to those algorithms demonstrate the great promise of the constructed hybrid mAOA algorithm. This shows the greater balance between global and local search stages achieved by the mAOA algorithm. The performance of the developed mAOA algorithm is also assessed through designing an optimally performing PSS for further evaluation which allows the observation of its capability for complex real world engineering problems. To do so, PSS damping controller is formulated as an optimization problem and the constructed mAOA algorithm is used to search for optimal controller parameters to demonstrate the applicability and the greater performance of the proposed hybrid algorithm for such a complex real-world engineering problem. The obtained results for the latter case are compared with the sine-cosine and symbiotic organisms search algorithms as they are the best performing reported algorithms. The comparisons have demonstrated the superiority of the mAOA algorithm over reported best performing algorithms in terms of PSS design, as well.

<span>Membrane bioreactor employs an efficient filtration technology for solid and liquid separation in wastewater treatment process. Development of membrane filtration model is significant as this model can be used to predict filtration dynamic which is later utilized in control development. Most of the available models only suitable for monitoring purpose, which are too complex, required many variables and not suitable for control system design. This work focusing on the simple time seris model for membrane filtration process using neural network technique. In this paper, submerged membrane filtration model developed using recurrent neural network (RNN) train using genetic algorithm (GA), inertia weight particle swarm optimization (IW-PSO) and gravitational search algorithm (GSA). These optimization algorithms are compared in term of its accuracy and convergent speed in updating the weights and biases of the RNN for optimal filtration model. The evaluation of the models is measured using three performance evaluations, which are mean square error (MSE), mean absolute deviation (MAD) and coefficient of determination (R2). From the results obtained, all methods yield satisfactory result for the model, with the best results given by <br /> IW-PSO.</span>

Optimization algorithms are one of the effective stochastic methods in solving optimization problems. In this paper, a new swarm-based algorithm called Northern Goshawk Optimization (NGO) algorithm is presented that simulates the behavior of northern goshawk during prey hunting. This hunting strategy includes two phases of prey identification and the tail and chase process. The various steps of the proposed NGO algorithm are described and then its mathematical modeling is presented for use in solving optimization problems. The ability of NGO to solve optimization problems is evaluated on sixty-eight different objective functions. To analyze the quality of the results, the proposed NGO algorithm is compared with eight well-known algorithms, particle swarm optimization, genetic algorithm, teaching-learning based optimization, gravitational search algorithm, grey wolf optimizer, whale optimization algorithm, tunicate swarm algorithm, and marine predators algorithm. In addition, for further analysis, the proposed algorithm is also employed to solve four engineering design problems. The results of simulations and experiments show that the proposed NGO algorithm, by creating a proper balance between exploration and exploitation, has an effective performance in solving optimization problems and is much more competitive than similar algorithms.

Enhanced leader PSO (ELPSO): A new algorithm for allocating distributed TCSC’s in power systems

At present, optimization algorithms are used extensively. One particular type of such algorithms includes random-based heuristic population optimization algorithms, which may be created by modeling scientific phenomena, like, for example, physical processes. The present article proposes a novel optimization algorithm based on Hooke’s law, called the spring search algorithm (SSA), which aims to solve single-objective constrained optimization problems. In the SSA, search agents are weights joined through springs, which, as Hooke’s law states, possess a force that corresponds to its length. The mathematics behind the algorithm are presented in the text. In order to test its functionality, it is executed on 38 established benchmark test functions and weighed against eight other optimization algorithms: a genetic algorithm (GA), a gravitational search algorithm (GSA), a grasshopper optimization algorithm (GOA), particle swarm optimization (PSO), teaching–learning-based optimization (TLBO), a grey wolf optimizer (GWO), a spotted hyena optimizer (SHO), as well as an emperor penguin optimizer (EPO). To test the SSA’s usability, it is employed on five engineering optimization problems. The SSA delivered better fitting results than the other algorithms in unimodal objective function, multimodal objective functions, CEC 2015, in addition to the optimization problems in engineering.

In the present research, four meta-heuristic algorithms named Genetic Algorithm (GA), Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and Artificial Bee Colony (ABC) have been used for optimal design of cascade spillway to minimize the construction cost.Usually, the traditional design methods such as Vittal and Porey (VP) method or experimental modeling are used to solve this problem leading to infeasible or near optimal solution.The main novelty of this paper is to use effective methods to solve this complex highly constrained problem.Therefore, due to unique features of meta-heuristic algorithms, these algorithms are used here to minimize the construction cost of cascade spillway as the energy dissipater structure.As the case study, cascade spillway of Tehri dam in India had been chosen.The algorithms results have been compared together and with the VP results.Comparison of the results show the effectiveness and affectivity of these algorithms to solve this optimization problem.In other words, when three-stepped spillway are considered, the results are improved with 16.16%, 16.4%, 17.73% and 17.63% respectively using GA, GSA, PSO and ABC algorithms and in the same manner, for four-stepped spillway, the results are improved 14.5%, 16.1%, 16.45% and 16.05% respectively using GA, GSA, PSO and ABC algorithms in comparison with the VP results.