Abstract
Humans take immense pride in their ability to be unpredictably intelligent and despite huge advances in science over the past century; our understanding about human brain is still far from complete. In general, human being acquire the high echelon of intelligence with the ability to understand, reason, recognize, learn, innovate, retain information, make decision, communicate and further solve problem. Thereby, integrating the intelligence of human to develop the optimization technique using the human problem-solving ability would definitely take the scenario to next level thus promising an affluent solution to the real world optimization issues. However, human behavior and evolution empowers human to progress or acclimatize with their environments at rates that exceed that of other nature based evolution namely swarm, bio-inspired, plant-based or physics-chemistry based thus commencing yet additional detachment of Nature-Inspired Optimization Algorithm (NIOA) i.e. Human-Inspired Optimization Algorithms (HIOAs). Announcing new meta-heuristic optimization algorithms are at all times a welcome step in the research field provided it intends to address problems effectively and quickly. The family of HIOA is expanding rapidly making it difficult for the researcher to select the appropriate HIOA; moreover, in order to map the problems alongside HIOA, it requires proper understanding of the theoretical fundamental, major rules governing HIOAs as well as common structure of HIOAs. Common challenges and open research issues are yet another important concern in HIOA that needs to be addressed carefully. With this in mind, our work distinguishes HIOAs on the basis of a range of criteria and discusses the building blocks of various algorithms to achieve aforementioned objectives. Further, this paper intends to deliver an acquainted survey and analysis associated with modern compartment of NIOA engineered upon the perception of human behavior and intelligence i.e. Human-Inspired Optimization Algorithms (HIOAs) stressing on its theoretical foundations, applications, open research issues and their implications on color satellite image segmentation to further develop Multi-Level Thresholding (MLT) models utilizing Tsallis and t-entropy as objective functions to judge their efficacy.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Contemporary world stumble upon countless multifarious real-time predicaments in which the underlying computation quandary are incredibly intricate to resolve generally because of its unusually towering dimensionally allied search space that are non-linear, non-continuous, non-differentiable, non-convex in nature. It is not an overstatement if said that need of optimization is all over the place ranging from scheduling [1, 2] to deployment of wireless sensor networks [3, 4] to engineering design [5, 6] to robotic navigation [7] to image processing [8,9,10]. In more or less all these activities, one intends to accomplish certain goals by optimizing quality, profit or time as these resources are valuable and inadequately available in the real world. In such state of affairs, usage of traditional or classical optimization algorithms fall short and doubtlessly have an inadequate scope in endowing inclusive elucidations thereby becoming computationally demanding. This quest unquestionably show the ways en route for the inevitability of expansion and add-ons to the existing classical optimization techniques to evolve into progressive modern technological optimization processes dexterous enough to attain affluent way out appropriate for modern day’s practical problems. Thus, Evolutionary Computation (EC) focuses on the study of the class of global optimization algorithm principally dealing with figurative practice of perceptions, principles, and procedures mined from the elementary understanding of how natural systems advances to support and solve composite computational problems to further arrive towards most suitable solution. Nonetheless, some prime challenges that tend to swivel around EC which demands to be addressed are: Lack of accepted benchmark problems; Lack of standard algorithms and implementations, Lack of mechanism for fine parameter control and tuning, Lack of methods to measure performance etc., Presently substantial amount of work has been carried forward concentrating typically on the procedures of natural selection thus developing new algorithms inspired by human. However, human behavior and evolution give power to human to familiarize with their atmospheres at rates that surpass that of other nature based evolution namely swarm, bio-inspired, plant-based or physics-chemistry based thus instigation yet other compartment of Nature-Inspired Optimization Algorithm (NIOA) [11,12,13,14] i.e. Human-Inspired Optimization Algorithms (HIOAs).
Due to the thought supremacy and intelligence seized by human, human do hold an exceptional position amongst the entire living creatures thus anticipating that the algorithm inspired from or based on human behavior can undoubtedly surpass other algorithms. Numerous human-inspired optimization algorithms have been proposed and the same has been applied to solve hefty set of problems as highlighted in Table 1. Given the significance of HIOAs in the variety of domains, there is a strapping requirement of a study that should provide a comprehensive overview of HIOAs highlighting and covering the entire major elements related to the algorithm. Besides, huge number of human inspired optimization algorithms is presented in the literature and every algorithm is different from another in some or the other way. Therefore, examining, reviewing and deeply learning every algorithm is not just intricate but at times not feasible so researcher who is not very familiar with HIOAs shall be constantly in a dilemma about the choice of the algorithm under variety of circumstances. This work shall try filling up the research gap thus acting as a bridge by endowing a brief yet inclusive overview of the different algorithms induced by the human experiences by analyzing, assessing, documenting and intensely testing the same over color satellite imagery. This paper classically gives attention to not just comparing of several human based meta-heuristics however, also tries to accumulate obligatory information such as fundamental building blocks, common structure opted by HIOAs, elements of HIOAs (namely nature of algorithm, number of solution, fundamental methodology followed and source of inspiration by each algorithm) and advancements in the direction of accomplishing the connotation of HIOA for MLT color satellite image segmentation and further classification of HIOA based on few criteria such as Socio-Political Philosophy, Socio-Competitive Behavior, Socio-Cultural/Socio-Interaction, Socio-Musical Ideologies and Socio-Emigration/Socio-Colonization making it easier for the new researcher to garner idea about which HIOA would be suitable for the problem they intend to resolve. A number of research challenges with HIOA are discussed. Further, open future research directions are also recommended for researchers to pursue. Total 51 well-accepted and renowned stochastic HIOAs are taken into account in the present work. Consequently, this paper provides an acquainted detail of the different HIOAs developed so far over last two decades. Further, incredibly inadequate amount of work has been carried out using HIOA in the field of image segmentation thereby this paper explores and comprehends HIOA based multilevel thresholding image segmentation carried so far and further implements and compare few popular HIOAs (six HIOAs namely Corona virus Herd Immunity Optimization (CHIO), Forensic-Based Investigation Optimization (FBIO), Battle Royale Optimization (BRO), Political Optimizer (PO), Heap-Based Optimizer (HBO) and Human Urbanization Algorithm (HUA)) for color satellite image segmentation. Further, six HIOAs are compared with a popular Swarm based optimization algorithm namely Particle Swarm Optimization (PSO) [15]. For the same, Tsallis entropy and newly developed t-entropy have been exploited as objective functions in this paper. The t-entropy has not been employed for MLT predominantly with HIOA and this paper tends to draw attention to this as a major contribution. Lastly, comparative study using the mentioned objective functions over the color satellite images in MLT domain has been carried out meticulously to investigate the effectiveness of the mentioned HIOA. Some of the Human-Inspired Optimization Algorithms (HIOA) introduced over the years has been tabulated in Table 1 along with its year of introduction, author, application areas and additionally citation has been emphasized as per Google Scholar (Dated: 21.01.2022). Further, line charts shown in Figs. 1 and 2 is employed to depict the citations of different HIOAs (Harmony Search algorithm being the highly cited) and year-wise development of HIOAs respectively. The commonly used abbreviation is tabulated in Table 2.
The remaining sections of the paper are organized as follows: The elements of HIOAs and its common structure literature are put forward in Sect. 2. Section 3 draws attention towards the Classification of HIOAs. Additionally, challenges and open research issues have been evidently brought to light in Sect. 4. Application in MLT domain is emphasized in Sect. 5 that elaborates upon the problem formulation, objective functions utilized, literature review on HIOA in MLT domain over recent years and to end with experimental results along with the discussions on the same. Last but not the least, conclusion alongside few future research directions is offered in subsequent section i.e. Sect. 6.
2 Elements of Human-Inspired Optimization Algorithms (HIOAs) and Its Common Structure
Humans have been extensively recognized as the most ingenious species across the globe acquiring abundant cognitive capabilities and processing power because of which they are referred as 'developed cultural species'. These cultural species so called human have inimitable dependence on culturally or ethnically disseminated knowledge all through the human race (across generations, across society) basically because of the socio-atmosphere around. In society (human society) every individual is speeding towards their objectives delivering the best version of own self and disseminating knowledge in one way or the other may it be in the field of sports, politics, music, stock market or searching a suitable place for oneself. Thereby such rapid movement of human to attain their goals leads to one important concept known as competition in the society. Considering all these, the plentiful available variants of Human inspired Optimization Algorithms, are solely inspired by the different factors associated with human and the supporting environment. This section basically draws attention towards the same i.e. the different resource of inspiration as one of the component. Apart from that, Table 3 summarizes the list of HIOAs emphasizing on the methodologies opt by each, nature of each of the HIOAs, source of inspiration for each HIOAs and number of solutions that each HIOAs generate. Beside, this section also highlights the fact that though different HIOAs tag along expansive set of perceptions however, fundamental methodologies remain the same for all. Despite the fact that HIOA has progressed significantly over the years, it is being widely applied in several research domain and application areas are thereby growing with each passing years. This calls for the necessity of a universal framework / structure making it simpler for the researcher in terms of realization. With this perception in mind, and scrounging the aid from Table 3, a common framework for HIOAs has been planned and the same is projected via a flowchart in Fig. 3. The majority of HIOA tag along the common structure that basically consist of five imperative steps namely Initialization process, Evaluation process, Construction process, Update process and Decision process.
3 Classification of Human-Inspired Optimization Algorithms (HIOAs)
There are 51 Human Inspired Optimization Algorithms have been surveyed as listed in Table 3. In this section, a variety of categorization criterion is taken into account to classify HIOAs and the same has been recorded in Table 4 and diagrammatically depicted in Fig. 4. Further out of the total HIOAs surveyed, number of HIOAs falling under the designated category has been highlighted in Fig. 5. Classifying any algorithms based on source of inspiration is quite common yet effectual. Thereby, in this paper as well the categorization is carried out with in the similar way i.e. using source of inspiration(a scrupulous realm HIOA emulates) and based on the same, categories such as Socio-Political Philosophy (Political HIOA), Socio-Competitive Behavior (Competitive HIOA), Socio-Cultural / Socio-Interaction (Interactive HIOA), Socio-Musical Ideologies (Musical HIOA) and Socio-Emigration / Socio-Colonization (Emigrational HIOA) has been formulated.
4 Major Challenges and Open Research Issues
Although HIOAs have proved its efficacy and recognition in numerous application domains, nevertheless quite a few challenging issues predominantly from theoretical viewpoint related to such algorithms does prevail [16]. The basic methodology of all HIOAs is even though revealed evidently for the researcher however, under what exact circumstance these algorithms needs to be employed remain a foremost challenge. Further, the entire HIOAs comprises of parameters that are essentially reliant on algorithm. The lack of general mechanism to finely tune the parameter scrupulously to enhance the performance of the underlying algorithm is yet an added challenge for the researcher to look upon. Additionally, various HIOAs need to be compared and the conclusion is driven totally based on the performance parameters employed to do the same. With this comes a new challenge that researcher requires to glance ahead i.e. the choice of suitable performance parameters. Furthermore, it is quite evident that HIOAs is associated with diverse applications [Table 3 clearly highlights the same] involving diminutive or restrained problem size, nonetheless, if these algorithm can be scaled up by means of approaches like of parallel computing is still a core inquest yet to be responded.
Few open research issues have been highlighted below:
-
(a)
Constructing a unified mathematical framework for HIOAs. To facilitate such integrated structure, multi-disciplinary approach to learn algorithm from diverse viewpoint is the requirement.
-
(b)
Self-tuning framework for HIOAs is another challenging research issue. To achieve the same, bi-objective process for parameter tuning needs to be considered wherein algorithm to be tuned can be used to tune itself.
-
(c)
Significance of benchmarks and identifying useful benchmarking to test different HIOAs.
-
(d)
Deciding on appropriate performance measures for fairly comparing different HOAs. To achieve the same, unified framework for comparison of algorithm is the necessity.
-
(e)
Introduction of mechanism to scale up HIOAs to handle broad range of predicaments. In order to achieve the same, generalized method need to be established that would cater to the need of variants of problems ranging from small-scale to large scale to real life problems.
-
(f)
Establishing ways and measures to accomplish most favorable balance of Intensification and Diversification in HIOAs.
-
(g)
Launching of techniques to successfully cope up with nonlinear restraints.
-
(h)
Coming up with approaches to utilize HIOAs in the realm of Machine Learning and Deep Learning.
5 Application of HIOAs in Multi-Level Thresholding Domain
Image segmentation [17, 18] is essentially the foremost and elementary procedure to examine and construe the acquired image in innumerable computer vision applications [19] wherein thresholding is considered enormously imperative in this domain. Considering the two categories of thresholding namely bi-level and multilevel, Multilevel Thresholding (MLT) segmentation methods has certain limitation while making a search for the best thresholding values comprehensively to optimize the objective function in which thresholding values increases thus swelling the computational cost. In simpler words, MLT methods turn out to be computationally complex as the number of thresholds grows. In order to address such imperfection and resolve other issues related to MLT, researchers are captivated towards quite a few methodologies inspired either by nature or from human behavior that can be extensively employed.
5.1 Problem Formulation
The fundamental notion of multi-level thresholding is to discover more than one threshold for a given image that further permits the images that has been segmented to accomplish the required criterion by optimizing specific objective function/s, with the threshold values as input parameters [20]. Assume that the image f comprising of L gray levels needs to be segmented into p partitions \(\left( {{\text{C}}_{1} ,{\text{ C}}_{2} ,{ } \ldots ,{\text{C}}_{{\text{i}}} ,{ } \ldots {\text{C}}_{{\text{p}}} } \right)\) using set of (p-1) threshold values \({\text{TH}} = \left( {{\text{t}}_{1} ,{\text{t}}_{2} , \ldots ,{\text{t}}_{{\text{i}}} ,...,{\text{ t}}_{{{\text{p}} - 1}} } \right)\), where \({\text{t}}_{1} < {\text{t}}_{2} < , \ldots .,{ } < {\text{t}}_{{{\text{p}} - 1}}\). For example, L = 256 for an 8-bit image and the grey levels are between 0 and 255 [20]. Hence, a pixel containing certain gray level \({\text{g }}\) belongs to class \({\text{C}}_{{\text{i}}}\) if \({\text{t}}_{{{\text{i}} - 1}} < {\text{g}} < {\text{t}}_{{\text{i}}}\) for \({\text{i}} = 1,{ }2, \ldots ,{\text{p}}\).The technique of determining the set of optimal thresholds \(TH^{opt}\) that optimizes the objective function \({\text{F}}\left( {{\text{TH}}} \right)\) is referred to as single objective thresholding. The mathematical expression is as follows:
For multi objective MLT,
\(F\left( {TH} \right) = \left( {F_{1} \left( {TH} \right), F_{2} \left( {TH} \right), \ldots ,F_{j} \left( {TH} \right), \ldots ,F_{n} \left( {TH} \right)} \right)\) , where \({\text{n}} > 1\).
5.2 Objective Functions
Selection of objective functions plays a crucial role in Multi-Level Thresholding-based image segmentation. Though numerous objective functions are proposed and available widely in the literature however, that makes it even more difficult in terms of selection when an image type varies making objective functions critically dependent on the algorithm as well as image type. This section elaborates on the two objective functions namely Tsallis and t-entropy that have been considered alongside six HIOAs in MLT domain for the color satellite image segmentation.
5.2.1 Tsallis Entropy
Multi-level thresholding [21] seeks to find the best threshold values for segmenting an image into different groups while maintaining a desired property (objective function). The threshold values are used as decision variables in the optimization process, which includes maximization or minimization of an objective function.
Suppose, an image I with L gray levels are classified into K classes \(\left( {C_{1} , C_{2} , \ldots ,C_{i} , \ldots C_{K} } \right)\) using a set of \({\text{nt}}\) threshold point \(T = \left( {th_{1} ,th_{2} , \ldots ,th_{i} ,..., th_{K - 1} } \right)\), where \(th_{1} < th_{2} < , \ldots ., < th_{K - 1}\). Here for 8 bit image \({\text{L}} = 256\) and gray level lie within the range \(\left[ {0,{ }255} \right]\). Therefore, a pixel with gray level g is belongs to class \(C_{i}\) if \(t_{i - 1} < g < t_{i}\) for \(i = 1, 2, \ldots ,K\). Thus single objective thresholding problem is the process of selecting the set of thresholds T′ which optimizes the objective function F(T) such that
where, the objective function F(T) represents the desired property to be satisfied in order to obtain the segmented image I. In this paper, Tsallis entropy has been taken as objective function and the brief mathematical implementation of that is presented as follows.
Tsallis entropy is the generalization of Boltzmann–Gibbs entropy measure which is introduced by Constant in Tsallis [14, 22]. Based on the concept of multi-fractal theory, Tsallis entropy measure can be generalized to a non-extensive system using an entropy formula given in Eq. (3).
where, \(0 \le {\text{p}}_{{\text{i}}} \le 1\) denotes the probability of the state i. In the case of gray level image, it represents the occurrence of the ith gray level in the image. Tsallis parameter q signifies the measure of non-extensivity of the system under consideration. By applying pseudo additivity entropy rule it can be written as:
Here, f and b represent the foreground and background classes of the image which is separated by threshold value \( {\text{t}}\). Suppose,
\(\left\{ \begin{gathered} \left( {{\text{p}}_{1} ,{\text{p}}_{2} , \ldots \ldots \ldots \ldots ,{\text{p}}_{{\text{L}}} } \right)|{\text{p}}_{{\text{i}}} \ge 0,{\text{i}} = 1,{ }2, \ldots ...,{\text{L}}.; \hfill \\ {\text{L}} = {\text{number of discrete gray levels}};{ }\mathop \sum \limits_{{{\text{i}} = 1}}^{{\text{n}}} {\text{p}}_{{\text{i}}} = 1 \hfill \\ \end{gathered} \right\}\) is the probability distribution of the gray level intensities of the image. Then the probability distribution of the f and b classes are given by the following expression:
where,
Consequently for each class, Tsallis entropy can be formulated as:
For bi-thresholding, sum of the both information measure for foreground and background is maximized. Therefore, the finding of optimal threshold can be formulated as follows:
Subject to the following constraints:
\(\left| {P^{f} + P^{b} } \right| - 1 < S < 1 - \left| {P^{f} + P^{b} } \right|\) where,
\(S\left( t \right) = S = S_{q}^{f} \left( t \right) + S_{q}^{b} \left( t \right) + \left( {1 - q} \right) \cdot S_{q}^{f} \left( t \right) \cdot S_{q}^{b} \left( t \right)\)(45).
This formulation can be easily extended to multi-level by the following expression:
where,
Subject to the following constraints:
where, \(P^{1} , P^{2}\) and \(P^{m + 1}\) corresponding to \(S^{1} , S^{2}\) and \(S^{M}\) have been computed using \(t_{1} , t_{2} , \ldots \ldots ,t_{m}\) respectively.
5.2.2 t-entropy
A new measure of entropy called t-entropy has been proposed by Chakraborty et al. in the year 2021 [23]. Suppose, an image I associate with normalized histogram \({\varvec{p}} = \left( {p_{0} ,p_{2} ,p_{3} , \ldots \ldots \ldots \ldots ,p_{L - 1} } \right)|p_{i} \ge 0, i = 0,1,2, \ldots .L - 1; \) where L is the number of gray levels in the image I and \(\mathop \sum \limits_{i = 0}^{L - 1} p_{i} = 1\). Then the t-entropy \(\left( {H_{c} } \right)\) of the image is computed as the following expression:
where, \(c\) is a positive constant.
Now, if there are \(nt = K - 1\) thresholds \(\left( t \right)\), partitioning the normalized histogram into \( K\) classes, then the entropy for each class may be computed as,
where,
where, for ease of computation, two dummy thresholds \(th_{0} = 0, th_{nt} = L - 1\) are introduced with \(th_{0} < th_{1} < \ldots < th_{n - 1} < th_{nt}\). Then the optimum threshold value can be found by
During the experiment, the positive constant \(c\) had been tested over \(\left[ {0.01, 20} \right]\) and found that \(c = 0.1\) is best for multi-level thresholding based image segmentation over the tested datasets.
5.3 Literature Survey on HIOAs Based MLT
Optimization is a methodology of making a design or the system as fully functional as possible that is finely accomplished by a well-tuned algorithm. Nature instead of being fully deterministic is evolutionary, vibrant and resourceful. The nature-inspired algorithms use the best combination and evolution strategy in a given situation However, a new meta-heuristic Human-Inspired Optimization Algorithms (HIOA) is introduced that uses social behavior in human dynasties. Numerous researchers have advocated quite a lot of optimization approaches wherein a variety of entropy has been exploited as an objective functions. The recent literature of HIOA based MLT has been presented in Table 5. Different parameter’s and algorithms abbreviation used in the papers surveyed in Table 3 with its full form is tabularized respectively in Table 6 and Table 7. Total 21 HIOA-MLT papers have been discussed in Table 3 where different papers collected over the years is presented in Fig. 6. Whereas, Fig. 7 indicates the percentage of papers which are surveyed in Table 5 utilizing different types of images.
5.4 Experimental Results and Discussion
This section presents the experimental results that has been computed with the help of six HIOA namely Corona virus Herd Immunity Optimization (CHIO), Forensic-Based Investigation Optimization (FBIO), Battle Royale Optimization (BRO), Political Optimizer (PO), Heap-Based Optimizer (HBO) and Human Urbanization Algorithm (HUA). The result of the six HIOAs considered is further compared with very established Particle Swarm Optimization (PSO) algorithm. Further, Tsallis entropy on one hand and t entropy on the other over color satellite images has been considered as an objective functions. The parameters setting of the corresponding methods have been prearranged in Table 8. All seven HIOA have been used in their original versions. Nevertheless, the parameters of each algorithm have been fine-tuned to determine the best values subsequently to produce a good segmentation result within a rational amount of time. In order to do so, a series of experiments has been performed where segmentation is conducted for different threshold numbers and the test images. The value of each parameter has been selected practically (experimentally) with the objective of coming within the reach of the best segmentation. The experimental study includes the evaluation of Tsallis’ and t entropy, as objective functions. For the reasonable comparison amongst HIOA methodologies, each execution of the tested objective functions considers the Number of Function Evaluations, NFE = 1,000 * d, as stopping criterion of the optimization process. This criterion has been designated to encourage compatibility with previously published works in the literature. The experiments are evaluated considering the number of threshold values (TH) set to 6 and 8 which correspond to the d-dimensional search space in an optimization problem formulation. Furthermore, FE is also a crucial performance index used to measure the efficiency of HIOA. In comparison to computational complexity, FE permits some technical aspects such as the computer system where the experiments run and is implemented, that has direct impact on the running CPU time thereby concentrating only on the capacity of the algorithm to search within the solution space. Each execution of the tested objective functions considers the Number of Function Evaluations, NFE = 1,000*d, as stopping criterion of the optimization process. For measuring the optimization ability of the HIOAs, mean fitness \(\left( {\overline{f}} \right)\) and standard deviation \(\left( \sigma \right)\) have been calculated. On the other hand, segmentation efficiency of the HIOA based models is measured by computing three well known parameters in image segmentation domain i.e. Peak Signal-to-Noise Ratio (PSNR), Feature Similarity Index (FSIM) and Structural Similarity Index (SSIM). MatlabR2018b and Windows-10 OS, × 64-based PC, Intel core i5 CPU with 8 GB RAM are the hardware and software requirements incorporated during the experiment. With the intention to verify the efficiency of different NIOA, experiment is conducted using 20 color satellite images. The mentioned algorithms are tried and explored on images extracted from the site of Indian Space Research Organization (ISRO) [24] [https://bhuvan-app1.nrsc.gov.in/imagegallery/bhuvan.html#]. The original color satellite image is shown in Fig. 8.
5.4.1 Results Over Tsallis Entropy for Color Satellite Image
Figure 9 highlights the visual segmented results of the original image of Fig. 8 using six different HIOA (PO, CHIO, HBO, FBIO, BRO and HUA) which is further compared with one of the popular algorithm i.e. PSO with Tsallis entropy as objective function over 6 and 8 thresholds for a color satellite image. Table 9 projects numerical comparison of various aforesaid HIOA with Tsallis entropy as objective function over 6 and 8 thresholds for the satellite image considering numerous parameters such as fitness function \(\left( {\overline{f}} \right)\), standard deviation (σf), Computational time (Time (sec)), FSIM, PSNR and SSIM. Additionally, the entries that are highlighted in boldface indicate the best performance results. Table 9 clearly bring to light that PO accomplishes the best result over the threshold value (nt = 6) for every parameters taken into account while PSO bestows the worst end result when compared amongst all the six tested HIOAs. Further, for thresholds value (nt = 8) for parameters namely \(\left( {\overline{f}} \right)\), Time (sec), FSIM, PSNR and SSIM, PO exhibits the best result whereas HUA attains the best value in terms of (σf). On the other hand for the same threshold value, yet again PSO bestows the worst end result when compared amongst all the six tested HIOAs. The fitness value of PO is judged against other six HIOAs and PSO considered. A non-parametric significance proof known as Wilcoxon’s rank test has been performed wherein such proof authorizes to estimate differences in the result amid two associated methods. A p-value of less than 0.05 (5% significance level) sturdily supports the condemnation of the null hypothesis, thereby signifying that the best algorithm's results vary statistically noteworthy from those of the other peer algorithms and that the discrepancy is not due to chance. Table 10 tabulates the pair-wise comparison among HIOA (PO vs. CHIO; PO vs. HBO; PO vs. FBIO; PO vs. BRO; and PO vs. PSO) depending on Wilcoxon p-values over Satellite image for Tsallis entropy for 6 and 8 number of thresholds. All the Wilcoxon p-values obtained and thereby projected in Table 10 are less than 0.05 (5% significance level) with h = 1 is an apparent proof not in favor of the null hypothesis, inferring that the PO fitness values for the performance are statistically superior. This further indicates that PO in amalgamation with Tsallis entropy as objective function is proficient enough to bring into being consistent solution irrespective of the threshold values as in all the cases of comparison for both nt = 6 and 8 value of \(p < 0.05\) and \( h = 1\).
5.4.2 Results Over t- Entropy for Color Satellite Image
Figure 10 highlights the visual segmented results of the original image of Fig. 8 using six different HIOA (PO, CHIO, HBO, FBIO, BRO and HUA) which is further compared with one of the popular algorithm i.e. PSO with t-entropy as objective function over 6 and 8 thresholds for a satellite image. Table 11 projects numerical comparison of various aforesaid HIOA with t-entropy as objective function over 6 and 8 thresholds for the satellite image considering numerous parameters such as fitness function \(\left( {\overline{f}} \right)\), standard deviation (σf), Computational time (Time (sec)), FSIM, PSNR and SSIM. Additionally, the entries that are highlighted in boldface indicate the best performance results. Table 11 clearly bring to light that PO accomplishes the best result over the threshold value (nt = 6) for every parameters taken into account except for (σf) wherein CHIO attains the best (σf) value. PSO bestows the worst end result when compared amongst all the six tested HIOAs. It is to be noted that for the same threshold value i.e. nt = 6, HUA in regard to fitness function \(\left( {\overline{f}} \right)\) attains the same value as that of PSO. Further, for thresholds value (nt = 8) for the entire parameters, PO exhibits the best result. On the other hand for the same threshold value, yet again PSO bestows the worst end result when compared amongst all the six tested HIOAs for parameters fitness function \(\left( {\overline{f}} \right)\), Computational time (Time (sec)), FSIM, PSNR and SSIM whereas BRO attains the worst value for standard deviation (σf). The fitness value of PO is judged against other six HIOAs and PSO considered. A non-parametric significance proof known as Wilcoxon’s rank test has been performed wherein such proof authorizes to estimate differences in the result amid two associated methods. A p-value of less than 0.05 (5% significance level) sturdily supports the condemnation of the null hypothesis, thereby signifying that the best algorithm's results vary statistically noteworthy from those of the other peer algorithms and that the discrepancy is not due to chance. Table 12 tabulates the pair-wise comparison among HIOA (PO vs. CHIO; PO vs. HBO; PO vs. FBIO; PO vs. BRO; and PO vs. PSO) depending on Wilcoxon p-values over Satellite image for t-entropy for 6 and 8 number of thresholds. All the Wilcoxon p-values obtained and thereby projected in Table 11 are less than 0.05 (5% significance level) with h = 1 is an apparent proof not in favor of the null hypothesis, inferring that the PO fitness values for the performance are statistically superior. However, Table 11 additionally indicates that PO in amalgamation with t-entropy as objective function is proficient enough to bring into being consistent solution when the threshold value (nt = 8) however, as its clear from the table that when the threshold value (nt = 6), there is no significant difference (as \(p > 0.05\) and \(h = 0\)) between PO and few HIOAs namely CHIO. HBO, FBIO and BRO but PO outperforms HUA and PSO as depicted by the value of p and h (as \(p < 0.05\) and \(h = 1\)).
5.4.3 Discussion on the Performance Comparison Among Different Objective Functions Employed
From the values obtained for different parameters in the tables highlighted above (Tables 9 and 11), it is evident that on comparing different HIOA’s for the satellite images using two prominent objective functions namely Tsallis and t-entropy for different threshold values (nt = 6 and 8), Tsallis entropy outperforms for every HIOA’s as well as PSO over parameters such as fitness function \(\left( {\overline{f}} \right)\), standard deviation (σf), Computational time (Time (sec)), FSIM, PSNR as well as SSIM. It is noteworthy to highlight that different HIOA’s generates high fitness values for all threshold values considering Tsallis entropy to segment the standard color images as compared to segmentation using t-entropy as an objective function. Further, it can be deduced and inferred from the experimental outcome that every HIOAs in combination with Tsallis entropy outperforms the HIOA combination with t-entropy in almost all cases and almost all parameters taken into consideration. On the other hand, considering Tables 10 and 12, it is apparent that for every parameter considered in the scenario, every HIOA’s in combination with Tsallis entropy generates better result and proves superior to that of HIOA combined with t-entropy as an objective function for every threshold values. This surely indicates that though t-entropy is the newly introduced concept rarely employed in image segmentation, Tsallis entropy as an objective function presents an interesting and unconventional choice for satellite image segmentation task and further, same has been clearly highlighted in Fig. 11a, b, c and d. In addition, the another analysis made from the above mentioned tables is that as the number of threshold enhances computational time increases no doubt but values for FSIM, PSNR and SSIM also amplify for the objective function considered under this scenario.
6 Conclusion and Future Research Directions
Amongst the list of algorithms instigated and existing in literature, deciding upon an algorithm entails not just a meticulous understanding of its theoretical fundamentals but also require systematically comprehending upon the different components of algorithm along with its different parameters and application areas. This work attempted and strived towards concentrating on these issues and talks about pertinent conceptions related to HIOAs such as components, classification, common structure, application areas, work carried out till date and many more. A number of optimization technique inspired from human behavior and intelligence for MLT color satellite image segmentation problem considering two significant objective functions i.e. Tsallis’ and t-entropy has been discussed in this paper. To reveal the connotation of HIOAs in the field of MLT image segmentation six different algorithms namely Corona virus Herd Immunity Optimization (CHIO), Forensic-Based Investigation Optimization (FBIO), Battle Royale Optimization (BRO), Political Optimizer (PO), Heap-Based Optimizer (HBO) and Human Urbanization Algorithm (HUA) has been implemented and further compared among themselves and with one of the popular Swarm based optimization algorithm i.e. Particle Swarm Optimization (PSO). The comparison is made taking into account numerous parameters such as fitness function \(\left( {\overline{f}} \right)\), standard deviation \(\left( {\sigma_{f} } \right)\), Computational time (Time (sec)), FSIM, PSNR and SSIM based on the evaluation of two predominant objective function as revealed earlier (Tsallis’ and t-entropy). The results and contribution of this paper have been summarized as follows:
-
(a)
The numerical outcome demonstrates that Political Optimizer (PO) confirmed and exhibited its competence and accuracy over other HIOA’s (as depicted in Sect. 5.4) and PSO signifying that PO is most suitable HIOA for MLT image segmentation process of color satellite image with Tsallis’ entropy as objective function.
-
(b)
Though t-entropy as the objective function is the recently introduced and rarely employed in image segmentation, Tsallis entropy as an objective function under different circumstances provides an attention-grabbing result and thus can be an eccentric preference for satellite image segmentation task.
-
(c)
Both objective functions considered in this paper in connection with different HIOA are though suitable for color satellite image segmentation however, result of t-entropy as the objective function is dependent on the threshold value.
-
(d)
Lastly as mentioned earlier, it is to be noted that as the number of threshold increases, values for FSIM, PSNR and SSIM also intensifies for both of the objective function considered under this scenario. Also, with tsallis entropy as objective function, different HIOAs as well as PSO considered for the experimental purpose generated high fitness values irrespective of threshold values considered.
No doubt, HIOAs have evidently proved itself as an effective mechanism to unravel intricate real-world optimization problems; it can still be further explored. With this, few research directions has been projected below that shall hopefully turn out to be useful for the researcher to excavate and discover HIOAs further.
-
(a)
Proficient but less obscure HIOA (lesser number of operators, tuning parameters etc.) is the need of an hour. Parameterless HIOAs can be good work in future [25, 26].
-
(b)
Development of HIOAs based image clustering especially histogram based image clustering should an emergent research topic [27,28,29,30]
-
(c)
Exploring and analyzing each HIOAs that fits the best for the problem one intend to resolve at times is not just tiresome but also not realistic so more parameters need to be identified to classify HIOAs making it easier for the researcher to select the suitable one.
-
(d)
From the above table i.e. Table 5 that highlights the literature review of HIOA on MLT domain undoubtedly point out that maximum HIOAs has been employed for MLT image segmentation for standard gray scale images (Fig. 7) however, very less work has been performed for satellite images, medical images and even standard color images. Exploring and applying HIOAs over these variant of images could be a good work.
-
(e)
Also, Table 5 brings to lights the usage of different objective functions, wherein maximum work has been done with Otsu and Kapur as objective functions. Exploring more of the existing objective function and applying the same or applying Two-Dimensional (2D) objective functions like 2D Otsu, 2D Tsallis, 2D-Renyi, 2D Cross etc., over diverse HIOAs in MLT domain could be interesting as well as challenging.
-
(f)
Hybridization and parallel models has always proved efficient and could be a great future research. In this regard, hybridization [31] of for instance Social Learning Optimization inspired Archimedes Optimization Algorithm or a novel PSO model based on Simulating Cohort Intelligence. Recently human intelligences or human social communication based PSO models are developed and provided outstanding results [15, 32, 33].
-
(g)
Though t-entropy generated acceptable result, however, it could not be proved commendable when compared with the other objective functions under similar circumstances. Consequently, improvised variant of t-entropy could be a good work.
-
(h)
Initial parameters are heuristically assumed so there is always a scope to find a specific / standard method to fix, control and tune the initial parameters. This could be looked upon. Introducing novel performance measures to evaluate the success of an algorithm is also a necessity.
-
(i)
Lastly, inspiration taken from behavior of quantum particles to develop metaheuristic optimization algorithms [34] is as well gaining popularity and applied in numerous application domain. In this perspective, introducing a quantum inspired HIOA could be a great research work that can be conducted in future.
References
Zhang H, Zhou J, Zhang Y, Lu Y, Wang Y (2013) Culture belief based multi-objective hybrid differential evolutionary algorithm in short term hydrothermal scheduling. Energy Convers Manage 65:173–184
Baykasoğlu A, Hamzadayi A, Köse SY (2014) Testing the performance of teaching–learning based optimization (TLBO) algorithm on combinatorial problems: flow shop and job shop scheduling cases. Inf Sci 276:204–218
Sun X, Zhang Y, Ren X, Chen K (2015) Optimization deployment of wireless sensor networks based on culture–ant colony algorithm. Appl Math Comput 250:58–70
Chen J, Cheng S, Chen Y, Xie Y, Shi Y (2015) Enhanced brain storm optimization algorithm for wireless sensor networks deployment. In: Tan Ying et al (eds) International conference in swarm intelligence. Springer, Cham, pp 373–381
Askari Q, Younas I (2021) Improved political optimizer for complex landscapes and engineering optimization problems. Expert Syst Appl 182:115178
Kashan AH (2011) An efficient algorithm for constrained global optimization and application to mechanical engineering design: league championship algorithm (LCA). Comput Aided Des 43(12):1769–1792
Tuba E, Strumberger I, Zivkovic D, Bacanin N, Tuba, M (2018) Mobile robot path planning by improved brain storm optimization algorithm. In 2018 IEEE congress on evolutionary computation (CEC) (pp. 1–8). IEEE.
Huang L, Duan H, Wang Y (2014) Hybrid bio-inspired lateral inhibition and imperialist competitive algorithm for complicated image matching. Optik 125(1):414–418
Maheswari B, Mohanapriya N, Raja NSM (2018) Robust RGB image thresholding with Shannon’s entropy and Jaya algorithm. In 2018 IEEE international conference on system, computation, automation and networking (ICSCA) (pp. 1–5). IEEE.
Zhang M, Jiang W, Zhou X, Xue Y, Chen S (2019) A hybrid biogeography-based optimization and fuzzy C-means algorithm for image segmentation. Soft Comput 23(6):2033–2046
Ameur M, Habba M, Jabrane Y (2019) A comparative study of nature inspired optimization algorithms on multilevel thresholding image segmentation. Multimedia Tools App 78(24):34353–34372
Rai R, Das A, Dhal KG (2022) Nature-inspired optimization algorithms and their significance in multi-thresholding image segmentation: an inclusive review. Evol Syst. https://doi.org/10.1007/s12530-022-09425-5
Dhal KG, Das A, Ray S, Gálvez J, Das S (2020) Nature-inspired optimization algorithms and their application in multi-thresholding image segmentation. Arch Comput Methods Eng 27(3):855–888
Kumar A, Nadeem M, Banka H (2022) Nature inspired optimization algorithms: a comprehensive overview. Evolv Syste. https://doi.org/10.1007/s12530-022-09432-6
Liu Y, Niu B (2012) A novel PSO model based on simulating human social communication behavior. Discrete Dyn Nat Soc 2012:1–21
Yang XS (2020) Nature-inspired optimization algorithms: challenges and open problems. J Comput Sci 46:101104
Xing Z, Jia H (2020) An improved thermal exchange optimization based GLCM for multi-level image segmentation. Multimedia Tools App. https://doi.org/10.1007/s11042-019-08566-1
Chatterjee A, Siarry P, Nakib A, Blanc R (2012) An improved biogeography based optimization approach for segmentation of human head CT-scan images employing fuzzy entropy. Eng Appl Artif Intell 25(8):1698–1709
Xing Z, Jia H (2020) Modified thermal exchange optimization based multilevel thresholding for color image segmentation. Multimedia Tools App 79(1):1137–1168
Wang M, Pan G, Liu Y (2019) A novel imperialist competitive algorithm for multithreshold image segmentation. Math Problems Eng 2019:1–18
Pare S, Kumar A, Singh GK, Bajaj V (2020) Image segmentation using multilevel thresholding: a research review. Iran J Sci Technol Trans Electric Eng 44(1):1–29
Ray S, Parai S, Das A, Dhal KG, Naskar PK (2022) Cuckoo search with differential evolution mutation and Masi entropy for multi-level image segmentation. Multimedia Tools App 81(3):4073–4117
Chakraborty S, Paul D, Das S (2021) t-entropy: a new measure of uncertainty with some applications. arXiv preprint arXiv:2105.00316.
Dhal KG, Ray S, Das A, Gálvez J, Das S (2019) Fuzzy multi-level color satellite image segmentation using nature-inspired optimizers: a comparative study. J Indian Soc Remote Sens 47(8):1391–1415
Dhal KG, Sahoo S, Das A, Das S (2020) Effect of population size over parameter-less firefly algorithm. In: Dey N (ed) Applications of firefly algorithm and its variants. Springer, Singapore, pp 237–266
Ghosal D, Das A, Dhal KG (2022) A comparative study among clustering techniques for leaf segmentation in rosette plants. Pattern Recognit Image Anal 32(1):129–141
Dhal KG, Das A, Ray S, Gálvez J (2021) Randomly attracted rough firefly algorithm for histogram based fuzzy image clustering. Knowl-Based Syst 216:106814
Das A, Dhal KG, Ray S, Gálvez J (2022) Histogram-based fast and robust image clustering using stochastic fractal search and morphological reconstruction. Neural Comput Appl 34(6):4531–4554
Dhal KG, Gálvez J, Ray S, Das A, Das S (2020) Acute lymphoblastic leukemia image segmentation driven by stochastic fractal search. Multimedia Tools Appl 79(17):12227–12255
Dhal KG, Das A, Ray S, Sarkar K, Gálvez J (2021) An analytical review on rough set based image clustering. Arch Comput Methods Eng, 1–30.
Moghdani R, Elaziz MA, Mohammadi D, Neggaz N (2021) An improved volleyball premier league algorithm based on sine cosine algorithm for global optimization problem. Eng Comput 37(4):2633–2662
Tanweer MR, Sundaram S (2014) Human cognition inspired particle swarm optimization algorithm. In 2014 IEEE ninth international conference on intelligent sensors, sensor networks and information processing (ISSNIP) (pp. 1–6). IEEE.
Tanweer MR, Al-Dujaili A, Suresh S (2015) Empirical assessment of human learning principles inspired PSO algorithms on continuous black-box optimization testbed. In: Panigrahi BK et al (eds) International conference on swarm, evolutionary, and memetic computing. Springer, Cham, pp 17–28
Alvarez-Alvarado MS, Alban-Chacon FE, Lamilla-Rubio EA, Rodriguez-Gallegos CD, Velásquez W (2021) Three novel quantum-inspired swarm optimization algorithms using different bounded potential fields. Sci Rep 11(1):1–22
Reynolds RG (1994) An introduction to cultural algorithms. Proc Third Ann Conf Evol Program 24:131–139
Liu J, Gao H, Zhang J, Dai B (2007, December). Urban power network substation optimal planning based on geographic culture algorithm. In 2007 international power engineering conference (IPEC 2007) (pp. 500–504). IEEE.
Chen B, Zhao L, Lu JH (2009, April). Wind power forecast using RBF network and culture algorithm. In 2009 international conference on sustainable power generation and supply (pp. 1–6). IEEE.
Verma HK, Singh P (2018) Optimal reconfiguration of distribution network using modified culture algorithm. J Instit Eng B 99(6):613–622
Vafaei A, Ghaedi AM, Avazzadeh Z, Kiarostami V, Agarwal S, Gupta VK (2021) Removal of hydrochlorothiazide from molecular liquids using carbon nanotubes: radial basis function neural network modeling and culture algorithm optimization. J Mol Liq 324:114766
Si-hua C (2012) A novel culture algorithm and it’s application in knowledge integration. Int Inform Instit 15(11):4847
Chen SH, Tao CQ (2009) New knowledge integration strategy based on culture algorithm framework [J]. J Chinese Comput Syst 30(10):2030–2033
Naitali A, Giri F (2010, June). Wiener and Hammerstein nonlinear systems identification using hybrid genetic and swarming intelligence based culture algorithm. In Proceedings of the 2010 American control conference (pp. 4528–4533). IEEE.
Chen X, Zhang L, Zhang Z (2020) An integrated model for maintenance policies and production scheduling based on immune–culture algorithm. Proc Instit Mech Eng, Part O 234(5):651–663
Liu S, Yang D, Ge C, Huang W (2021, July). Research on fault-tolerant scheduling of precedent tasks based on primary/backup and culture algorithm. In 2021 IEEE international conference on power, intelligent computing and systems (ICPICS) (pp. 445–449). IEEE.
Guo YN, Xiao D, Zhang S, Cheng J (2011) Multi-spectral remote sensing images classification method based on adaptive immune clonal selection culture algorithm. In: Huang D-S et al (eds) International conference on intelligent computing. Springer, Berlin, Heidelberg, pp 319–326
Meng FR, Hao XY, Zhou Y (2009) Selective neural network ensemble approach based on cultural algorithm. J Chinese Comput Syst 5:933–936
Guang-jun, YANG (2012). Mining association rules based on immune clone culture algorithm. Comput Eng Sci, 3.
Zhou J, Bai T, Suo C (2008, August). The SVM optimized by culture genetic algorithm and its application in forecasting share price. In 2008 IEEE international conference on granular computing (pp. 838–843). IEEE.
Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68
Yıldız AR (2008) Hybrid Taguchi-harmony search algorithm for solving engineering optimization problems. Int J Ind Eng 15(3):286–293
Asad A, Deep K (2016) Applications of harmony search algorithm in data mining a survey. In Pant, M. et al. (Eds.), Proceedings of fifth international conference on soft computing for problem solving. Springer: Singapore, pp 863–874.
Degertekin SO (2008) Optimum design of steel frames using harmony search algorithm. Struct Multidiscip Optim 36(4):393–401
Manjarres D, Landa-Torres I, Gil-Lopez S, Del Ser J, Bilbao MN, Salcedo-Sanz S, Geem ZW (2013) A survey on applications of the harmony search algorithm. Eng Appl Artif Intell 26(8):1818–1831
Dhal KG, Fister Jr I, Das S (2017, October). Parameterless harmony search for image multi-thresholding. In 4th student computer science research conference (StuCosRec-2017) (pp. 5–12).
Oliva D, Cuevas E, Pajares G, Zaldivar D, Perez-Cisneros M (2013) Multilevel thresholding segmentation based on harmony search optimization. J Appl Math, 2013.
Cuevas E, Zaldívar D, Perez-Cisneros M (2016) Otsu and Kapur segmentation based on harmony search optimization. In Applications of evolutionary computation in image processing and pattern recognition (pp. 169–202). Springer, Cham.
Erwin S, Saputri W (2018) Hybrid multilevel thresholding and improved harmony search algorithm for segmentation. Int J Electric Comput Eng (IJECE) 8(6):4593–4602
Ray T, Liew KM (2003) Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans Evol Comput 7(4):386–396
Dai C, Zhu Y, Chen W (2006, November) Seeker optimization algorithm. In International conference on computational and information science (pp. 167–176). Springer, Berlin, Heidelberg.
Dai C, Chen W, Zhu Y (2009) Seeker optimization algorithm for digital IIR filter design. IEEE Trans Industr Electron 57(5):1710–1718
Dai C, Chen W, Zhu Y, Zhang X (2009) Seeker optimization algorithm for optimal reactive power dispatch. IEEE Trans Power Syst 24(3):1218–1231
Shaw B, Mukherjee V, Ghoshal SP (2012) Solution of economic dispatch problems by seeker optimization algorithm. Expert Syst Appl 39(1):508–519
Zhu Y, Dai C, Chen W (2014) Seeker optimization algorithm for several practical applications. Int J Comput Intell Syst 7(2):353–359
Atashpaz-Gargari E, Lucas C (2007, September). Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In 2007 IEEE congress on evolutionary computation (pp. 4661–4667). IEEE.
Hadidi A, Hadidi M, Nazari A (2013) A new design approach for shell-and-tube heat exchangers using imperialist competitive algorithm (ICA) from economic point of view. Energy Convers Manage 67:66–74
Lucas C, Nasiri-Gheidari Z, Tootoonchian F (2010) Application of an imperialist competitive algorithm to the design of a linear induction motor. Energy Convers Manage 51(7):1407–1411
Niknam T, Fard ET, Pourjafarian N, Rousta A (2011) An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering. Eng Appl Artif Intell 24(2):306–317
Khabbazi A, Atashpaz-Gargari E, Lucas C (2009) Imperialist competitive algorithm for minimum bit error rate beamforming. Int J Bio-Inspired Comput 1(1–2):125–133
Hosseini S, Al Khaled A (2014) A survey on the imperialist competitive algorithm metaheuristic: implementation in engineering domain and directions for future research. Appl Soft Comput 24:1078–1094
Ahmadi MA, Ebadi M, Shokrollahi A, Majidi SMJ (2013) Evolving artificial neural network and imperialist competitive algorithm for prediction oil flow rate of the reservoir. Appl Soft Comput 13(2):1085–1098
Nazari-Shirkouhi S, Eivazy H, Ghodsi R, Rezaie K, Atashpaz-Gargari E (2010) Solving the integrated product mix-outsourcing problem using the imperialist competitive algorithm. Expert Syst Appl 37(12):7615–7626
Coelho LDS, Afonso LD, Alotto P (2012) A modified imperialist competitive algorithm for optimization in electromagnetics. IEEE Trans Magn 48(2):579–582
Taher SA, Fini MH, Aliabadi SF (2014) Fractional order PID controller design for LFC in electric power systems using imperialist competitive algorithm. Ain Shams Eng J 5(1):121–135
Abd-Elazim SM, Ali ES (2016) Imperialist competitive algorithm for optimal STATCOM design in a multimachine power system. Int J Electr Power Energy Syst 76:136–146
Razmjooy N, Mousavi BS, Soleymani F (2013) A hybrid neural network imperialist competitive algorithm for skin color segmentation. Math Comput Model 57(3–4):848–856
Razmjooy N, Mousavi BS, Sadeghi B, Khalilpour M (2011, July). Image thresholding optimization based on imperialist competitive algorithm. In 3rd Iranian conference on electrical and electronics engineering (ICEEE2011) (pp. 1–10). Iran: Islamic Azad University of Gonabad.
Hajihassani M, Armaghani DJ, Marto A, Mohamad ET (2015) Ground vibration prediction in quarry blasting through an artificial neural network optimized by imperialist competitive algorithm. Bull Eng Geol Env 74(3):873–886
Jasour AM, Atashpaz E, Lucas C (2008) Vehicle fuzzy controller design using imperialist competitive algorithm. In Second first Iranian joint congress on fuzzy and intelligent systems, Tehran, Iran (pp. 1–6).
Ghasemi M, Ghavidel S, Ghanbarian MM, Massrur HR, Gharibzadeh M (2014) Application of imperialist competitive algorithm with its modified techniques for multi-objective optimal power flow problem: a comparative study. Inf Sci 281:225–247
Shokrollahpour E, Zandieh M, Dorri B (2011) A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. Int J Prod Res 49(11):3087–3103
Enayatifar R, Abdullah AH, Lee M (2013) A weighted discrete imperialist competitive algorithm (WDICA) combined with chaotic map for image encryption. Opt Lasers Eng 51(9):1066–1077
Kashan AH (2009, December). League championship algorithm: a new algorithm for numerical function optimization. In 2009 international conference of soft computing and pattern recognition (pp. 43–48). IEEE.
Kashan AH (2014) League Championship Algorithm (LCA): an algorithm for global optimization inspired by sport championships. Appl Soft Comput 16:171–200
Bouchekara HREH, Abido MA, Chaib AE, Mehasni R (2014) Optimal power flow using the league championship algorithm: a case study of the Algerian power system. Energy Convers Manage 87:58–70
Abdulhamid SM, Latiff MSA, Idris I (2015). Tasks scheduling technique using league championship algorithm for makespan minimization in IAAS cloud. arXiv preprint arXiv:1510.03173.
Wangchamhan T, Chiewchanwattana S, Sunat K (2017) Efficient algorithms based on the k-means and Chaotic League Championship Algorithm for numeric, categorical, and mixed-type data clustering. Expert Syst Appl 90:146–167
Alimoradi MR, Kashan AH (2018) A league championship algorithm equipped with network structure and backward Q-learning for extracting stock trading rules. Appl Soft Comput 68:478–493
Eita MA, Fahmy MM (2010) Group counseling optimization: a novel approach. In Research and development in intelligent systems XXVI (pp. 195–208). Springer: London.
Eita MA, Fahmy MM (2014) Group counseling optimization. Appl Soft Comput 22:585–604
Ali H, Khan FA (2013, June). Group counseling optimization for multi-objective functions. In 2013 IEEE congress on evolutionary computation (pp. 705–712). IEEE.
Lv W, He C, Li D, Cheng S, Luo S, Zhang X (2010) Election campaign optimization algorithm. Procedia Comput Sci 1(1):1377–1386
Zhang H, Lv WG, Cheng SY, Luo SM, Zhang XW (2011) Election campaign optimization algorithm for design of pressure vessel. Adv Mater Res 308:15–20
Abubakar H, Sathasivam S (2020) Comparing election algorithm and election campaign optimization algorithm. AIP Conf Proc 2266(1):040006
Xu Y, Cui Z, Zeng J (2010) Social emotional optimization algorithm for nonlinear constrained optimization problems. In: Panigrahi BK (ed) International conference on swarm, evolutionary, and memetic computing. Springer, Berlin, Heidelberg, pp 583–590
Cui Z, Shi Z, Zeng J (2010) Using social emotional optimization algorithm to direct orbits of chaotic systems. In: Panigrahi BK (ed) International conference on swarm, evolutionary, and memetic computing. Springer, Berlin, Heidelberg, pp 389–395
Rao RV, Savsani VJ, Vakharia DP (2011) Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315
Toğan V (2012) Design of planar steel frames using teaching–learning based optimization. Eng Struct 34:225–232
Rao RV, Savsani VJ, Vakharia DP (2012) Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1–15
Rao RV, Patel V (2013) Multi-objective optimization of heat exchangers using a modified teaching-learning-based optimization algorithm. Appl Math Model 37(3):1147–1162
Yu K, Wang X, Wang Z (2016) An improved teaching-learning-based optimization algorithm for numerical and engineering optimization problems. J Intell Manuf 27(4):831–843
Zhang Y, Jin Z, Chen Y (2020) Hybrid teaching–learning-based optimization and neural network algorithm for engineering design optimization problems. Knowl-Based Syst 187:104836
Rao RV, More KC (2015) Optimal design of the heat pipe using TLBO (teaching–learning-based optimization) algorithm. Energy 80:535–544
Degertekin SO, Hayalioglu MS (2013) Sizing truss structures using teaching-learning-based optimization. Comput Struct 119:177–188
Rao RV, Patel V (2013) Multi-objective optimization of two stage thermoelectric cooler using a modified teaching–learning-based optimization algorithm. Eng Appl Artif Intell 26(1):430–445
Chatterjee S, Mukherjee V (2016) PID controller for automatic voltage regulator using teaching–learning based optimization technique. Int J Electr Power Energy Syst 77:418–429
Ji X, Ye H, Zhou J, Yin Y, Shen X (2017) An improved teaching-learning-based optimization algorithm and its application to a combinatorial optimization problem in foundry industry. Appl Soft Comput 57:504–516
Sultana S, Roy PK (2014) Optimal capacitor placement in radial distribution systems using teaching learning based optimization. Int J Electr Power Energy Syst 54:387–398
Anbazhagan S (2021) Application of teaching learning based optimization in multilevel image thresholding. ICTACT J Image Video Process 11(4):2413–2422
Shi Y (2011) Brain storm optimization algorithm. In: Tan Y et al (eds) International conference in swarm intelligence. Springer, Berlin, Heidelberg, pp 303–309
Pourpanah F, Shi Y, Lim CP, Hao Q, Tan CJ (2019) Feature selection based on brain storm optimization for data classification. Appl Soft Comput 80:761–775
Narmatha C, Eljack SM, Tuka AARM, Manimurugan S, Mustafa M (2020) A hybrid fuzzy brain-storm optimization algorithm for the classification of brain tumor MRI images. J Ambient Intell Humanized Comput. https://doi.org/10.1007/s12652-020-02470-5
Papa JP, Rosa GH, de Souza AN, Afonso LC (2018) Feature selection through binary brain storm optimization. Comput Electr Eng 72:468–481
Zhang WQ, Zhang Y, Peng C (2019) Brain storm optimization for feature selection using new individual clustering and updating mechanism. Appl Intell 49(12):4294–4302
Tuba E, Jovanovic R, Zivkovic D, Beko M, Tuba M (2019) Clustering algorithm optimized by brain storm optimization for digital image segmentation. In 2019 7th international symposium on digital forensics and security (ISDFS) (pp. 1–6). IEEE.
Xue J, Wu Y, Shi Y, Cheng S (2012, June) Brain storm optimization algorithm for multi-objective optimization problems. In International conference in swarm intelligence (pp. 513–519). Springer: Berlin, Heidelberg.
Cheng S, Shi Y, Qin Q, Gao S (2013, April) Solution clustering analysis in brain storm optimization algorithm. In 2013 IEEE symposium on swarm intelligence (SIS) (pp. 111–118). IEEE.
Xue X, Lu J (2020) A compact brain storm algorithm for matching ontologies. IEEE Access 8:43898–43907
Li J, Duan H (2015) Simplified brain storm optimization approach to control parameter optimization in F/A-18 automatic carrier landing system. Aerosp Sci Technol 42:187–195
Ahmadi-Javid A (2011, June) Anarchic society optimization: a human-inspired method. In 2011 IEEE congress of evolutionary computation (CEC) (pp. 2586–2592). IEEE.
Shayeghi H, Dadashpour J (2012) Anarchic society optimization based PID control of an automatic voltage regulator (AVR) system. Electric Electron Eng 2(4):199–207
Ahmadi-Javid A, Hooshangi-Tabrizi P (2012, July) An anarchic society optimization algorithm for a flow-shop scheduling problem with multiple transporters between successive machines. In International conference on industrial engineering and operations management (ICIEOM), Istanbul, Turkey (pp. 3–6).
Bozorgi A, Bozorg-Haddad O, Rajabi MM, Latifi M, Chu X (2017) Applications of the anarchic society optimization (ASO) algorithm for optimizing operations of single and continuous multi-reservoir systems. J Water Supply: Res Technol 66(7):556–573
Bozorg-Haddad O, Latifi M, Bozorgi A, Rajabi MM, Naeeni ST, Loáiciga HA (2018) Development and application of the anarchic society algorithm (ASO) to the optimal operation of water distribution networks. Water Sci Technol 18(1):318–332
Kulkarni AJ, Durugkar IP, Kumar M (2013, October) Cohort intelligence: a self supervised learning behavior. In 2013 IEEE international conference on systems, man, and cybernetics (pp. 1396–1400). IEEE.
Krishnasamy G, Kulkarni AJ, Paramesran R (2014) A hybrid approach for data clustering based on modified cohort intelligence and K-means. Expert Syst Appl 41(13):6009–6016
Kulkarni AJ, Baki MF, Chaouch BA (2016) Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems. Eur J Oper Res 250(2):427–447
Kulkarni O, Kulkarni N, Kulkarni AJ, Kakandikar G (2018) Constrained cohort intelligence using static and dynamic penalty function approach for mechanical components design. Int J Parallel Emergent Distrib Syst 33(6):570–588
Shastri AS, Nargundkar A, Kulkarni AJ, Sharma KK (2020) Multi-cohort intelligence algorithm for solving advanced manufacturing process problems. Neural Comput Appl 32(18):15055–15075
Kuo HC, Lin CH (2013) Cultural evolution algorithm for global optimizations and its applications. J Appl Res Technol 11(4):510–522
Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144
El-Fergany A (2015) Optimal allocation of multi-type distributed generators using backtracking search optimization algorithm. Int J Electr Power Energy Syst 64:1197–1205
Chaib AE, Bouchekara HREH, Mehasni R, Abido MA (2016) Optimal power flow with emission and non-smooth cost functions using backtracking search optimization algorithm. Int J Electr Power Energy Syst 81:64–77
Guney K, Durmus A, Basbug S (2014) Backtracking search optimization algorithm for synthesis of concentric circular antenna arrays. Int J Antennas Propagation, 2014.
Chen L, Sun N, Zhou C, Zhou J, Zhou Y, Zhang J, Zhou Q (2018) Flood forecasting based on an improved extreme learning machine model combined with the backtracking search optimization algorithm. Water 10(10):1362
Gandomi AH (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183
Rizk-Allah RM, Hassanien AE (2022) COVID-19 Forecasting Based on an Improved Interior Search Algorithm and Multilayer Feed-Forward Neural Network. In Medical informatics and bioimaging using artificial intelligence (pp. 129–152). Springer: Cham.
Talatahari S, Azizi M (2020) Optimum design of building structures using tribe-interior search algorithm. Structures 28:1616–1633
Gandomi AH, Roke DA (2014, December). Engineering optimization using interior search algorithm. In 2014 IEEE symposium on swarm intelligence (pp. 1–7). IEEE.
Arora S, Sharma M, Anand P (2020) A novel chaotic interior search algorithm for global optimization and feature selection. Appl Artif Intell 34(4):292–328
Moosavian N, Roodsari BK (2014) Soccer league competition algorithm: a novel meta-heuristic algorithm for optimal design of water distribution networks. Swarm Evol Comput 17:14–24
Moosavian N (2015) Soccer league competition algorithm for solving knapsack problems. Swarm Evol Comput 20:14–22
Moosavian N, Roodsari BK (2013) Soccer league competition algorithm, a new method for solving systems of nonlinear equations. Int J Intell Sci 4(01):7
Ebrahimi S, Tabatabaei S (2020) Using clustering via soccer league competition algorithm for optimizing power consumption in wsns (wireless sensor networks). Wireless Pers Commun 113(4):2387–2402
Moosavian N, Moosavian H (2017) Testing soccer league competition algorithm in comparison with ten popular meta-heuristic algorithms for sizing optimization of truss structures. Int J Eng 30(7):926–936
Ghorbani N, Babaei E (2014) Exchange market algorithm. Appl Soft Comput 19:177–187
Ghorbani N, Babaei E (2016) Exchange market algorithm for economic load dispatch. Int J Electr Power Energy Syst 75:19–27
Rajan A, Malakar T (2016) Optimum economic and emission dispatch using exchange market algorithm. Int J Electr Power Energy Syst 82:545–560
Sathya PD, Kalyani R, Sakthivel VP (2021) Color image segmentation using kapur, otsu and minimum cross entropy functions based on exchange market algorithm. Expert Syst Appl 172:114636
Emami H, Derakhshan F (2015) Election algorithm: A new socio-politically inspired strategy. AI Commun 28(3):591–603
Luo Y, Chen Y, Chen Q, Liang Q (2018, November) A new election algorithm for DPos consensus mechanism in blockchain. In 2018 7th international conference on digital home (ICDH) (pp. 116–120). IEEE.
Sathasivam S, Mansor M, Kasihmuddin MSM, Abubakar H (2020) Election algorithm for random k satisfiability in the Hopfield neural network. Processes 8(5):568
Saidi A, Benahmed K, Seddiki N (2020) Secure cluster head election algorithm and misbehavior detection approach based on trust management technique for clustered wireless sensor networks. Ad Hoc Netw 106:102215
Savsani P, Savsani V (2016) Passing vehicle search (PVS): A novel metaheuristic algorithm. Appl Math Model 40(5–6):3951–3978
Kumar S, Tejani GG, Pholdee N, Bureerat S (2021) Multi-objective passing vehicle search algorithm for structure optimization. Expert Syst Appl 169:114511
Ram Prabhu T, Savsani V, Parsana S, Radadia N, Sheth M, Sheth N (2018) Multi-objective optimization of EDM process parameters by using Passing Vehicle Search (PVS) algorithm. Defect Diffusion Forum 382:138–146
Ladumor DP, Trivedi IN, Bhesdadiya RH, Jangir P (2017, February) A passing vehicle search algorithm for solution of optimal power flow problems. In 2017 third international conference on advances in electrical, electronics, information, communication and bio-informatics (AEEICB) (pp. 268–273). IEEE.
Chentoufi MA, Ellaia R (2021) A novel multiobjective passing vehicle search algorithm for signal timing optimization. Comput Sci 16(2):775–792
Rao R (2016) Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19–34
Rao RV, Saroj A (2017) A self-adaptive multi-population based Jaya algorithm for engineering optimization. Swarm Evol Comput 37:1–26
Yu K, Qu B, Yue C, Ge S, Chen X, Liang J (2019) A performance-guided JAYA algorithm for parameters identification of photovoltaic cell and module. Appl Energy 237:241–257
Rao RV, Rai DP, Balic J (2016) Surface grinding process optimization using Jaya algorithm. Comput Intell Data Mining 2:487–495
Satapathy SC, Rajinikanth V (2018) Jaya algorithm guided procedure to segment tumor from brain MRI. J Optim 2018.
Kaveh A, Zolghadr A (2016) A novel meta-heuristic algorithm: tug of war optimization. Iran Univ Sci Technol 6(4):469–492
Kaveh A, Zolghadr A (2017) Guided modal strain energy-based approach for structural damage identification using tug-of-war optimization algorithm. J Comput Civ Eng 31(4):04017016
Nguyen T, Hoang B, Nguyen G, Nguyen BM (2020) A new workload prediction model using extreme learning machine and enhanced tug of war optimization. Procedia Comput Sci 170:362–369
Kaveh A, Shokohi F (2016) Optimum design of laterally-supported castellated beams using tug of war optimization algorithm. Struct Eng Mech 3(58):533–553
Kaveh A, Shokohi F, Ahmadi B (2017) Optimal analysis and design of water distribution systems using tug of war optimization algorithm. دانشگاه علم و صنعت ایران 7(2):193–210
Satapathy S, Naik A (2016) Social group optimization (SGO): a new population evolutionary optimization technique. Complex Intell Syst 2(3):173–203
Naik A, Satapathy SC, Ashour AS, Dey N (2018) Social group optimization for global optimization of multimodal functions and data clustering problems. Neural Comput Appl 30(1):271–287
Dey N, Rajinikanth V, Ashour AS, Tavares JMR (2018) Social group optimization supported segmentation and evaluation of skin melanoma images. Symmetry 10(2):51
Praveen SP, Rao KT, Janakiramaiah B (2018) Effective allocation of resources and task scheduling in cloud environment using social group optimization. Arab J Sci Eng 43(8):4265–4272
Singh AK, Kumar A, Mahmud M, Kaiser MS, Kishore A (2021) COVID-19 infection detection from chest X-ray images using hybrid social group optimization and support vector classifier. Cogn Comput 1–13.
Liu ZZ, Chu DH, Song C, Xue X, Lu BY (2016) Social learning optimization (SLO) algorithm paradigm and its application in QoS-aware cloud service composition. Inf Sci 326:315–333
Liu Z, Qin J, Peng W, Chao H (2017) Effective task scheduling in cloud computing based on improved social learning optimization algorithm. Int J Online Eng 13(6):4
Fadakar E, Ebrahimi M (2016, March) A new metaheuristic football game inspired algorithm. In 2016 1st conference on swarm intelligence and evolutionary computation (CSIEC) (pp. 6–11). IEEE.
Djunaidi AV, Juwono CP (2018) Football game algorithm implementation on the capacitated vehicle routing problems. Int J Comput Algoritm 7(1):45–53
Huan TT, Kulkarni AJ, Kanesan J, Huang CJ, Abraham A (2017) Ideology algorithm: a socio-inspired optimization methodology. Neural Comput Appl 28(1):845–876
Bouchekara HREH (2020) Most valuable player algorithm: a novel optimization algorithm inspired from sport. Oper Res Int Journal 20(1):139–195
Pervez I, Shams I, Mekhilef S, Sarwar A, Tariq M, Alamri B (2021) Most valuable player algorithm based maximum power point tracking for a partially shaded PV generation system. IEEE Trans Sustain Energy 12(4):1876–1890
Ramli MA, Bouchekara HR (2020) Wind farm layout optimization considering obstacles using a binary most valuable player algorithm. IEEE Access 8:131553–131564
Korashy A, Kamel S, Youssef AR, Jurado F (2019, February) Most valuable player algorithm for solving direction overcurrent relays coordination problem. In 2019 International conference on innovative trends in computer engineering (ITCE) (pp. 466–471). IEEE.
Ahmadi SA (2017) Human behavior-based optimization: a novel metaheuristic approach to solve complex optimization problems. Neural Comput Appl 28(1):233–244
Soto R, Crawford B, González F, Vega E, Castro C, Paredes F (2019) Solving the manufacturing cell design problem using human behavior-based algorithm supported by autonomous search. IEEE Access 7:132228–132239
Soto R, Crawford B, González F, Olivares R (2021) Human behaviour based optimization supported with self-organizing maps for solving the S-box design Problem. IEEE Access 9:84605–84618
Behkam, R., Vahidi, B., Zolfaghari, M., Naderi, M. S., & Gharehpetian, G. B. (2020, August). HBBO-based intelligent setting and coordination of directional overcurrent relays considering different characteristics. In 2020 28th Iran conference on electrical engineering (ICEE) (pp. 1–4). IEEE.
Mousavirad SJ, Ebrahimpour-Komleh H (2017) Human mental search: a new population-based metaheuristic optimization algorithm. Appl Intell 47(3):850–887
Mousavirad SJ, Ebrahimpour-Komleh H, Schaefer G (2019) Effective image clustering based on human mental search. Appl Soft Comput 78:209–220
Mousavirad SJ, Ebrahimpour-Komleh H, Schaefer G (2020) Automatic clustering using a local search-based human mental search algorithm for image segmentation. Appl Soft Comput 96:106604
Esmaeili L, Mousavirad SJ, Shahidinejad A (2021) An efficient method to minimize cross-entropy for selecting multi-level threshold values using an improved human mental search algorithm. Expert Syst Appl 182:115106
Mousavirad SJ, Ebrahimpour-Komleh H (2020) Human mental search-based multilevel thresholding for image segmentation. Appl Soft Comput 97:105427
Mousavirad SJ, Schaefer G, Esmaeili L, Korovin I (2020, July) On improvements of the human mental search algorithm for global optimisation. In 2020 IEEE congress on evolutionary computation (CEC) (pp. 1–8). IEEE.
Mousavirad SJ, Schaefer G, Celebi ME, Fang H, Liu X (2020, October) Colour quantisation using human mental search and local refinement. In 2020 IEEE international conference on systems, man, and cybernetics (SMC) (pp. 3045–3050). IEEE.
Fathollahi-Fard AM, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2018) The social engineering optimizer (SEO). Eng Appl Artif Intell 72:267–293
Fathollahi-Fard AM, Ranjbar-Bourani M, Cheikhrouhou N, Hajiaghaei-Keshteli M (2019) Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system. Comput Ind Eng 137:106103
Zhang C, Fathollahi-Fard AM, Li J, Tian G, Zhang T (2021) Disassembly sequence planning for intelligent manufacturing using social engineering optimizer. Symmetry 13(4):663
Baliarsingh SK, Ding W, Vipsita S, Bakshi S (2019) A memetic algorithm using emperor penguin and social engineering optimization for medical data classification. Appl Soft Comput 85:105773
Aghamohamadi S, Rabbani M, Tavakkoli-Moghaddam R (2021) A social engineering optimizer algorithm for a closed-loop supply chain system with uncertain demand. Int J Transport Eng 9(1):521–536
Millán-Páramo, C., Millán-Romero, E., & Wilches, F. J. Truss optimization with natural frequency constraints using modified social engineering optimizer.
Mamedova N, Urintsov A, Staroverova O, Ivanov E, Galahov D (2019) Social engineering in the context of ensuring information security. SHS Web of Conferences 69:00073
Zhang J, Xiao M, Gao L, Pan Q (2018) Queuing search algorithm: a novel metaheuristic algorithm for solving engineering optimization problems. Appl Math Model 63:464–490
Thaher T, Mafarja M, Abdalhaq B, Chantar H (2019, October) Wrapper-based feature selection for imbalanced data using binary queuing search algorithm. In 2019 2nd international conference on new trends in computing sciences (ICTCS) (pp. 1–6). IEEE.
Zheng X, Nguyen H (2022) A novel artificial intelligent model for predicting water treatment efficiency of various biochar systems based on artificial neural network and queuing search algorithm. Chemosphere 287:132251
Mahmoodabadi MJ, Rasekh M, Zohari T (2018) TGA: team game algorithm. Future Comput Inform J 3(2):191–199
He Y, Hao X, Li W, Zhai Q (2021) Binary team game algorithm based on modulo operation for knapsack problem with a single continuous variable. Appl Soft Comput 103:107180
Mahmoodabadi MJ (2021) Moving least squares approximation-based online control optimised by the team game algorithm for Duffing-Holmes chaotic problems. Cyber-Physical Systems 7(2):93–113
Kumar M, Kulkarni AJ, Satapathy SC (2018) Socio evolution & learning optimization algorithm: a socio-inspired optimization methodology. Futur Gener Comput Syst 81:252–272
Moghdani R, Salimifard K (2018) Volleyball premier league algorithm. Appl Soft Comput 64:161–185
Abd Elaziz M, Nabil N, Moghdani R, Ewees AA, Cuevas E, Lu S (2021) Multilevel thresholding image segmentation based on improved volleyball premier league algorithm using whale optimization algorithm. Multimedia Tools App 80(8):12435–12468
Das P, Das DK, Dey S (2018) A new class topper optimization algorithm with an application to data clustering. IEEE Trans Emerg Top Comput 8(4):948–959
Srivastava A, Das DK (2020) A new aggrandized class topper optimization algorithm to solve economic load dispatch problem in a power system. IEEE Trans Cybern.
Rai A, Das DK (2020) Optimal pid controller design by enhanced class topper optimization algorithm for load frequency control of interconnected power systems. Smart Sci 8(3):125–151
Mohanta TK, Das DK (2021) Class topper optimization based improved localization algorithm in wireless sensor network. Wireless Pers Commun 119(4):3319–3338
Fattahi E, Bidar M, Kanan HR (2018) Focus group: an optimization algorithm inspired by human behavior. Int J Comput Intell Appl 17(01):1850002
Singh PR, Abd Elaziz M, Xiong S (2019) Ludo game-based metaheuristics for global and engineering optimization. Appl Soft Comput 84:105723
Irene DS, Beulah JR (2022) An efficient COVID-19 detection from CT images using ensemble support vector machine with Ludo game-based swarm optimisation. Comput Methods Biomec Biomed Eng: Imaging Visual, 1–12.
Shabani A, Asgarian B, Gharebaghi SA, Salido MA, Giret A (2019) A new optimization algorithm based on search and rescue operations. Math Prob Eng 2019:1–23
Shabani A, Asgarian B, Salido M, Gharebaghi SA (2020) Search and rescue optimization algorithm: a new optimization method for solving constrained engineering optimization problems. Expert Syst Appl 161:113698
Khatri A, Gaba A, Rana KPS, Kumar V (2020) A novel life choice-based optimizer. Soft Comput 24(12):9121–9141
Tharwat A, Gabel T (2019) Parameters optimization of support vector machines for imbalanced data using social ski driver algorithm. In Neural computing and applications, pp. 1–14.
Chatterjee B, Bhattacharyya T, Ghosh KK, Singh PK, Geem ZW, Sarkar R (2020) Late acceptance hill climbing based social ski driver algorithm for feature selection. IEEE Access 8:75393–75408
Mohamed AW, Hadi AA, Mohamed AK (2019) Gaining-sharing knowledge based algorithm for solving optimization problems: a novel nature-inspired algorithm. Int J Mach Learn Cybern, 1–29.
Mohamed AW, Abutarboush HF, Hadi AA, Mohamed AK (2021) Gaining-sharing knowledge based algorithm with adaptive parameters for engineering optimization. IEEE Access 9:65934–65946
Pare S, Bhandari AK, Kumar A, Bajaj V (2018) Backtracking search algorithm for color image multilevel thresholding. SIViP 12(2):385–392
Ortega-Sánchez N, Rodríguez-Esparza E, Oliva D, Pérez-Cisneros M, Mohamed AW, Dhiman G, Hernández-Montelongo R (2021) Identification of apple diseases in digital images by using the Gaining-sharing knowledge-based algorithm for multilevel thresholding. Soft Comput, 1–37.
Agrawal P, Ganesh T, Mohamed AW (2021) A novel binary gaining–sharing knowledge-based optimization algorithm for feature selection. Neural Comput Appl 33(11):5989–6008
Agrawal, P., Ganesh, T., & Mohamed, A. W. (2021). Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm. Complex & Intelligent Systems, 1–21.
Xiong G, Li L, Mohamed AW, Yuan X, Zhang J (2021) A new method for parameter extraction of solar photovoltaic models using gaining–sharing knowledge based algorithm. Energy Rep 7:3286–3301
Xiong G, Yuan X, Mohamed AW, Zhang J (2022) Fault section diagnosis of power systems with logical operation binary gaining-sharing knowledge-based algorithm. Int J Intell Syst 37:1057–1080
Agrawal P, Ganesh T, Mohamed AW (2020, July) Solution of uncertain solid transportation problem by integer gaining sharing knowledge based optimization algorithm. In 2020 international conference on computational performance evaluation (ComPE) (pp. 158–162). IEEE.
Elsisi M (2019) Future search algorithm for optimization. Evol Intel 12(1):21–31
Janamala V, Kumar UK, Pandraju TKS (2021) Future search algorithm for optimal integration of distributed generation and electric vehicle fleets in radial distribution networks considering techno-environmental aspects. SN Appl Sci 3(4):1–17
Elsisi M, Soliman M (2021) Optimal design of robust resilient automatic voltage regulators. ISA Trans 108:257–268
Shaheen AM, Ginidi AR, El-Sehiemy RA, Ghoneim SS (2020) A forensic-based investigation algorithm for parameter extraction of solar cell models. IEEE Access 9:1–20
Hoang ND, Huynh TC, Tran VD (2021) Computer vision-based patched and unpatched pothole classification using machine learning approach optimized by forensic-based investigation metaheuristic. Complexity 2021:1–17
Chou JS, Truong DN (2022) Multiobjective forensic-based investigation algorithm for solving structural design problems. Autom Constr 134:104084
Kuyu YÇ, Vatansever F (2021) Modified forensic-based investigation algorithm for global optimization. Eng Comput. https://doi.org/10.1007/s00366-021-01322-w
Askari Q, Younas I, Saeed M (2020) Political optimizer: a novel socio-inspired meta-heuristic for global optimization. Knowl-Based Syst 195:105709
Awad R (2021) October). Sizing optimization of truss structures using the political optimizer (PO) algorithm. Structures 33:4871–4894
Diab AAZ, Tolba MA, El-Magd AGA, Zaky MM, El-Rifaie AM (2020) Fuel cell parameters estimation via marine predators and political optimizers. IEEE Access 8:166998–167018
Manita Ghaith, Korbaa Ouajdi (2020) Binary political optimizer for feature selection using gene expression data. Comput Intell Neurosci 2020:1–14
Premkumar M, Sowmya R, Jangir P, Kumar JS (2020, October) A new and reliable objective functions for extracting the unknown parameters of solar photovoltaic cell using political optimizer algorithm. In 2020 international conference on data analytics for business and industry: way towards a sustainable economy (ICDABI) (pp. 1–6). IEEE.
Durmus A, Kurban R (2021). Optimal synthesis of concentric circular antenna arrays using political optimizer. IETE J Res, 1–10.
Singh P, Pandit M, Srivastava L (2020, September) Optimization of levelized cost of hybrid wind-solar-diesel-battery system using political optimizer. In 2020 IEEE first international conference on smart technologies for power, energy and control (STPEC) (pp. 1–6). IEEE.
Mani V, Varma MD, Krishna KV, Khan Z, Sudabattula SK. Hybrid approach to solve capacitor allocation problem in distribution system using political optimizer algorithm.
Basetti V, Rangarajan SS, Shiva CK, Pulluri H, Kumar R, Collins RE, Senjyu T (2021) Economic emission load dispatch problem with valve-point loading using a novel quasi-oppositional-based political optimizer. Electronics 10(21):2596
Askari Q, Saeed M, Younas I (2020) Heap-based optimizer inspired by corporate rank hierarchy for global optimization. Expert Syst Appl 161:113702
Rizk-Allah RM, El-Fergany AA (2021) Emended heap-based optimizer for characterizing performance of industrial solar generating units using triple-diode model. Energy 237:121561
Abdel-Basset M, Mohamed R, Elhoseny M, Chakrabortty RK, Ryan MJ (2021) An efficient heap-based optimization algorithm for parameters identification of proton exchange membrane fuel cells model: analysis and case studies. Int J Hydrogen Energy 46(21):11908–11925
Shaheen AM, Elsayed AM, Ginidi AR, El-Sehiemy RA, Elattar EE (2022) Improved heap-based optimizer for dg allocation in reconfigured radial feeder distribution systems. IEEE Syst J. https://doi.org/10.1109/JSYST.2021.3136778
Elsayed SK, Kamel S, Selim A, Ahmed M (2021) An improved heap-based optimizer for optimal reactive power dispatch. IEEE Access 9:58319–58336
Shaheen MA, Hasanien HM, Al-Durra A (2021) Solving of optimal power flow problem including renewable energy resources using HEAP optimization algorithm. IEEE Access 9:35846–35863
Kharrich M, Kamel S, Hassan MH, ElSayed SK, Taha I (2021) An improved heap-based optimizer for optimal design of a hybrid microgrid considering reliability and availability constraints. Sustainability 13(18):10419
Wadhwa H, Aron R (2022) A clustering-based optimization of resource utilization in fog computing. In JK Mandal, R Buyya, D De (Eds.), Proceedings of International Conference on Advanced Computing Applications (pp. 343–353). Springer, Singapore.
Ghasemian H, Ghasemian F, Vahdat-Nejad H (2020) Human urbanization algorithm: a novel metaheuristic approach. Math Comput Simul 178:1–15
Alluri A, Lanka RS, Rao RS (2021) System security enhancement using hybrid HUA‐GPC approach under transmission line (s) and/or generator (s) outage conditions. Int J Numerical Model: Electron Netw, Devices Fields.
Rahkar Farshi T (2021) Battle royale optimization algorithm. Neural Comput Appl 33:1139–1157
Agahian S, Akan T (2021) Battle royale optimizer for training multi-layer perceptron. Evol Syst. https://doi.org/10.1007/s12530-021-09401-5
Şahin AK, Taş T, Bertuğ E, Ayas MŞ (2021, June) Metaheuristic algorithm based PI controller design for Linearized Quadruple-Tank Process. In 2021 3rd international congress on human-computer interaction, optimization and robotic applications (HORA) (pp. 1–6). IEEE.
Suresh G, Prasad D, Gopila M (2021) An efficient approach based power flow management in smart grid system with hybrid renewable energy sources. Renew Energy Focus 39:110–122
Wagan AI, Shaikh MM (2020) A new metaheuristic optimization algorithm inspired by human dynasties with an application to the wind turbine micrositing problem. Appl Soft Comput 90:106176
Al-Betar MA, Alyasseri ZAA, Awadallah MA, Doush IA (2021) Coronavirus herd immunity optimizer (CHIO). Neural Comput Appl 33(10):5011–5042
Dalbah LM, Al-Betar MA, Awadallah MA, Zitar RA (2021) A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem. J King Saud University-Comput Inform Sci.
Dalbah LM, Al-Betar MA, Awadallah MA, Zitar RA (2022). A coronavirus herd immunity optimization (chio) for travelling salesman problem. In International conference on innovative computing and communications (pp. 717–729). Springer, Singapore.
Alweshah M, Alkhalaileh S, Al-Betar MA, Bakar AA (2022) Coronavirus herd immunity optimizer with greedy crossover for feature selection in medical diagnosis. Knowl-Based Syst 235:107629
Kumar C, Magdalin Mary D, Gunasekar T (2022) MOCHIO: a novel multi-objective coronavirus herd immunity optimization algorithm for solving brushless direct current wheel motor design optimization problem. Automatika 63(1):149–170
Naderipour A, Abdullah A, Marzbali MH, Nowdeh SA (2022) An improved corona-virus herd immunity optimizer algorithm for network reconfiguration based on fuzzy multi-criteria approach. Expert Syst Appl 187:115914
Amini S, Ghasemi S, Golpira H, Anvari-Moghaddam A (2021, September). Coronavirus herd immunity optimizer (CHIO) for Transmission Expansion Planning. In 2021 IEEE international conference on environment and electrical engineering and 2021 IEEE industrial and commercial power systems Europe (EEEIC/I&CPS Europe) (pp. 1–6). IEEE.
Alqarni, M. Sodium sulfur batteries allocation in high renewable penetration microgrids using coronavirus herd immunity optimization. Ain Shams Eng J (2021).
Mahboob AS, Shahhoseini HS, Moghaddam MRO, Yousefi S (2021, May) A coronavirus herd immunity optimizer for intrusion detection system. In 2021 29th Iranian conference on electrical engineering (ICEE) (pp. 579–585). IEEE.
Zitar R (2021) A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.
Emami H (2022) Stock exchange trading optimization algorithm: a human-inspired method for global optimization. J Supercomput 78(2):2125–2174
Emami H (2022) Anti-coronavirus optimization algorithm. Soft Comput 26(11):4991–5023
Kalyani R, Sathya PD, Sakthivel VP (2021) Medical image segmentation using exchange market algorithm. Alex Eng J 60(6):5039–5063
Sovatzidi G, Savelonas M, Koutsiou DCC, Iakovidis DK (2020, October). Image segmentation based on determinative brain storm optimization. In 2020 15th international workshop on semantic and social media adaptation and personalization (SMA) (pp. 1–6). IEEE.
Dey N, Rajinikanth V, Shi F, Tavares JMR, Moraru L, Karthik KA et al (2019) Social-group-optimization based tumor evaluation tool for clinical brain MRI of flair/diffusion-weighted modality. Biocybern Biomed Eng 39(3):843–856
Monisha R, Mrinalini R, Nithila Britto M, Ramakrishnan R, Rajinikanth V (2019) Social group optimization and Shannon’s function-based RGB image multi-level thresholding. In Smart intelligent computing and applications (pp. 123–132). Springer: Singapore.
Suresh, K., Sakthi, U. (2018) Robust multi-thresholding in noisy grayscale images using Otsu’s function and harmony search optimization algorithm. In Advances in electronics, communication and computing (pp. 491–499). Springer: Singapore.
Rajinikanth V, Satapathy SC, Fernandes SL, Nachiappan S (2017) Entropy based segmentation of tumor from brain MR images–a study with teaching learning based optimization. Pattern Recogn Lett 94:87–95
Razmjooy N, Mousavi BS, Sargolzaei P, Soleymani F (2011) Image thresholding based on evolutionary algorithms. Int J Phys Sci 6(31):7203–7211
Funding
There is no funding related to this research.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
On behalf of all authors, the corresponding author states that there is no conflict of interest. The authors declare that they have no conflict of interest.
Ethical Approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Rai, R., Das, A., Ray, S. et al. Human-Inspired Optimization Algorithms: Theoretical Foundations, Algorithms, Open-Research Issues and Application for Multi-Level Thresholding. Arch Computat Methods Eng 29, 5313–5352 (2022). https://doi.org/10.1007/s11831-022-09766-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11831-022-09766-z