Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.
Advertisement
Scientific Reports volume 12, Article number: 17319 (2022)
Metrics details
This paper presents the data description of the African buffalo optimization algorithm (ABO). ABO is a recently-designed optimization algorithm that is inspired by the migrant behaviour of African buffalos in the vast African landscape. Organizing their large herds that could be over a thousand buffalos using just two principal sounds, the /maaa/ and the /waaa/ calls present a good foundation for the development of an optimization algorithm. Since elaborate descriptions of the manual workings of optimization algorithms are rare in literature, this paper aims at solving this problem, hence it is our main contribution. It is our belief that elaborate manual description of the workings of optimization algorithms make it user-friendly and encourage reproducibility of the experimental procedures performed using this algorithm. Again, our ability to describe the algorithm’s basic flow, stochastic and data generation processes in a language so simple that any non-expert can appreciate and use as well as the practical implementation of the popular benchmark Rosenbrock and Shekel Foxhole functions with the novel algorithm will assist the research community in benefiting maximally from the contributions of this novel algorithm. Finally, benchmarking the good experimental output of the ABO with those of the popular, highly effective and efficient Cuckoo Search and Flower Pollination Algorithm underscores the ABO as a worthy contribution to the existing body of population-based optimization algorithms
The obvious contributions of optimization to ensuring efficiency and effectiveness of industrial and engineering processes have led to the popularity of optimization as an indispensable subfield in artificial intelligence, computer science and engineering fields of study. Optimization has been described as the economics of science and engineering1. This definition is apt because optimization is concerned with the minimization of inputs in order to obtain maximum possible yield. It finds relevance in basically all aspects of science and engineering. In industrial production, for instance, manufacturing and process engineers are concerned with the optimization of available resources (raw materials, industrial machines, human resources and time) in order to yield the greatest number of finished products of acceptable quality2. Optimization continues even to the distribution of such finished products. The transportation of the finished products to the distributors, customers and end-users should be done in a way that will maximally benefit the organization in terms of time and cost. Even at the level of end-users, optimization is required by the consuming organizations cum individuals in their use of the finished products to meet their organizational/individual needs. From the foregoing discussion, the need for optimization cannot be over-emphasized3.
This overbearing influence of optimization has led to the development of several optimization algorithms in an attempt to improve the optimization procedures. Some of the popular optimization algorithms in literature include Genetic Algorithm, Particle Swarm Optimization, Sine-Cosine optimization algorithm4, Simulated Annealing, Hill Climbing, Tabu Search, Hybrid Whale Nelder Mead algorithm5, Great Deluge Algorithm etc6. These algorithms have been applied to solve several optimization problems ranging from vehicle routing, network routing, constrained truss optimization problems7, job scheduling, collision-avoidance8, mobile ad-hoc networks, tuning PID parameters of Automatic Voltage Regulators9, sports and examination timetabling10, test suite optimization11, energy enhancement12, global optimization problems5, automobile connecting rod components etc13 with good results.
The constant need for further improvements in the existing technologies has led to the development of some recent development algorithms. These newly-developed optimization algorithms are sometimes called twenty first century algorithms. Notable among these twenty first century algorithms are the Firefly, Ebola Optimization Search Algorithm14, Reptile Search Algorithm15, Bat Algorithm16, Dwarf Mongoose Optimization Algorithm17, Animal Migration Optimization18, Grey Wolf Optimization19, League Championship20, Sine–Cosine, Water Cycle, Grasshopper, Harris Hawks Optimization, Dragon Fly Optimization Algorithm21, Whale Optimization22, Gaining-sharing knowledge based algorithm23 and the African Buffalo Optimization24 algorithms.
Since its introduction, the African Buffalo Optimization has enjoyed warm acceptance among researchers and wide application to different scientific and engineering processes25,26,27,28. So far, some of the application areas of the African Buffalo Optimization include Strategic management, numerical function evaluation29, travelling salesman’s problem, PID parameter tuning of automatic voltage regulators30, collision avoidance in electric fish31 strategic integration of battery energy storage in distributed networks28 etc. This warm reception necessitated the need for a detailed explanation of the algorithm’s operational processes so that other researchers may better understand its internal mechanisms and further explore the strengths of the algorithm. This is the motivation for this study. This study is significant because it is rare to find a similar study highlighting the literal working of newly-designed algorithms from a human perspective. Instead what is available, in literature, is a brief description from a machine perspective32. It is hoped that this study will simplify software design and development using the African Buffalo Optimization algorithm in solving different engineering, scientific and industrial problems. Moreover, it is hoped that it will stimulate interest, among researchers, in highlighting the literal working of algorithms from a human perspective. The knowledge of the literal workings of the African Buffalo Optimization algorithm will enhance the understanding, implementation and use of the algorithm.
The rest of this paper is organized as follows: section two examines the materials and methods that basically describes the algorithms’ developmental processes as it relates specifically to the ABO; section three discusses the ABO algorithm; section four presents ABO solutions to global optimization problems as well technically exploring ABO’s search procedure in a two-dimensional search space; section five discusses the implementation of the ABO and the CS to solve the benchmark Rosenbrock function specifically highlighting the effects of the number of search population cum iterations in the search process and section six examines the ABO and FPA in solving the benchmark Dejong 5 (Shekel) function. Section seven draws conclusion on the study.
The African buffalo optimization (ABO) was inspired by the migrant behaviour of the African buffalos, especially the organizational prowess of the buffalo herd in their movements from one part of Africa to the other in search of grazing pastures33. The development of the ABO began with a careful study of the movement and organization of the African buffalos in existing literature as well as from television documentary programs on National Geographic Wild Channel34,35.
The design of the ABO is an effort to design a fast, robust, effective, efficient, yet simple-to-implement and user-friendly algorithm imbued with sufficient capacity to exploit and explore the solution space through thorough simulation of the democratic cum communicative capabilities of cape buffalos, (otherwise called African buffalos) in their quest for solutions36.
ABO simulates the cooperative nature, communicative acumen coupled with the communal decision-making procedures of the African buffalos that places much premium on the harnessing of the collective intelligence of the entire herd. The buffalos use mainly two vocalizations to organize themselves in their search for solutions: the attraction sound /maaa/ for exploitation and repulsion /waaa/ sound for exploration. The herd movement, provision and protection of the entire buffalo community hinges on the effective utilization utilisation of both calls.
As earlier observed, the design of a swarm intelligence algorithm follows a six-step procedure. These six steps were diligently followed in the design of the African Buffalo Optimization37,38, namely:
Careful observation of the behavior of a group of organisms/creatures working harmoniously to realize the group’s objectives that seem rather impossible for an individual member of the group. The African buffalos were keenly studied based on observation from the National Geographic Wild television channel
A model was developed that fully describes the behavior of a herd community, in this case of the African buffalos
The development of a mathematical model based on the model of behavior developed in (ii)
A pseudocode was designed to simulate the behavior of African buffalos
A programming code was developed to implement the pseudocode
The programming code was subjected to various mathematical cum experimental evaluations with the aim of fine-tuning the algorithm’s parameters to achieve the set objectives39.
The methodology for design and applications of the ABO algorithm is presented in Fig. 1.
ABO design methodology flowchart.
The ABO algorithm40 and flowchart is presented in Fig. 2:
ABO algorithm.
Please note that in Fig. 2, ({mathrm{w}}_{mathrm{k}}) represents the /waaa/call. This call mobilizes the herd to move on (explore) with particular reference to buffalo k. The ({mathrm{m}}_{mathrm{k}}) represents the /maaa/ call to exploit. Similarly, ({mathrm{w}}_{mathrm{k}}^{mathrm{^{prime}}} ,) the call for more exploration; ({mathrm{m}}_{mathrm{k}}^{prime}), a represents need for more exploitation; (mathrm{lp}1) and (mathrm{lp}2), the learning parameters; and (lambda ) a random number which takes any value between 0 and 1 depending on the problem being solved: the higher the value, the more the exploitation and less of exploration and vice-versa.
The ABO starts by randomly initializing the buffalo population within the search space. Next the buffalo’s exploitation capacities are evaluated using Eq. (1). The outcome of this evaluation is crucial in determining the next move of the buffalos in their search for fruitful grazing locations. The result of democratic Eq. (1) is fed into the exploration Eq. (2) [see Eq. (2) below] to determine whether the buffalos will remain in the same location or migrate to another location. If the (bg) (the buffalo with the best position in relation to the global optimum) is updating, the algorithm verifies if the stopping criteria has been reached. If yes, it terminates the run and outputs the location of the best buffalo as the output. If the stopping criterion has not been reached, the algorithm returns to step 2 to reassess the buffalos’ exploitation values.
The controlling equation that propels the entire buffalo herd to relocate to other locations, probably more rewarding than the present location is:
Equation 1 which is the exploration equation has three parts: the memory part (({mathrm{m}}_{mathrm{k}}{^{prime}})) that reminds the buffalos that they have relocated to a new location from the previous location (({mathrm{m}}_{mathrm{k}})); the second part which signals the cooperative behaviour of the buffalos(, (mathrm{lp}1left(bg – {mathrm{w}}_{mathrm{k}}right))) and the third part ((mathrm{lp}2left({bp}_{k}-{mathrm{w}}_{mathrm{k}}right))) represents the buffalos capacity for excellent communication among the entire herd. Note that this decision is influenced by the learning parameter (mathrm{lp}1).
The last part of Eq. (1): ((mathrm{lp}2left({bp}_{k}- {mathrm{w}}_{mathrm{k}}right),) underscores the exceptional intelligence of these animals. They can tell their previous best productive location in comparison with their present location. This knowledge enables the buffalos to retrace their steps to the best previous rewarding location whenever they stray away into a starving location. Also, note that the buffalo’s exceptional intelligence with regards to the previous best rewarding location vis-à-vis their present location is influenced by the learning parameter (mathrm{lp}2.) As can be observed, the entire Eq. (1) highlights the buffalos’ ability to harness the collective intelligence, excellent memory capacity cum regular communication of the herd in making informed decisions in their search for solutions41.
Again, it can be observed that the algorithm subtracts the dimensional element ({mathrm{w}}_{mathrm{k}}) from the maximum vector and then multiplies this by the learning parameters ((lp1), (lp2)) usually between 0 and 1. The right values of the learning parameters ((lp1), (lp2)) are obtainable through parameter tuning process. Please note also that a higher value of (lp1) biases the search towards global search while the higher the value of (lp2), the local search. The sum of these products is then added to the exploitation memory part of the equation (({mathrm{m}}_{mathrm{k}})) for the given dimension ((x or y)) to determine the actual fitness of the buffalos. Equation 2 basically, propels the buffalos to a new location following the outcome of Eq. (1).
From Eq. (2), it can be seen that the movement of the buffalos is a function of the /waaa/ calls (({mathrm{w}}_{mathrm{k}})) and the /maaa/ (left({mathrm{m}}_{mathrm{k}}right)) calls of the buffalos being moderated by exploration driver (lambda ) which takes a value between 0 and 1. The higher the value of the (lambda ), the less exploration and vice-versa. The ABO can be visualized thus:
In Fig. 3, the movement of buffalo (k), therefore, from ({mathrm{w}}_{mathrm{k}}) (the present exploration location), to other locations has to be influenced by other factors such as the ({mathrm{m}}_{mathrm{k}}), the exploitation location and appropriate adjustment of its position in relation to the herd’s best ((mathrm{bg } – {mathrm{w}}_{mathrm{k}})) as well as its personal best (({mathrm{bp}}_{mathrm{k}} – {mathrm{w}}_{mathrm{k}})) with the covert bias of the learning parameters.
ABO visualization.
In modern scientific investigations, scientists encounter problems that are multimodal with diverse objective functions and having different channels, hyperplanes, valleys, peaks etc. Ability to provide solutions to such global optimization problems distinguishes an effective and efficient optimization algorithm from the rest42. In our attempt to unravel the search potentials of the ABO, it is necessary to simulate ABO search procedure in a two-dimensional search space but first, let us examine the ABO solution steps.
Initialize the buffalos randomly within the search space
State the controlling ABO learning parameters: (lp1; and; lp2)
Using Eq. (1), verify the herd exploitation state noting each buffalo’s (bp) and the (bg) for the entire herd
Using Eq. (2), determine the location of the buffalos
Check if the (bg) is updating. Yes, go to Step 6, else return to Step 2
Verify stopping criteria. Reached, go to Step 7, else go to Step 3
Output the best result.
At this juncture, let us attempt the demonstration of ABO on a two-dimensional search space. For this exercise, we initialize buffalo (k) to location 7, 9; buffalo (l) to 11, 15 and buffalo j, 4, 15 (see Fig. 4). Again, we assume the global optimum point is 41.5, 75. In the first iteration, we place (lp1) as 0.6, (lp2) as 0.5, (lambda ) is a random number [0, 1]. It is important to observe that the lower the value of (lambda ), the more the exploration and vice-versa. For the sake of convenience, let (lambda ) assume values between 0.5 and 0.9 (see Fig. 1).
Starting locations.
Iteration 1 (for ({b}_{k}) ):
(bp) =each buffalo’s starting points,
(bg) =11,15(bj), picked randomly
At this point, the present exploitation values of buffalo k, represented by ({text{m}}^{prime }_{{text{k}}}) is (9.4, 12.6). Next, let us apply these new exploitation fitness dimensions to our buffalo location using exploration decision Eq. (2)
Also, please note that the present location of buffalo (k), represented by ({text{w}}^{prime }_{{text{k}}} ) is (32.8, 43.2). Plot these new values into our graph (see Fig. 5):
1st Iteration.
Let us now see the performance of the ABO for buffalo ( l) at the first iteration.
Iteration 1 (for (b_{j}) ):
(bp) = each buffalo’s starting points, (bg) = 11,15((b_{j})), picked randomly
At this point, the present exploitation values of buffalo (j), represented by new ({text{m}}_{{text{j}}}) is (8.2, 21.6). Next, let us apply these new exploitation fitness dimensions to our buffalo location using exploration decision Eq. (2)
The new location of buffalo (b_{j}) is (13.56, 40.67) as shown in Fig. 5.
Iteration 1 (for ({b}_{l}) ):
(bp) = each buffalo’s starting points, (bg) =11, 15(({b}_{j})), picked randomly
At this point, the present exploitation values of buffalo (l), represented by new ({mathrm{m}}_{1}l) is (6.8, 15). Next, let us apply these new exploitation fitness dimensions to our buffalo location using exploration decision Eq. (2)
Now, buffalo ( b_{l}) is in location 22.25, 37.5 (see Fig. 5).
Iteration 2 (for (b_{k}) ):
We shall use the dimensions obtained from the first iteration to update our algorithm using Eq. (1). It should be observed that the algorithm updates (bg) value from iteration to iteration. Let us randomly take the ( b_{k}) as the (bg) and the individual buffalo’s newest locations as their ( b_{p}). This is in appreciation of their performances at the first iteration and in line with the ABO’s strategy to avoid stagnation. For iteration2, therefore, the (bg) is 8.9, 15.
(bp) = each buffalo’s previous points, (bg) = 32.8,43.2 ((b_{k } (1))), picked randomly
Applying the new exploitation fitness dimensions to our buffalo location using exploitation decision Eq. (2)
Next, we plot this present location of our buffalo into our graph shows that the buffalo is migrating towards our global maximum. (see Fig. 6):
2nd Iteration.
Iteration 2 (for (b_{j}) ):
(bp) = each buffalo’s previous points, (bg) = 32.8,43.2 ((b_{k } (1))), picked randomly
Plotting the present ({text{m}}_{{text{j}}}) values (16.01, 11.79) to Eq. (2):
Now ( b_{j}) has moved to 36.96, 65.58 (Fig. 5).
Iteration 2 (for (b_{l}) ):
(bp) = each buffalo’s starting points, (bg) = 32.8,43.2 ((b_{k } (1))), picked randomly
Applying the present values of ({text{m}}_{l}) (7.47, 20.67) to Eq. (2):
At this point, the ABO verifies the exit criterion and discovers that this has been met since its assignment is to obtain the optimum result which is (41.5, 75).
In this section, the popular benchmark Rosenbrock function is implemented using ABO and Cuckoo Search on a PC, 4 GB RAM, Intel Duo Core i7 370 CPU @ 3.40 GHz, 3.40GH running Windows 10 using MATLAB 2012b.The ABO parameters used in the experiments are lp1 = 0.7; lp2 = 0.5. For the CS, the parameters are: step = u./abs (v). ^ (1/beta); step size = 0.01* step; u = rand (size (s)) * sigma; pa = 0.5; v = rand (size(s)). Each specific experimental was executed five times.
The aim of the experimental evaluations is to unravel the effect of the number of buffalos/nests and the iterations in obtaining good results with the objective of performing a comparative performance evaluation of both algorithms. The choice of Cuckoo Search is borne out of the fact that Cuckoo Search, in addition to being a recently developed metaheuristic, has so far proven to be very efficient and effective in solving several optimization problems. Some of the successful application areas of the Cuckoo Search includes job scheduling, flow shop scheduling, travelling salesman’s problems, image processing, speech recognition, global optimization problems etc43.
The evaluation metrics used in the comparative performance analysis in this study are the algorithms efficiency and effectiveness. Effectiveness as used in this study refers to the capacity of the algorithms to algorithms to obtain the optimal results while algorithm efficiency refers to the algorithms capacity to obtain results using the most optimized resources44,45.
Cuckoo Search (CS) algorithm was designed by X. Yang and S. Deb. The algorithm is a mathematical simulation of the irresponsible behaviour of cuckoo birds brooding over their eggs until such eggs are hatched46. The CS pseudocode47 and flowchart48 is presented in Fig. 7:
CS pseudocode.
CS starts its search by initializing, randomly, cuckoo bird nests. Next using Eq. (3), it evaluates the fitness of each nest.
Once it obtains the cuckoo nest with the best fitness, it records same and compares it with the next best nest fitness in the subsequent iterations. In each iteration, the CS algorithm verifies the stopping criteria. Once the algorithm reaches the stopping criteria, the algorithm outputs the best fitness as the answer to the optimization problem being solved.
The dataset for the Global optimization problems are obtained from the benchmark continuous global optimization test problems49. Rosenbrock function is one of functions designed by Kenneth Dejong for his Ph.D. Thesis in 1975. The others functions include Dejong 5 (Shekel foxhole), Sphere, Quartic and Step functions. Over time it has become very popular among researchers for testing optimization algorithms. Note that the benchmark Rosenbrock function is50:
and the optimum solution is:
The experimental outcome when 10 buffalos/nests are executed with varying buffalo and nests population deployed to the search space is presented in Table 1. The choice of 10 buffalos/nest was informed by the recommendation of the designer of Cuckoo Search that the algorithms works better when a population of between 15 and 40 nests are used51. The experimental outcome is presented in Table 1.
The simulation results in Table 1 indicate that the best average outcome of the ABO (2.9357 ({e}^{-06}) at an average of 2.273 s) was obtained at 5000 iterations when searching with 10 buffalos. It is interesting, however, to note that a single best performance 2.503 ({e}^{-07}) which is the best individual result was obtained when 10 buffalos are deployed using different iterations (10, 100, 1000, 5000 and 10,000). This is a mark of the algorithm’s randomness: a mark of good algorithms50.
In this Table, it is remarkable that the average output derived from using 10,000 iterations (3.7547 ({e}^{-05})) is inferior to deploying just 5000 iterations (2.9357 ({e}^{-06})). This result is interesting because in an earlier study on the Genetic Algorithm, it was observed that the use of a larger population/iteration leads to better results52. In the light of the findings of this study, it may be safe to say that the assertion of the earlier study could be algorithm-specific or problem-specific.
In terms of the comparative results, the ABO was discovered to be a better starter. For instance at 10 iterations, the ABO has a better result of 0.0426 compared to CS’s 0.5634. Similarly, the ABO was faster at this point with 0.021 than the CS’s 0.031.
However, in terms of obtaining the optimal or near optimal results, the tide changed from the 100 iterations, On the average, the CS, had better good results right from 100 iterations all through the 10,000 iterations but at a very inferior time when compared to the results obtained by the ABO. Right from when both algorithms were executed with just 100 iterations, the results of the CS were superior to those of the ABO. The average result of the CS at 100 iterations was 5.0611 ({e}^{-13}) as opposed to ABO’s 0.0527. This trend continues to 10,000 when the CS obtained the optimal solution of 0.
Based on the findings of Table 1, it is necessary to investigate the performance of ABO and CS when a population of 50 search agents are deployed. This is the focus of the second set of experiments whose outcome is presented in Table 2.
The simulation outcome of Table 2 follows the trend of Table 1. CS, generally, had better results than ABO but ABO has again proven to be a faster algorithm. A major contribution of this study is the discovery that the CS obtained better output at 5000 iterations when 10 nests were deployed (2.4697 ({e}^{-320})) than when 50 nests (4.9646 ({e}^{-165})). At 10,000 iterations using 10 nests, the CS converged at the optimum result (average: 0) but was unable to do same when 50 nests were used at the same 10,000 iterations (average: 5.3958 ({e}^{-272})). Also one wonders why the need of as much as 10,000 iterations using 50 nests when the result of 10 nests with 5000 iterations could do a better job.
A closer look at the CS performance at just 1000 iterations shows that the algorithm performed better using just 10 nests at an average of 4.4527 ({e}^{-78}) than when searching with 50 nests (average: 2.2048 ({e}^{-55})). The finding here is, again, a deviation from the view that the more the iterations cum population, the better the result. When searching with 50 buffalos, the ABO had a better result at 5000 iterations with an average outcome of 2.7808 ({e}^{-06}) than at 10,000 iterations with an average of 4.1005 ({e}^{-06}). Aside these few exceptions, the other results follow the general trend that the more the population cum iterations, the more likely, the chance of a better result53.
In terms of the speed of execution, the experimental outcome in Table 2 is consistent with earlier findings that the deployment of more populations and more iterations may likely lead to more processing time but with better results54. The slow speed whenever more iterations and more populations are deployed is because the algorithm’s convergence gets slower as a result of more evaluations arising from such a situation.
Flower Pollination Algorithm (FPA) which was designed by X.S. Yang has been very exceptional in obtaining good results when applied to solve optimization problems. The algorithm inspired by the normal pollination of natural flowers through self-pollination (biotic pollination) by water or wind or cross pollination (abiotic pollination) by other animals uses levy flight to arrive at solutions. In FPA self-pollination represents global search and cross pollination, local search. In either the local or global search, there exists a strict regulation by a switch search mechanism with a probability p ∈ [0, 1]. Global pollination is modelled by the following process:
xit is the pollen i or solution vector xi at iteration t. gbest is the globally best solution. The parameter L is a step size, and is drawn from a Lévy distribution.
Table 3 below presents the comparative performance evaluation of the ABO and FPA.
FPA pseudo code of FPA is presented:10.
In solving the complex Shekel Foxhole function that has 25 local minima and a global minimum, many algorithms struggle, but not FPA and ABO. Clearly, these two algorithms have been very competitive. Both algorithms used a population of 10 buffalos/flowers in their search which usually produces good results2,3,29,47. This population produced very good results as can be seen in Table 3. Please note that global minimum of the Shekel Foxhole function is55:
From Table 3, it can be seen that the ABO arrived at the global optimum at iteration 1000. In the same vein, FPA best result at iteration1000 was 0.9982 which is also a good result. ABO’s average after five runs at iteration 5000 was 0.9981 to FPA’s 0.9984. It is obvious that the ABO has a slight advantage over the FPA in algorithm effectiveness. In terms of efficiency, FPA clearly performed better right from the beginning to the end. For instance while it took the ABO an average of 54.972 s to make five runs at 5000, the FPA only took 11.176. For emphasis, note that algorithm effectiveness is the capacity of algorithms to arrive at the global optimum but efficiency refers to the algorithm’s capacity to minimize the use of computer resources. Since the amount of time spent to arrive at a solution correlates with use of computer resources, the amount of time taken to arrive at a solution dictates the length of time that the computer resources are engaged: the shorter the time, the better44.
In all, from the foregoing analysis, since algorithm’s performance is judged primarily by its efficiency and effectiveness, in view of the competitive results posted by the ABO so far, the algorithm can be deemed a worthy inclusion to the body of swarm optimization algorithms in literature.
This paper explains the algorithmic flow and data generation procedure of the African Buffalo Optimization algorithm. First, using very simple language as much as possible cum basic mathematical description with detailed examples, this paper explains the workings of the ABO in a manual setting. In the second part (see “Implementation of the ABO and the CS” and “Comparative performance of ABO and flower pollination algorithm”), a MATLAB implementation of the ABO CS and the FPA were done to solve the benchmark Rosenbrock and Shekel Foxhole functions with particular emphasis on the effect of the search population and the number of iterations in obtaining good results. After a number of experimental evaluations, the study agrees, that to a large extent, the more the number of iterations cum population, the more likely the chance of a better outcome.
However, it must be observed that the more the population cum number of iterations, the more execution time taken to arrive at a solution. This is because the more the population cum iterations, the more the evaluations, therefore, leading to slower convergence54. It is our sincere belief that with this detailed explanation cum data description of the ABO, the research community will explore the search capacity of this novel algorithm in solving different types of optimization problems in science and engineering applications bearing in mind that so far swarm optimization algorithms have been applied to so many real life problems. Some of the potential real life application areas of the African Buffalo Optimization algorithm include such as parameter estimations56, nonlinear system identification57 learning of the weights of neural networks58 and many others..
While we celebrate the good and competitive results of the algorithms used in this study, it is worthy of note, however, that good results could be a function of the machine used in the study, the programming language used for coding and implementation as well as technical expertise of the programmer. Another factor that could be a threat to the validity of results could be the choice of benchmark test cases. Those algorithms perform very well in the chosen benchmark cases may not be a guarantee that they will do the same in other benchmarks. Moreover, the choice of the algorithms used in this particular study could be a threat: while acknowledging that the algorithms used in this study performed well against one another, they may not do the same when compared with other algorithms. Nevertheless, that these threats to the validity of the claims made in this study are highlighted, does not, in any way, contradict the findings/results obtained. For further study, it is recommended that performance of these algorithms be applied to a different dataset such as the CEC recent functions as well as similar datasets.
Odili, J. B. The dawn of metaheuristic algorithms. Int. J. Softw. Eng. Comput. Syst. 4, 49–61 (2018).
Article Google Scholar
Odili, J., Kahar, M. N. M., Noraziah, A. & Kamarulzaman, S. F. A comparative evaluation of swarm intelligence techniques for solving combinatorial optimization problems. Int. J. Adv. Rob. Syst. 14, 1729881417705969 (2017).
Google Scholar
Odili, J. B., Kahar, M. N. M., Noraziah, A., Zarina, M. & Haq, R. U. Performance analyses of nature-inspired algorithms on the traveling salesman’s problems for strategic management. Intell. Autom. Soft Comput. 1–11 (2017).
Yıldız, A., Pholdee, N., Bureerat, S., Yıldız, A. R. & Sait, S. M. Sine-cosine optimization algorithm for the conceptual design of automobile components. Mater. Test. 62, 744–748 (2020).
ADS Article Google Scholar
Odili, J. B. Combinatorial optimization in science and engineering. Curr. Sci. 113, 2268–2274 (2017).
Article Google Scholar
Odili, J. B., Noraziah, A., Ambar, R. & Abd Wahab, M. H. Implementation strategies for the cuckoo search and the African buffalo optimization for the benchmark Rosenbrock function. Eurasia Proc. Sci. Technol. Eng. Math. 2, 395–402 (2018).
Google Scholar
Panagant, N., Pholdee, N., Bureerat, S., Yildiz, A. R. & Mirjalili, S. A comparative study of recent multi-objective metaheuristics for solving constrained truss optimisation problems. Arch. Comput. Methods Eng. 28, 1–17 (2021).
Article Google Scholar
Noraziah, J. B. O. A. & Abd Wahab, M. H. African Buffalo optimization algorithm for collision-avoidance in electric fish.
Odili, J. B. & Kahar, M. M. in National Conference for Postgraduate Research, Universiti Malaysia Pahang, Vol. 641–648.
Yang, X.-S. in International Conference on Unconventional Computing and Natural Computation. 240–249 (Springer).
Khari, M., Kumar, P., Burgos, D. & Crespo, R. G. Optimized test suites for automated testing using different optimization techniques. Soft. Comput. 22, 8341–8352 (2018).
Article Google Scholar
Vimal, S. et al. Energy enhancement using Multiobjective Ant colony optimization with Double Q learning algorithm for IoT based cognitive radio networks. Comput. Commun. 154, 481–490 (2020).
Article Google Scholar
Odili, J. B. & Noraziah, A. African buffalo optimization for global optimization. Curr. Sci 114, 627–636 (2018).
Article Google Scholar
Oyelade, O. N. & Ezugwu, A. E. Ebola optimization search algorithm (EOSA): A new metaheuristic algorithm based on the propagation model of Ebola virus disease. arXiv:2106.01416 (2021).
Abualigah, L., Abd Elaziz, M., Sumari, P., Geem, Z. W. & Gandomi, A. H. Reptile search algorithm (RSA): A nature-inspired meta-heuristic optimizer. Expert Syst. Appl. 191, 116158 (2022).
Article Google Scholar
Yıldız, B. S. Natural frequency optimization of vehicle components using the interior search algorithm. Mater. Test. 59, 456–458 (2017).
ADS Article Google Scholar
Agushaka, J. O., Ezugwu, A. E. & Abualigah, L. Dwarf mongoose optimization algorithm. Comput. Methods Appl. Mech. Eng. 391, 114570 (2022).
ADS MathSciNet MATH Article Google Scholar
Chiclana, F. et al. ARM–AMO: An efficient association rule mining algorithm based on animal migration optimization. Knowl.-Based Syst. 154, 68–80 (2018).
Article Google Scholar
Abed-alguni, B. H. & Alawad, N. A. Distributed Grey Wolf Optimizer for scheduling of workflow applications in cloud environments. Appl. Soft Comput. 102, 107113 (2021).
Article Google Scholar
Karagöz, S. & Yıldız, A. R. A comparison of recent metaheuristic algorithms for crashworthiness optimisation of vehicle thin-walled tubes considering sheet metal forming effects. Int. J. Veh. Des. 73, 179–188 (2017).
Article Google Scholar
Yıldız, B. S. & Yıldız, A. R. The Harris hawks optimization algorithm, salp swarm algorithm, grasshopper optimization algorithm and dragonfly algorithm for structural design optimization of vehicle components. Mater. Test. 61, 744–748 (2019).
ADS Article Google Scholar
Yıldız, B. S. & Yıldız, A. R. Comparison of grey wolf, whale, water cycle, ant lion and sine-cosine algorithms for the optimization of a vehicle engine connecting rod. Mater. Test. 60, 311–315 (2018).
ADS Article Google Scholar
Mohamed, A. W., Hadi, A. A. & Mohamed, A. K. Gaining-sharing knowledge based algorithm for solving optimization problems: A novel nature-inspired algorithm. Int. J. Mach. Learn. Cybern. 11, 1–29 (2019).
Google Scholar
Odili, J. B., Kahar, M. N. M. & Noraziah, A. African buffalo optimization algorithm for tuning parameters of a PID controller in automatic voltage regulators. Int. J. Simul: Syst. Sci. Technol. 17(33), 45.1–45.7 (2016).
Google Scholar
Odili, J.B., Kahar, M. N. M. & Noraziah, A. Parameters-tuning of PID controller for automatic voltage regulators using the African buffalo optimization. PLoS ONE 12(4), e0175901 (2017).
PubMed PubMed Central Article Google Scholar
Odili, J. B., Noraziah, A. & Sidek, R. M. in IOP Conference Series: Materials Science and Engineering. 012030 (IOP Publishing).
Hassan, M. H. et al. Integrating African Buffalo optimization algorithm in AODV routing protocol for improving the QoS of MANET. J. Southwest Jiaotong Univ. 54 (2019).
Singh, P., Meena, N. K., Slowik, A. & Bishnoi, S. K. Modified african buffalo optimization for strategic integration of battery energy storage in distribution networks. IEEE Access 8, 14289–14301 (2020).
Article Google Scholar
Odili, J. B., Noraziah, A. & Babalola, A. E. Flower Pollination Algorithm for data generation and analytics-a diagnostic analysis. Sci. Afr. 8, e00440 (2020).
Google Scholar
Odili, J. B., Noraziah, A. & Babalola, A. E. A new fitness function for tuning parameters of Peripheral Integral Derivative Controllers. ICT Express 8, 463–467 (2022).
Article Google Scholar
Odili, J. B., Noraziah, A. & AbdWahab, M. H. African buffalo optimization algorithm for collision-avoidance in electric fish. Intell. Autom. Soft Comput. 26(1), 41–51 (2020).
Google Scholar
Logg, J. M., Minson, J. A. & Moore, D. A. Algorithm appreciation: People prefer algorithmic to human judgment. Organ. Behav. Hum. Decis. Process. 151, 90–103 (2019).
Article Google Scholar
Lorenzen, E., Heller, R. & Siegismund, H. R. Comparative phylogeography of African savannah ungulates. Mol. Ecol. 21, 3656–3670 (2012).
CAS PubMed Article Google Scholar
Jori, F. et al. A questionnaire-based evaluation of the veterinary cordon fence separating wildlife and livestock along the boundary of the Kruger National Park, South Africa. Prevent. Vet. Med. 100, 210–220 (2011).
CAS Article Google Scholar
Odili, J. B. & Kahar, M. N. M. African buffalo optimization (ABO): A new meta-heuristic algorithm. J. Adv. Appl. Sci. 3, 101–106 (2015).
Google Scholar
Odili, J. B., Kahar, M. N. & Noraziah, A. Solving traveling salesman’s problem using African buffalo optimization, honey bee mating optimization & Lin-Kerninghan algorithms. World Appl. Sci. J. 34, 911–916 (2016).
Google Scholar
Jones, C. B. Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. (TOPLAS) 5, 596–619 (1983).
MATH Article Google Scholar
Jakeman, A. J., Letcher, R. A. & Ten Norton, J. P. iterative steps in development and evaluation of environmental models. Environ. Model. Softw. 21, 602–614 (2006).
Article Google Scholar
Baritompa, B. & Hendrix, E. M. On the investigation of stochastic global optimization algorithms. J. Global Optim. 31, 567–578 (2005).
MathSciNet MATH Article Google Scholar
Odili, J. B. & Fatokun, J. O. in 2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS). 1–8 (IEEE).
Odili, J. B. & Mohmad Kahar, M. N. African buffalo optimization. Int. J. Softw. Eng. Comput. Syst. 2, 28–50. https://doi.org/10.15282/ijsecs.2.2016.1.0014 (2016).
Article Google Scholar
Aydoğdu, İ, Akın, A. & Saka, M. Design optimization of real world steel space frames using artificial bee colony algorithm with Levy flight distribution. Adv. Eng. Softw. 92, 1–14 (2016).
Article Google Scholar
Kamat, S. & Karegowda, A. A brief survey on cuckoo search applications. Int. J. Innovative Res. Comput. Commun. Eng. 2 (2014).
Odili, J. B., Noraziah, A. & Zarina, M. A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem. Comput. Intell. Neurosci. 2021, 6625438. https://doi.org/10.1155/2021/6625438 (2021).
Article PubMed PubMed Central Google Scholar
Odili, J. B., Noraziah, A., Ambar, R., AbdWahab, M. H. & Fakheraldin, M. Teaching computer science in the universities in third world countries: Challenges. Eurasia Proc. Educ. Soc. Sci. 9, 354–358 (2018).
Google Scholar
Yang, X.-S. & Deb, S. in World Congress on Nature & Biologically Inspired Computing, 2009. NaBIC 2009. 210–214 (IEEE).
Odili, J. B. Implementation analysis of cuckoo search for the benchmark rosenbrock and levy test functions. J. Inf. Commun. Technol. 17, 17–32 (2017).
Google Scholar
Majidi, M., Ozdemir, A. & Ceylan, O. in 2017 19th International Conference on Intelligent System Application to Power Systems (ISAP). 1–6 (Ieee).
Ali, M. M., Khompatraporn, C. & Zabinsky, Z. B. A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Global Optim. 31, 635–672 (2005).
MathSciNet MATH Article Google Scholar
Khompatraporn, C., Pintér, J. D. & Zabinsky, Z. B. Comparative assessment of algorithms and software for global optimization. J. Global Optim. 31, 613–633 (2005).
MathSciNet MATH Article Google Scholar
Mareli, M. & Twala, B. An adaptive Cuckoo search algorithm for optimisation. Appl. Comput. Inform. 14, 107–115 (2018).
Article Google Scholar
Tsoy, Y. R. in The 7th Korea-Russia International Symposium on Science and Technology, 2003. Proceedings KORUS 2003. 181–187 (IEEE).
Raferty, A. & Lewis, S. The number of iterations, convergence diagnostics and generic Metropolis algorithms. Pract. Markov Chain Monte Carlo 7, 763–773 (1995).
Google Scholar
Carr, J. An introduction to genetic algorithms. Senior Project, 1–40 (2014).
Function, S. F. Shekel Foxhole Function. Electric Power Systems Analysis and Nature-Inspired Optimization Algorithms. https://al-roomi.org/benchmarks/unconstrained/2-dimensions/7-shekel-s-foxholes-function.
Ammara, M., Aneela, Z., Ho, L. S., ur Rehman, A. & Zahoor, R. M. A. Integrated computational intelligent paradigm for nonlinear electric circuit models using neural networks, genetic algorithms and sequential quadratic programming. Neural Comput. Appl. 32, 10337–10357 (2020).
Article Google Scholar
Tariq, H. B. et al. Maximum-likelihood-based adaptive and intelligent computing for nonlinear system identification. Mathematics 9, 3199 (2021).
Article Google Scholar
Sabir, Z., Ali, M. R. & Sadat, R. Gudermannian neural networks using the optimization procedures of genetic algorithm and active set approach for the three-species food chain nonlinear model. J. Ambient Intell. Hum. Comput. 1–10 (2022).
Download references
The authors appreciate the Department of Mathematical Sciences, Anchor University Lagos. Also we express our gratitude to the Ministry of Higher Education Malaysia for supporting this Research under Fundamental Research Grant Scheme RDU 190185 FRGS/1/2018/ICT03/UMP/02/3 (University reference RDU190185). This work is also funded by the Deanship of Scientific Research (DSR) at Umm Al-Qura University through Grant No.: 22UQU4210132DSR01.
Faculty of Science and Science Education, Anchor University Lagos, Lagos, Nigeria
Julius Beneoluchi Odili
Faculty of Computing, Universiti Malaysia Pahang, Pekan, Kuantan, Malaysia
A. Noraziah
Centre for Software Development and Integrated Computing, University Malaysia Pahang, 26600, Pekan,, Pahang, Malaysia
A. Noraziah
Department of Computer Science, Umm al-Qura University, Makkah al Mukarramah, Saudi Arabia
Basem Alkazemi
Faculty of Informatics and Computing, Universiti Sultan Zainal Abidin, Kuala Terengganu, Malaysia
M. Zarina
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
J.B.O. wrote the main manuscript under the supervision of Associate Professor A.N. and supported by M.Z. and B.A.
Correspondence to Julius Beneoluchi Odili.
The authors declare no competing interests.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Reprints and Permissions
Odili, J.B., Noraziah, A., Alkazemi, B. et al. Stochastic process and tutorial of the African buffalo optimization. Sci Rep 12, 17319 (2022). https://doi.org/10.1038/s41598-022-22242-9
Download citation
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-022-22242-9
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.
Advertisement
© 2022 Springer Nature Limited
Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.