1
|
Dehghani M, Trojovský P. Serval Optimization Algorithm: A New Bio-Inspired Approach for Solving Optimization Problems. Biomimetics (Basel) 2022; 7:204. [PMID: 36412732 PMCID: PMC9703967 DOI: 10.3390/biomimetics7040204] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/30/2022] [Revised: 11/14/2022] [Accepted: 11/16/2022] [Indexed: 07/23/2023] Open
Abstract
This article introduces a new metaheuristic algorithm called the Serval Optimization Algorithm (SOA), which imitates the natural behavior of serval in nature. The fundamental inspiration of SOA is the serval's hunting strategy, which attacks the selected prey and then hunts the prey in a chasing process. The steps of SOA implementation in two phases of exploration and exploitation are mathematically modeled. The capability of SOA in solving optimization problems is challenged in the optimization of thirty-nine standard benchmark functions from the CEC 2017 test suite and CEC 2019 test suite. The proposed SOA approach is compared with the performance of twelve well-known metaheuristic algorithms to evaluate further. The optimization results show that the proposed SOA approach, due to the appropriate balancing exploration and exploitation, is provided better solutions for most of the mentioned benchmark functions and has superior performance compared to competing algorithms. SOA implementation on the CEC 2011 test suite and four engineering design challenges shows the high efficiency of the proposed approach in handling real-world optimization applications.
Collapse
|
2
|
Evaluation of the Quality of Football Teaching in Colleges and Universities Based on Artificial Neural Networks. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:8001252. [PMID: 35669641 PMCID: PMC9166992 DOI: 10.1155/2022/8001252] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/11/2022] [Revised: 03/29/2022] [Accepted: 04/08/2022] [Indexed: 11/30/2022]
Abstract
Every country is developing under the concept of artificial intelligence. Many countries are already working on student monitoring systems that allow them to control the student's mentality and analyze each student's behavior with the help of a wireless headband. There is certain high-tech education within the country in a maximum number of schools, which can be considered robotic monetization. With the help of tiny robots inside the classrooms, each student's activeness and engagement level in the classes are captured and submitted to the teacher. All these practical applications help us imagine that there will be a massive response to artificial intelligence in the future of this world. On the other hand, sports management is a critical issue to consider for the country's growth. This research evaluates the quality of football teaching by implementing an Artificial Neural Network model for online mode of education. The proposed model functions with the implementation of Association Rule Mining (ARM) in the intelligent system to monitor the activities of the player by training with the Artificial Neural Network (ANN). The proposed model is compared with the existing K-Mean algorithm, and it is observed that the proposed model has achieved an accurate evaluation of 99.6%.
Collapse
|
3
|
Dehghani M, Hubálovský Š, Trojovský P. A new optimization algorithm based on average and subtraction of the best and worst members of the population for solving various optimization problems. PeerJ Comput Sci 2022; 8:e910. [PMID: 35494852 PMCID: PMC9044275 DOI: 10.7717/peerj-cs.910] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/18/2021] [Accepted: 02/10/2022] [Indexed: 06/14/2023]
Abstract
In this paper, a novel evolutionary-based method, called Average and Subtraction-Based Optimizer (ASBO), is presented to attain suitable quasi-optimal solutions for various optimization problems. The core idea in the design of the ASBO is to use the average information and the subtraction of the best and worst population members for guiding the algorithm population in the problem search space. The proposed ASBO is mathematically modeled with the ability to solve optimization problems. Twenty-three test functions, including unimodal and multimodal functions, have been employed to evaluate ASBO's performance in effectively solving optimization problems. The optimization results of the unimodal functions, which have only one main peak, show the high ASBO's exploitation power in converging towards global optima. In addition, the optimization results of the high-dimensional multimodal functions and fixed-dimensional multimodal functions, which have several peaks and local optima, indicate the high exploration power of ASBO in accurately searching the problem-solving space and not getting stuck in nonoptimal peaks. The simulation results show the proper balance between exploration and exploitation in ASBO in order to discover and present the optimal solution. In addition, the results obtained from the implementation of ASBO in optimizing these objective functions are analyzed compared with the results of nine well-known metaheuristic algorithms. Analysis of the optimization results obtained from ASBO against the performance of the nine compared algorithms indicates the superiority and competitiveness of the proposed algorithm in providing more appropriate solutions.
Collapse
Affiliation(s)
- Mohammad Dehghani
- Department of Mathematics/Faculty of Science, University of Hradec Králové, Hradec Kralove, Czech Republic
| | - Štěpán Hubálovský
- Department of Applied Cybernetics/Faculty of Science, University of Hradec Králové, Hradec Kralove, Czech Republic
| | - Pavel Trojovský
- Department of Mathematics/Faculty of Science, University of Hradec Králové, Hradec Kralove, Czech Republic
| |
Collapse
|
4
|
Upadhyay P, Pandey MK, Kohli N. Mining periodic patterns from spatio-temporal trajectories using FGO-based artificial neural network optimization model. Neural Comput Appl 2022. [DOI: 10.1007/s00521-021-06596-1] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/01/2022]
|
5
|
Pelican Optimization Algorithm: A Novel Nature-Inspired Algorithm for Engineering Applications. SENSORS 2022; 22:s22030855. [PMID: 35161600 PMCID: PMC8838090 DOI: 10.3390/s22030855] [Citation(s) in RCA: 48] [Impact Index Per Article: 24.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 12/29/2021] [Revised: 01/15/2022] [Accepted: 01/21/2022] [Indexed: 12/01/2022]
Abstract
Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems.
Collapse
|
6
|
|
7
|
Dehghani M, Hubálovský Š, Trojovský P. Cat and Mouse Based Optimizer: A New Nature-Inspired Optimization Algorithm. SENSORS 2021; 21:s21155214. [PMID: 34372450 PMCID: PMC8348201 DOI: 10.3390/s21155214] [Citation(s) in RCA: 19] [Impact Index Per Article: 6.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 07/04/2021] [Revised: 07/22/2021] [Accepted: 07/29/2021] [Indexed: 11/16/2022]
Abstract
Numerous optimization problems designed in different branches of science and the real world must be solved using appropriate techniques. Population-based optimization algorithms are some of the most important and practical techniques for solving optimization problems. In this paper, a new optimization algorithm called the Cat and Mouse-Based Optimizer (CMBO) is presented that mimics the natural behavior between cats and mice. In the proposed CMBO, the movement of cats towards mice as well as the escape of mice towards havens is simulated. Mathematical modeling and formulation of the proposed CMBO for implementation on optimization problems are presented. The performance of the CMBO is evaluated on a standard set of objective functions of three different types including unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. The results of optimization of objective functions show that the proposed CMBO has a good ability to solve various optimization problems. Moreover, the optimization results obtained from the CMBO are compared with the performance of nine other well-known algorithms including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching-Learning-Based Optimization (TLBO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Marine Predators Algorithm (MPA), Tunicate Swarm Algorithm (TSA), and Teamwork Optimization Algorithm (TOA). The performance analysis of the proposed CMBO against the compared algorithms shows that CMBO is much more competitive than other algorithms by providing more suitable quasi-optimal solutions that are closer to the global optimal.
Collapse
Affiliation(s)
- Mohammad Dehghani
- Department of Mathematics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic;
| | - Štěpán Hubálovský
- Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic;
| | - Pavel Trojovský
- Department of Mathematics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic;
- Correspondence: ; Tel.: +420-49-333-2860
| |
Collapse
|
8
|
Abstract
Optimization problems in various fields of science and engineering should be solved using appropriate methods. Stochastic search-based optimization algorithms are a widely used approach for solving optimization problems. In this paper, a new optimization algorithm called “the good, the bad, and the ugly” optimizer (GBUO) is introduced, based on the effect of three members of the population on the population updates. In the proposed GBUO, the algorithm population moves towards the good member and avoids the bad member. In the proposed algorithm, a new member called ugly member is also introduced, which plays an essential role in updating the population. In a challenging move, the ugly member leads the population to situations contrary to society’s movement. GBUO is mathematically modeled, and its equations are presented. GBUO is implemented on a set of twenty-three standard objective functions to evaluate the proposed optimizer’s performance for solving optimization problems. The mentioned standard objective functions can be classified into three groups: unimodal, multimodal with high-dimension, and multimodal with fixed dimension functions. There was a further analysis carried-out for eight well-known optimization algorithms. The simulation results show that the proposed algorithm has a good performance in solving different optimization problems models and is superior to the mentioned optimization algorithms.
Collapse
|
9
|
Binary Spring Search Algorithm for Solving Various Optimization Problems. APPLIED SCIENCES-BASEL 2021. [DOI: 10.3390/app11031286] [Citation(s) in RCA: 18] [Impact Index Per Article: 6.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.
Collapse
|
10
|
Abstract
In recent decades, many optimization algorithms have been proposed by researchers to solve optimization problems in various branches of science. Optimization algorithms are designed based on various phenomena in nature, the laws of physics, the rules of individual and group games, the behaviors of animals, plants and other living things. Implementation of optimization algorithms on some objective functions has been successful and in others has led to failure. Improving the optimization process and adding modification phases to the optimization algorithms can lead to more acceptable and appropriate solution. In this paper, a new method called Dehghani method (DM) is introduced to improve optimization algorithms. DM effects on the location of the best member of the population using information of population location. In fact, DM shows that all members of a population, even the worst one, can contribute to the development of the population. DM has been mathematically modeled and its effect has been investigated on several optimization algorithms including: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching-learning-based optimization (TLBO), and grey wolf optimizer (GWO). In order to evaluate the ability of the proposed method to improve the performance of optimization algorithms, the mentioned algorithms have been implemented in both version of original and improved by DM on a set of twenty-three standard objective functions. The simulation results show that the modified optimization algorithms with DM provide more acceptable and competitive performance than the original versions in solving optimization problems.
Collapse
|
11
|
A Spring Search Algorithm Applied to Engineering Optimization Problems. APPLIED SCIENCES-BASEL 2020. [DOI: 10.3390/app10186173] [Citation(s) in RCA: 41] [Impact Index Per Article: 10.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
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.
Collapse
|