Comparison Of Meta-heuristic Optimization Algorithms Research Articles

Comparison of Meta-Heuristic Optimization Algorithms for Global Maximum Power Point Tracking of Partially Shaded Solar Photovoltaic Systems

Partial shading conditions lead to power mismatches among photovoltaic (PV) panels, resulting in the generation of multiple peak power points on the P-V curve. At this point, conventional MPPT algorithms fail to operate effectively. This research work mainly focuses on the exploration of performance optimization and harnessing more power during the partial shading environment of solar PV systems with a single-objective non-linear optimization problem subjected to different operations formulated and solved using recent metaheuristic algorithms such as Cat Swarm Optimization (CSO), Grey Wolf Optimization (GWO) and the proposed Chimp Optimization algorithm (ChOA). This research work is implemented on a test system with the help of MATLAB/SIMULINK, and the obtained results are discussed. From the overall results, the metaheuristic methods used by the trackers based on their analysis showed convergence towards the global Maximum Power Point (MPP). Additionally, the proposed ChOA technique shows improved performance over other existing algorithms.

Comparison of metaheuristic optimization algorithms for numerical solutions of optimal control problems

SummaryThe objective in optimal control problems is to determine the control rule to be applied according to the objective function determined for a given system. Theoretically, different solution methods have been developed starting from calculus of variation such as Pontriagin, Hamilton, or Riccati. In this study, apart from analytical methods, it is proposed to apply algorithms inspired by nature to the same problem. Among these algorithms, genetic algorithm, firefly algorithm, Harris Hawk's optimization algorithm, and differential evolution optimization algorithm have been applied to given optimal control problems and their successes were compared in terms of statistical analysis such as minimum, maximum, average, Wilcoxon, and Friedman analysis. The originality of this study is to control the system with discrete control rule by partitioning the control signal, to be applied to the system which is wanted to be optimally controlled. This will allow the control of different techniques, such as MPC or NMPC, which will contribute to the determination of the global optimum control rule, especially in the solution of nonlinear systems. In addition, three different applications have been performed to demonstrate. As a result of these experiments, it has been shown that these algorithms can be applied successfully to such problems.

Comparison of metaheuristic optimization algorithms with a new modified deb feasibility constraint handling technique

In this study, the modification of the Deb feasibility method is considered to solve the constrained optimization problems. In the developed modified Deb feasibility constraint method, the third rule in its procedure was revised in order to increase the performance of the Deb feasibility constraint handling method. The innovation in the method is based on generating a new individual by using both possible solutions that violate the constraints in the method used for solving the problem. In detail, discussions were given about the application and usefulness of six constrained handling techniques. Furthermore, genetic algorithm, particle swarm optimization, Harris hawks optimization, whale optimization algorithm, grey wolf optimization and sine cosine algorithms were applied to both various benchmark functions and also different engineering application problems such as pressure vessel design, welded beam design, speed reducer design and active filter design. Overall the experimental results show that modified Deb feasibility constraint handling technique is more robust and efficient than Deb feasibility technique and most of the other constraint handling techniques.

Comparison of metaheuristic optimization algorithms for solving constrained mechanical design optimization problems

Determining the solution for real mechanical design problems is a challenging task when using the newly developed and efficient swarm intelligence algorithms. There are so many difficulties to be addressed, including but not limited to mixed decision variables, diverse constraints, inherent errors, conflicting objectives, and numerous locally optimal solutions. This work analyzes the behavior of nine metaheuristic algorithms, namely, salp swarm algorithm (SSA), multi-verse optimizer (MVO), moth-flame optimizer (MFO), atom search optimization (ASO), ecogeography-based optimization (EBO), queuing search algorithm (QSA), equilibrium optimizer (EO), evolutionary strategy (ES) and hybrid self-adaptive orthogonal genetic algorithm (HSOGA). The efficiency of these algorithms is evaluated on eight mechanical design problems using the solution quality and convergence analysis, which verifies the wide applicability of these algorithms to real-world application problems.

A Comparison of Metaheuristic Optimization Algorithms for Scale Short-Form Development.

This study compares automated methods to develop short forms of psychometric scales. Obtaining a short form that has both adequate internal structure and strong validity with respect to relationships with other variables is difficult with traditional methods of short-form development. Metaheuristic algorithms can select items for short forms while optimizing on several validity criteria, such as adequate model fit, composite reliability, and relationship to external variables. Using a Monte Carlo simulation study, this study compared existing implementations of the ant colony optimization, Tabu search, and genetic algorithm to select short forms of scales, as well as a new implementation of the simulated annealing algorithm. Selection of short forms of scales with unidimensional, multidimensional, and bifactor structure were evaluated, with and without model misspecification and/or an external variable. The results showed that when the confirmatory factor analysis model of the full form of the scale was correctly specified or had only minor misspecification, the four algorithms produced short forms with good psychometric qualities that maintained the desired factor structure of the full scale. Major model misspecification resulted in worse performance for all algorithms, but including an external variable only had minor effects on results. The simulated annealing algorithm showed the best overall performance as well as robustness to model misspecification, while the genetic algorithm produced short forms with worse fit than the other algorithms under conditions with model misspecification.

Comparison of metaheuristic optimization algorithms for dimensional synthesis of a spherical parallel manipulator

It is well known that the performance of parallel manipulators is highly dependent on their geometry, therefore the dimensional synthesis plays an important role in the design of a manipulator. In this work, the dimensional synthesis of a spherical parallel manipulator is carried out by means of a multi-objective optimization. This manipulator is planned to be a prosthetic wrist. The considered objective functions were the dexterity, the variability of the dexterity, the maximum required torque and the stiffness. The optimization was performed using three different metaheuristic algorithms: NSGA-II, OMOPSO, MOEA/D. After performing a set of simulations, the results show a clearly better performance of the MOEA/D algorithm. The optimized geometry of the manipulator allowed to design a virtual prototype of a prosthetic wrist.