The identification of parameters in solar cell models is still a major challenge in photovoltaic (PV) system simulation and design. Because of its more basic ideas, efficiency, adaptability, swarm and evolutionary optimization algorithms, as well as simple procedural frameworks, have been generally used in industry with real-world problems. However, due to the nonlinearity and complication of the PV parameter identification, the obtained solutions from swarm and evolutionary optimizers were immature. An efficient metaheuristic approach for identifying PV model parameters based on the salp swarm algorithm (SSA) is presented in this paper. In the suggested modified salp swarm optimization (MSSA), the leaders and followers will be updated based on the new formulas. The algorithm’s exploration potential is increased by this modification while also preventing it from converge prematurely. The behavior of the suggested technique is verified using benchmark functions, and the outcomes are contrasted with those of SSA and other successful optimization approaches. The suggested MSSA detects numerous characteristics in the PV model include single diode, double diode, and PV modules, in the most efficient way possible. According to the simulation results, MSSA outperforms the competition and may produce better optimal solutions. The findings demonstrate that the best value of RMSE obtained by MSSA is up to 69 percent lower than other methods and is nearly 5.6 percent lower than that assessed by SSA.

In this study, we evaluate several nongradient (evolutionary) search strategies for minimizing mathematical function expressions. We developed and tested the genetic algorithms, particle swarm optimization, and differential evolution in order to assess their general efficacy in optimization of mathematical equations. A comparison is then made between the results and the efficiency, which is determined by the number of iterations, the observed accuracy, and the overall run time. Additionally, the optimization employs 12 functions from Easom, Holder table, Michalewicz, Ackley, Rastrigin, Rosen, Rosen Brock, Shubert, Sphere, Schaffer, Himmelblaus, and Spring Force Vanderplaats. Furthermore, the crossover rate, mutation rate, and scaling factor are evaluated to determine the effectiveness of the following algorithms. According to the results of the comparison of optimization algorithms, the DE algorithm has the lowest time complexity of the others. Furthermore, GA demonstrated the greatest degree of temporal complexity. As a result, using the PSO method produces different results when repeating the same algorithm with low reliability in terms of locating the optimal location.

In this work, we propose a new family of continuous distributions with two shape parameters named the Extended Exponentiated type 2 (EE2-H). We study some basic properties including quantile function, mixture for cdf and pdf and order statistics .Then we study half-logistic distribution as a special case with more details. We study different methods of estimation and then we compare these methods with a simulation study. Finally, two real data sets show the capability of this model.