Optimality Test cases of Particle Swarm optimization of single objective functions

Autor: G.Lakshmi Kameswari
Jazyk: angličtina
Rok vydání: 2020
Předmět:
DOI: 10.5281/zenodo.4010485
Popis: Optimization problems are classified into continuous, discrete, constrained, unconstrained deterministic, stochastic, single objective and multi-objective optimization problems. Deterministic, Heuristics and Meta-Heuristic technique, mostly dominate the solution set of small and medium scale problems, whereas for large data class optimization problems, Evolutionary techniques ( mostly derivative -free) are used to address the near -optimal solution of these class of P, N-P, N-P Hard problems. In the present paper, evolutionary algorithmic approach without evolutionary operators, mimicking the biology of swarms, with artificial intelligence is introduced. The above search technique is called Particle swarm optimization (PSO) method, used in solving many N-P hard problems with respect to position, and velocity vector approach for random search to obtain near optimal solution. The method is discussed in detail with flow chart and various optimization benchmark problems of single objective function are solved using the developed PSO Code and compared with global minima of benchmark problems.
{"references":["Dorigo, M., Birattari, M., & Stutzle, T. (2006). Ant colony optimization. IEEE computational intelligence magazine, 1(4), 28-39.","Chi, R., Su, Y. X., Zhang, D. H., Chi, X. X., & Zhang, H. J. (2019). A hybridization of cuckoo search and particle swarm optimization for solving optimization problems. Neural Computing and Applications, 31(1), 653-670.","Kennedy, J., & Eberhart, R. (1995, November). Particle swarm optimization. In Proceedings of ICNN'95-International Conference on Neural Networks (Vol. 4, pp. 1942-1948). IEEE.","Bashir, L. Z., & Hasan, R. S. M. (2015). Solving Banana (Rosenbrock) Function based on fitness function. World Scientific News, 12, 41-56.","Seredynski, F., Zomaya, A. Y., & Bouvry, P. (2003). Function optimization with coevolutionary algorithms. In Intelligent Information Processing and Web Mining (pp. 13-22). Springer, Berlin, Heidelberg.","Molga, M., & Smutnicki, C. (2005). Test functions for optimization needs. Test functions for optimization needs, 101, 48.","Valdez, F., Melin, P., & Castillo, O. (2007). Evolutionary Computing for the Optimization of Mathematical functions. In Analysis and Design of Intelligent Systems Using Soft Computing Techniques (pp. 463-472). Springer, Berlin, Heidelberg.","Beale, E. M. (1955). On minimizing a convex function subject to linear inequalities. Journal of the Royal Statistical Society: Series B (Methodological), 17(2), 173-184.","Hendtlass, T. (2001, June). A combined swarm differential evolution algorithm for optimization problems. In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (pp. 11-18). Springer, Berlin, Heidelberg.","Das, P. (2016). Black-box optimization on hyper-rectangle using recursive modified pattern search and application to matrix completion problem with non-convex regularization. arXiv arxiv. org/pdf/1604.08616. pdf."]}
Databáze: OpenAIRE
Externí odkaz: