Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2021 / Article
Special Issue

Meta-Heuristic Techniques for Solving Computational Engineering Problems 2021

View this Special Issue

Review Article | Open Access

Volume 2021 |Article ID 5594267 | https://doi.org/10.1155/2021/5594267

Mahima Dubey, Vijay Kumar, Manjit Kaur, Thanh-Phong Dao, "A Systematic Review on Harmony Search Algorithm: Theory, Literature, and Applications", Mathematical Problems in Engineering, vol. 2021, Article ID 5594267, 22 pages, 2021. https://doi.org/10.1155/2021/5594267

A Systematic Review on Harmony Search Algorithm: Theory, Literature, and Applications

Academic Editor: Hassène Gritli
Received17 Jan 2021
Revised21 Mar 2021
Accepted02 Apr 2021
Published16 Apr 2021

Abstract

Harmony search algorithm is the recently developed metaheuristic in the last decade. It mimics the behavior of a musician producing a perfect harmony. It has been used to solve the wide variety of real-life optimization problems due to its easy implementation over other metaheuristics. It has an ability to provide the balance between exploration and exploitation during search. In this paper, a systematic review on harmony search algorithm (HSA) is presented. The natural inspiration and conceptual framework of HSA are discussed. The control parameters of HSA are described with their mathematical foundation. The improvement and hybridization in HSA with other metaheuristics are discussed in detail. The applicability of HSA in different problem domains is studied. The future research directions of HSA are also investigated.

1. Introduction

Optimization is the process for selecting the best possible value of decision variables from the available set of values under some specific constraints [1]. This process is used to minimize or maximize the fitness function of the optimization problems. The fitness function is influenced by a set of variables, called decision variables and a set of restrictions, which acts as a barrier to certain values of the decision variables. Based on the nature of search space, the optimization problems are broadly categorized into two main classes such as continuous and discrete [2]. Beside this, the categorization of problems based on nature of fitness function is linear, convex, quadratic, concave, and sparse. The nature of problem has to be analyzed before applying the optimization techniques [3]. A large number of optimization techniques are available in the literature to solve the real-life problems.

The classical techniques such as quasi-Newton method, dynamic programming, and linear programming are used for solving the real-life problems. Along with the evolution of new techniques, the complexities of the optimization problems in engineer designs affronted were increased. These methods are unable to solve these problems [3]. Due to the complexities of problems, it becomes difficult to solve it by using the classical techniques in the reasonable time duration. To alleviate this issue, metaheuristic techniques are developed in the recent years. These techniques are able to solve the complex problems in a reasonable time period. Metaheuristic techniques are inspired from the ideas derived from biological science, physics, behavior of animals, insects, etc. [4]. A number of metaheuristic algorithms are developed in the literature. Some of the well-known techniques are genetic algorithm (GA), ant colony optimization (ACO), particle swarm optimization (PSO), grey wolf optimization (GWO), harmony search algorithm (HSA), and many more (see Figure 1).

Harmony search algorithm (HSA) is a well-known metaheuristic algorithm, which is developed by Geem et al. [5] in 2001. HSA is inspired from the improvisation process of musicians. A musician searches for the perfect notes to develop a perfect harmony. Based on this concept, HSA was developed to search a good solution for an optimization problem. The developers of HSA performed extensive experimentation to validate its performance. The main characteristics of HSA are as follows: (1) the initial setting of decision variables is not required, (2) derivate information is not required, and (3) few control parameters are needed for fine tuning [6]. Due to these characteristics, HSA is preferred over the other existing metaheuristic techniques. HSA is used to solve the wide variety of problems such as clustering problems, social-economic problems, power engineering problems, computer vision problems, scheduling problems, and global optimization problems. The HSA is considered as an efficient algorithm with a simple implementation. Some researchers also investigated the applicability of HSA on different domains.

The main aim of this paper is to provide a comprehensive analysis of every aspect of HSA and motivate the researchers to use it in their problem domain. This paper also highlights the improvement and hybridization of HSA with other metaheuristics to alleviate the weakness of algorithm. The modification in control parameters of HSA is also investigated. The applicability of HSA in different research domain is discussed in detail. Figure 2 shows the number of research articles published on HSA.

This paper discusses the harmony search algorithm in four-fold. These are as follows:(1)Theoretical aspects of HSA that comprise the improvements, hybridization with other metaheuristics, and multiobjectivity.(2)Control parameters of HSA, which includes improvements in harmony memory consideration rate, pitch adjustment rate, and distance bandwidth.(3)Applications of HSA that comprise image processing, clustering, civil engineering, electrical engineering, bioinformatics, software engineering, scheduling, and mechanical engineering.(4)Challenges of HSA that include the future research direction, either the modification in HSA or applicability in other research domains.

The organization of this paper is structured as follows. Section 2 presents the basic concepts of classical harmony search algorithm. The research methodology is presented in Section 3. The control parameters of harmony search algorithm are elaborated in Section 4. Section 5 presents the variants of harmony search algorithm. Section 6 discusses various applications in different research domains. The future research directions are mentioned in Section 7, followed by the concluding remarks in Section 8.

2. Harmony Search Algorithm

This section presents the inspiration, working, and flowchart of HSA. It also describes the main components of HSA.

2.1. Inspiration

HSA is a metaheuristic technique that mimics from the improvisation process of musicians. It comes under the category of community-inspired metaheuristic algorithms. It provides a perfect stability between the exploration and exploitation phases of search process. HSA is inspired by the natural event where a musician searches for the perfect notes to develop a perfect harmony (see Figure 3). The method used to search perfect solutions for the given problem is similar to the method used by a musician who tries to find harmony delightful to the ears. The method used for deriving the value of fitness function is similar to the method of deriving a standard with the help of pitch of every musical instrument [3].

There are three situations occurring, in which the pitch can be improved by a musician.(1)A stored pitch from the memory of the musician is played(2)A neighboring pitch from the stored pitches is played(3)Any arbitrary pitch is played, which is falling within the standard scope

Equivalently, the selection of a value of every decision variable in the algorithm is done by the following three acts:(1)One value from the stored values of the memory is selected(2)Some neighboring values of the stored values are selected(3)Any arbitrary value that lies in the standard scope is selected

The abovementioned acts are governed through the two main components of HSA. These are harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) [5].

2.2. Mathematical Modelling

In HSA, the working of operators is similar to the activities performed by a musician while creating a perfect harmony. A musician tries to change the different tones until the perfect harmony is found. Thereafter, the collection is stored in the memory. In an optimization problem, the operators undergo different variations; if the results of the variation are favorable, then the memory is updated by adding this to the memory and removing the undesirable one. During the production of music, one of these three events occurs [5]:(i)One of the stored tones from a collection of different ones from the memory (Harmony Memory) is selected(ii)Any adjacent tone, which is nearer to one of the stored ones, is selected (pitch adjustment)(iii)Any arbitrary tone is selected, which falls under the standard scope (random selection)

The main components of HSA are harmony memory size (HMS), harmony memory consideration rate (HMCR), pitch adjustment rate (PAR), and stopping criteria (i.e., number of improvisation (NI)). These parameters are responsible for exploration and exploitation. Figure 4 shows the flowchart of HSA. The main steps of HSA are described as follows [5].

2.2.1. Initialization of Optimization Problem and Control Parameters

The optimization problem is defined as follows:where represents the fitness function of ; is a set of each decision variable . The value of each decision variable should lie in the range, . The values of HMS, HMCR, PAR, and NI are also initialized.

2.2.2. Initialization of Harmony Memory

Harmony memory (HM) is initialized arbitrarily in the range of . It is done by the following step:where Rand is a random function that takes any arbitrary value from [0,1].

2.2.3. Creating a New Harmony Vector

For creating a new harmony, harmony vector is used. It is decided by three control parameters, namely, pitch adjustment, arbitrary selection, and memory consideration. Another control parameter distance bandwidth is used to modify the harmony vector, which plays a crucial role in pitch adjustment step (Algorithm 1). The following actions are performed to create a new memory [3, 5].

For each
If, then/harmony memory consideration/
  ,
  If, then/pitch adjustment/
   
  End if
 Else
   /arbitrary selection/
 End if
End For
2.2.4. Revising Harmony Memory

The fitness value of the newly generated harmony vector is compared with the fitness value of worst harmony vector stored in the memory. If the earlier one is fitter than the latter one, then the worst harmony value in the memory is replaced with the newly generated harmony vector. Otherwise, newly generated harmony vector is ignored.

2.2.5. Evaluating Termination Condition

The evolution process of HSA is stopped if the termination condition is achieved. The termination condition can be determined by the total number of improvisations reached so far. Otherwise, go to Step 3. Step 3 is considered as a crucial step for the improvisation process.

3. Research Methodology

In this paper, the systematic review of harmony search algorithm (HSA) was conducted according to the guidelines of PRISMA [7]. For the selection of appropriate research articles relevant to HSA, a search has been conducted on Google Scholar, Scopus, and PubMed. Search was conducted by using the keywords “Harmony Search Algorithm” or “HSA” or “improved harmony search algorithm” or “variant of HSA” or “Adaptive harmony search” or “Application of HSA” or “Application of harmony search” or “Modification in HSA” or “parameter free harmony search.” The selection and rejection criteria for research articles that are relevant to HSA are presented in Table 1.


Sr. no.ParametersSelection criteriaRemoval criteria

1Time durationResearch articles published from 2008 to 2021Research articles published before 2008
2ApplicationResearch articles on bioinformatics, software engineering, scheduling, mechanical engineering, industrial engineering, and networkingResearch articles on economics, environment, and social-economics
3ComparisonResearch articles focus on the variants of HSA and control parameterResearch articles focus on the variant of other metaheuristics
4StudyResearch articles include experimental results and solid mathematical foundationResearch involves case study, patent, and articles in different languages other than English
5AnalysisResearch articles include the various control parameters of HSAResearch articles include the different operators of other metaheuristics

Total 63,500 research articles were explored on Google Scholar, Scopus, and PubMed including manual searching. Initially, all the duplicate research articles and articles published before 2008 were discarded. After this, 2400 research articles were selected for the next phase. 300 research articles were selected after the reading of titles and abstract. 100 research articles were selected after reading conclusion and facts found in articles. 20 research articles are selected for review after the fourth round of screening.

4. Control Parameters of HSA

The well-known control parameters of HSA are pitch adjustment rate (PAR), harmony memory consideration rate (HMCR), distance bandwidth (BW), harmony memory (HM), and termination criteria (see Figure 5). The researchers have tried to modify the structure of original HSA by using the abovementioned control parameters. PAR, HMCR, and BW are responsible for convergence of HSA.

4.1. Modification in PAR and BW

Mahdavi et al. [8] developed an improved version of HSA (IHSA) to alleviate the shortcoming of HSA. The values of PAR and BW were dynamically updated according to the generation. The mathematical formulation of these control parameters is given as follows [8]:where denotes the pitch adjustment rate in generation ; and are the minimum and maximum adjustment rates, respectively.where represents the distance bandwidth in generation ; and are the minimum and maximum bandwidths, respectively. The challenging task of IHSA is to determine the appropriate values of lower and upper limits of BW. Pan et al. [9] developed a self-adaptive GHSA (SGHSA). A new improvisation scheme was developed to capture the best solution for generating new harmonies. The distance bandwidth is dynamically decreased with increase in number of generation. The mathematical formulation of BW is given as follows [9]:

The modification in HSA was developed by Das et al. [10] and known as an explorative HSA (EHSA). They used the population variance for modification. The distance bandwidth was dynamically changed to proportional to standard deviation of the current population. BW is given as follows:where represents the standard deviation of the current population, .

Kong et al. [11] developed an adaptive HSA (AHSA) that utilized the dynamically adjusting PAR and BW. PAR was dynamically changed according to the fitness value. The mathematical formulation of PAR is defined as [11]where and denote the difference between minimum and maximum values of fitness function in the previous and current generations, respectively.

Wang and Huang [12] developed a new variant of HSA by modifying the PAR and BW. They replaced the BW with maximum and minimum values present in HM. The following equations are used in the place of BW:where denotes the variable selected from HM. is the random number selected from the range of 0 and 1. and denote the minimum and maximum values of variable present in HM. The same modification in PAR was done as mentioned in [8], but in the opposite direction.

Luo [13] developed a novel self-adaptive mechanism for HSA. PAR was not considered during the improvisation process. The following equation was designed for constructing HMCR parameter:where represents the dimension of problem. was dynamic updated for each variable (say, ) and defined as [13]where represents the standard deviation of fitness function values in the current harmony memory.

Chen et al. [14] designed a novel variant of HSA, known as NDHSA, which dynamically updates the control parameters, PAR and BW. The following equations were used to update both PAR and BW for improving the harmony vectors.

Here, is the constant parameter and value is set to 5 when the number of iterations is 50,000.

Kattan and Abdullah [15] developed a dynamic self-adaptive HSA (DSAHSA) to improve the search process. The control parameters, namely, PAR and BW were dynamically updated. The value of PAR either increases or decreases according to the best-to-worst ratio. The modifications in these parameters are computed as follows:where and denote the best and worst quality solutions in the HM. The dynamic BW was computed using the standard deviation of respective dimension of HM. It is computed as follows:

Kalivarapu et al. [16] proposed a self-adaptive IHSA (SIHSA) based on dynamic change in BW. The modification in BW was computed as [16]

Here,where and are constants whose values depend upon the maximum and minimum values of BW. should be greater than 1.

4.2. Modification in PAR and HMCR

Kumar et al. [17] utilized both local and global search capabilities by modifying the value of HMCR and PAR parameters and developed an algorithm which is called as parameter adaptive HSA (PAHSA). They explored the possibility of nonlinear change in these parameters. The linear change in these parameters was also explored in [18]. Both PAR and HMCR were modified linearly and computed as follows:

The nonlinear modifications have been done in both PAR and HMCR and computed as follows.

Khalili et al. [19] developed a global dynamic HSA named as GDHSA. Both HMCR and PAR were modified dynamically during the search process and computed as follows:

During the first half of search process, the values of HMCR and PAR increase and decrease in second half of evolution process.

Guo et al. [20] developed an adaptive HSA based on the concept of best-based strategy (ABHSA). The control parameters such as HMCR and PAR were modified according to the feedback obtained from the evolution process. The initial values of HMCR and PAR were randomly generated in the range of and , respectively. Both HMCR and PAR were reinitialized with low probability of 0.1 during search process.

Wang et al. [21] developed a new variant of HSA based on dual strategies and adaptive parameters (DSAHS). Both HMCR and PAR were initialized to 0.95 and 0.5, respectively. The values of these parameters were modified according to the fitness of harmony vector. Table 2 depicts the modification done in the control parameters of HSA.


Ref.AlgorithmPARHMCRBW

[8]IHSA
[9]SGHSA
[10]EHSA
[11]AHSA
[12]SAHSA
[13]NSHSA
[17]PAHSA
[18]MHSA
[14]NDHSA
[20]ABHSA
[15]DSAHSA
[19]GDHSA
[16]SIHSA
[21]DSAHS

5. Variants of HSA

In last few years, the various variants of HSA have been developed to solve the diverse real-life optimization problems. The modification in HSA has been done in two-folds. First, the basic structure of HSA has been modified by incorporating the different operators such as chaotic, binary, and crowding distance. Second, HSA has been hybridized with other metaheuristic algorithms [22, 23].

5.1. Improved HSA

Enayatifar et al. [24] presented a novel harmony search algorithm using learning automata (LAHSA). The learning-based mechanism was used to enhance the search capability of algorithm. LAHSA provided better performance than the other variants of HSA over benchmark test functions. Kumar et al. [25] developed a variance-based harmony search algorithm (HSA) for solving optimization problems. The variance of the current population and current harmony vector was used to improvise the HM. The proposed approach eliminated the constant parameter setting problem. Geem and Sim [26] proposed a parameter-setting-free HSA (PSFHSA) to alleviate the parameter setting problem of HSA. They designed a novel matrix for memorizing the parameters for each variable. There is no need to set the control parameters for the given problem. However, the performance of PSFHSA is not as good as the original HSA. To improve the performance of PSFHSA, Jeong et al. [27] developed an advanced version of PSFHSA (APSFHSA). They reduced the additional memory requirement during the search process.

Jing et al. [28] developed a variant of HSA that modify the control parameter within the specified range during the search process and called advanced PSFHSA (APSFHSA). To improve the performance of PSFHSA, Shaqfa and Orban [29] modified the pitch adjustment step of PSFHSA and applied on the optimization of concrete beam design. A number of modifications have been proposed in HSA to improve its performance [3032]. Table 3 shows the improvement in the variants of HAS.


Ref.AlgorithmDescriptionApplicationPerformance

[24]LAHSALearning automata is employed to improve the performanceOptimization problemsLess computational time
[25]VHSAVariance of harmony memory is used to improve the harmony vectorsClusteringGood performance
[26]PSFHSAEach variable is associated with matrix of memorizing operation typesWater distribution network designEliminate the parameter tuning problem
[27]APSFHSAAdditional memory is not used during the improvisation processOptimization problemsBetter performance than PSFHSA
[28]APFHSASelf-adaption mechanism is employed to tune the parametersGroundwater pollution problemBetter exploration and exploitation
[29]MPSFHSAPitch adjustment step is modifiedConcrete beam designBetter performance than PSFHSA

5.2. Chaotic HSA

Alatas [33] utilized chaotic maps in HSA for parameter adaptation. Due to chaotic maps, the convergence of HSA was improved and the solutions which are being stuck in local optima are avoided. El-Santawy et al. [34] combined the chaos theory with HSA for solving numerical integration problem. The convergence of the proposed approach was improved. Abdel-Raouf et al. [35] proposed an improved version of chaotic HSA (IHSCH) for linear assignment problems. The chaos was incorporated in harmony memory to alleviate the local optima. The computation time of IHSCH is smaller than the traditional algorithms. The chaotic HSA is hybridized with flower pollination to solve Sudoku problem [36]. The design of adaptive infinite impulse response (IIR) filter system was optimized by Shafaati and Mojallali [37]. They incorporated chaos in HSA to solve the identification problem of IIR system. Askarzadeh [38] hybridized the concepts of simulated annealing and chaotic search with HSA (DCHSSA) for optimal design of wind system. Yi et al. [39] presented a parallel chaotic modified HSA, known as MHS-PCLS, for constrained engineering design problems. The robustness of search was enhanced through MHS-PCLS. The performance of MHS-PCLS was better than the existing harmony search algorithms. Table 4 shows the performance comparison of different chaotic harmony search algorithms.


Ref.AlgorithmDescriptionApplicationPerformance

[33]CHSAChaotic maps are used for parameter adaptionOptimization problemsImprovement in convergence
[34]CHSAChaotic is used to manipulate parameter valueNumerical integrationImprove accuracy, convergence
[35]IHSCHChaotic is employed to improve the harmony memoryAssignment problemsImprovement in computational time
[36]FPCHSAHybridized chaotic harmony with flower pollinationSudoku puzzlesImprove performance of CHSA
[37]CIHSAChaotic and social components of PSO are used to enhance explorationIIR filter optimizationLess computational complexity, more robustness
[38]DCHSSAHybridized the chaotic and simulated annealingWind systemGood performance
[39]MHS-PCLSParallel chaotic search is proposed to improve the performance of HSAEngineering design problemsMore robustness

5.3. Binary HSA

To overcome the shortcomings of HSA, an adaptive version of BHSA (ABHSA) was proposed by Wang et al. [40]. The control parameters were improved through BHSA. The performance of ABHSA was tested on both low- and high-dimensional knapsack problems. Ravindra et al. [41] developed a BHSA for optimal deployment of phasor measurement units. Lin and Li [42] designed a hybrid BHSA to solve winner determination problem. Both HMCR and PAR were modified to provide the balance between intensification and diversification. Kong et al. [43] proposed a simplified binary HSA (SBHSA) to solve 0–1 knapsack problems. The main difference between SBHSA and HSA is in terms of improvisation process. The control parameters of HSA were used to generate new solutions. SBHSA enhances the convergence and population diversity. SBHSA was evaluated on both low- and high-dimensional knapsack problems. The performance comparison of different binary harmony search algorithms is depicted in Table 5.


Ref.AlgorithmDescriptionApplicationPerformance

[40]ABHSABinary encoding and adaptive mechanism are incorporated in HSAKnapsack problemsImprovement in convergence and accuracy
[41]BHSABHSA has been proposed for state estimationDeployment of phasor measurement unitsSolution quality
[42]HBHSATabu search is employed to improve the local search abilityWinner determination problemImprove the performance
[43]SBHSAThe control parameters are dynamically updatedKnapsack problemsImprove the solution quality

5.4. Multiobjective HSA

There are two approaches to solve the multiobjective problems. These are weighted sum approach and Pareto-optimal front approaches. The former one tries to solve the multiobjective problem by assigning weight factors to convert the multiple objectives into single objective. The second approach aims to optimize all objectives simultaneously. In this approach, nondominated solutions are used. HSA used to optimize the project planning by minimizing the tradeoff between time and cost [44]. The ranking method was used for Pareto-optimum solutions. Xu et al. [45] implemented a multiobjective HSA (MOHSA) for development of a mobile robot. The stability, torque resistance of rear wheels, and mass of robot have to be optimized through MOHSA.

Ricart et al. [46] incorporated the concepts of ranking assignment and Pareto-optimality in HSA to solve the multiobjective problems. The self-adaptive mechanism was incorporated in MOHSA to enhance the performance [47]. Prajapati and Chhabra [48] developed a many-objective discrete HSA (MaDHSA) to resolve the software remodularization problem. The quality indicator and external archive are used to rank the nondominated solutions. The five objectives related to remodularization were utilized to improve the accuracy of modularization solution. Wang et al. [49] developed a multiobjective binary harmony search algorithm (MBHSA). The nondominated sorting-based crowding distance was used to update the harmony memory. The search ability of MBHSA was improved through modified PAR operator. The performance of MBHSA outperforms the existing variants in terms of convergence and diversity. Sabrinath et al. [50] extended PAHSA to solve multiobjective optimization problems. The weighted sum approach was used to assign the weightages to performance indices. Table 6 shows the performance comparison of different multiobjective harmony search algorithms.


Ref.AlgorithmDescriptionApplicationPerformance

[44]MOHSARanking method is used for Pareto-optimal solutionsProject planningImprove the performance
[45]MOHSAPareto-optimality usedDesign of mobile robotMaximize the stability and minimize the mass of robot
[46]MOHSARanking assignment and Pareto-optimality are employed in HSAOptimization problemsBetter convergence, good solutions
[47]MOHSASelf-adaptive mechanism is incorporated in MOHSAWater distribution networkImprove the performance
[48]MaDHSAExternal archive is employed to rank and store nondominated solutionsSoftware remodularization problemImprovement in accuracy
[49]MBHSANondominated sorting-based crowding distance is employed to enhance the diversityBenchmark problemsImprove convergence and diversity
[50]MPAHSAWeighted sum approach is used for assigning the weightage to performance indicatorsDisk-brake and helical spring problemsImprove performance

5.5. Hybrid HSA

The performance of HSA can be further improved by incorporating the components of other metaheuristic algorithms. Taherinejad [51] utilized the concept of simulated annealing (SA) in the dynamic version of PAR. The mathematical formulation of modified PAR is given as follows [51]:

The modification in PAR changed the direction in reverse order, which is suggested by Mahdavi et al. [8], and improves the performance of HSA. Omran and Mahdavi [52] incorporated the concept of particle swarm optimization (PSO) in HSA for enhancing the performance. The BW was replaced with global-best particle. Santos Coelho and Andrade Bernert [53] dynamically modified the PAR by using the concepts borrowed from dispersed PSO (DPSO). The modified PAR is given as follows:where and denote the minimum and maximum fitness values in generation , respectively. represents the mean of fitness value of all harmony vectors present in HM.

The clonal selection algorithm (CSA) is hybridized with HSA to improve the convergence speed [54]. CSA was used to improve the harmony vectors present in HM. This approach alleviated the premature problem. However, the computational speed of this approach is much higher than the original HSA. The parallel metaheuristic-based framework was proposed by Lee and Zomaya [55]. They used HSA as a key component. Genetic algorithm (GA), simulated annealing (SA), and artificial immune system (AIS) were used to improve the harmony vectors. The main advantage of this approach was faster convergence speed. Zou et al. [56] proposed a novel HSA to solve the reliability problems. A position updating mechanism was designed. However, this mechanism speeds up the premature convergence. To handle this situation, genetic mutation was introduced.

Fesanghary et al. [44] hybridized HSA with sequential quadratic programming (SQP) to enhance the exploitation mechanism. The balance between global and local search is controlled through the control parameter, . was set to 0.1 as reported in the literature. Alia et al. [57] designed a fuzzy clustering algorithm using HSA for image segmentation. The empty operator was used for selection mechanism. Fuzzy c-means (FCM) was hybridized with HSA to improve the quality of segmentation results. Gao et al. [58] developed two variants of HSA for solving optimization problems. In the first approach, HSA is integrated with differential evolution (DE) to improve the convergence. DE was used to tune the harmony vectors present in HM. In the second approach, harmony memory updating strategy was proposed. The proposed approaches were able to maintain the diversity in HM. However, the optimal parameter selection has to be analyzed.

Yildiz and Ozturk [59] combined both HSA and Taguchi method to improve the performance of HSA. Jang et al. [60] combined Nelder-Mead Simplex algorithm (NM-SA) with HSA to enhance the quality of harmony vectors present in HM. Naik et al. [40] proposed a variant of GHSA that utilized the concepts of gradient descent learning (GDL) and functional link artificial neural network (FLANN). The search capability of GDL was used to optimize the weight of FLANN. HSA was also hybridized with fuzzy logic [61], cuckoo search algorithm (CS) [62], ant colony optimization (ACO) [63,64], firefly algorithm (FA) [65], bat algorithm (BA) [66], teaching learning-based optimization (TLBO) [67], biogeography-based optimization (BBO) [68], memetic algorithm (MA) [69], and mine blast algorithm (MBA) [70]. The performance comparison of different hybrid harmony search algorithms is shown in Table 7.


Ref.Hybrid algorithmDescriptionApplicationPerformance

[51]SAPAR is modified by using the cooling concept of SATravelling salesman problemImprove reliability
[52]PSOBW is replaced with the concept of global-best particleOptimization problemsImprove performance
[53]DPSOPAR is dynamically updated by using the concept of DPSOPID controllerImprove performance
[54]CSACSA is employed to improve the harmony vectors in HSAFuzzy classification systemBetter classification accuracy
[55]GA, SA, AISGA, SA, and AIS are used to improve the solutions stored in HMTask schedulingBetter convergence, avoid the local optima
[56]GA, PSOGenetic mutation and position updating mechanism are used to improve the performanceReliability problemsHigher exploration capability
[A44]SQPSQP is employed to improve the local searchOptimization problemsImprove the effectiveness and robustness of HSA
[57]FCMFCM is integrated into HSA for improving the convergenceClusteringSuperior performance
[58]DEDE is employed to fine tune the harmony vectorsOptimization problemsImprovement in performance
[59]TaguchiTaguchi is used to initialize the harmony memoryShape optimizationAvoid premature convergence
[60]NM-SANM-SA is employed to enhance the search capability of HSAOptimization problemsBetter exploration capability
[71]GDL-FLANNSearch capability of GDL is used to optimize the weight of FLANNClassificationEnhance the classification accuracy
[61]Fuzzy logicFuzzy rules are used to select the best rules in fuzzy-based systemMedical diagnosisImprove the efficiency
[62]CSMutation operator is employed to improve the harmony in HSAOptimization problemsImprove the convergence
[63]ACOThe concepts of ACO are incorporated into HSAOptimal location of structural dampersImprove the convergence rate
[65]FAHSA is used to mutate the fireflies for escaping the solutions, which are being trapped into local optimaOptimization problemsLess computational cost

6. Applications

Due to the easy implementation and proficiency of HSA, it is used in a large number of applications. The applications of HSA are categorized into following classes such as image processing, clustering, civil engineering, electrical engineering, bioinformatics, software engineering, scheduling, mechanical engineering, industrial engineering, networking, and other engineering applications. Table 8 depicts the summarization of various applications of HSA. The applicability of HSA in different research domains is shown in Figure 6.


Broad areaProblem/applicationsAlgorithm usedReference

SchedulingCourse timetablingHSA, hybrid HSA[7274]
Flow shop schedulingDHSA, PGDHSA MOHSA, hybrid HSA[7579]
Civil engineeringStructural design optimizationHSA, DHSA[8086]
Bridge design optimizationHSA[87]
Mooring designHSA[88]
Cellular beam designHSA[89]
Water distribution networksHSA, PSO-HSA[9094]
Dam designHSA[95]
Ground water managementHSA[96, 97]
Site layout problemIHSA[98, 99]
Earthquake analysisHSA[100]
Electrical engineeringOptimal power flowMOHSA, HSA[101104]
Economic load dispatchHSA, FA-HAS, MOHSA[105111]
Virtual instrumentationHSA[112]
Placement of diesel generatorsHSA, MOHSA[113115]
Industrial engineeringOptimal vehicle pathHSA, MOHSA[116119]
Knapsack problemHybrid HSA[120, 121]
Machine sequencing problemHSA[122, 123]
Vanishing point detection in carHSA[124]
Geological hazards assessmentHSA[125]
ClusteringWeb clusteringHSA, hybrid HSA[126, 127]
Data clusteringHSA, hybrid HSA[128131]
Document summarizationHSA, global-best HSA[132, 133]
NetworkingMulticast routingHSA[134]
Muskingum flood routingHybrid HSA[135, 136]
Wireless sensor networksHSA[137139]
Image processingVisual tracking systemIHSA[140, 141]
SegmentationHSA[142144]
Software engineeringTestingHSA, hybrid HSA[145148]
Word sense disambiguationHSA[149]
Software defect detectionHSA[150]
Mechanical engineeringHeat pipe designHSA[151, 152]
Power generation systemIHSA[153, 154]
MillingHSA[155]
PhotonicsDetection of photon densityHSA[156]
Channel decodingHSA[157161]
HealthcareRNA structure predictionHSA[162, 163]
Hearing aidsHSA[164]
Influenza forecastHSA[165, 166]
Protein structure predictionHSA[167, 168]
Medical physicsHSA, DHSA[169171]
Health resource managementHSA[172177]
MiscellaneousGlobal optimizationHSA[178, 179]
Noise level estimationHSA[180]
Feature selectionHSA, IHSA, MOHSA[181]
AstronomyHSA[182]

6.1. Scheduling

The two major problems such as course timetabling and hob shop scheduling are targeted. The timetabling problem is a challenging task in any academic institutions. Al-Betar et al. [72] used a HSA for course timetabling problem. They modified the PAR to design the neighborhood structure. The neighborhood structure was divided into two different procedures with random acceptance rule. This rule was changed to accept the local change on new harmony vectors. Al-Betar et al. [73] proposed a hybrid HSA for course timetabling problem. They used hill climbing method to enhance the exploitation process. The global-best concept was incorporated in HSA for better convergence. The proposed method was tested on eleven datasets and attained the best result over the existing methods. The modification in HSA was proposed by Al-Betar and Khader [74] for timetabling problem. The HMCR and PAR were modified to change the acceptance rule. The proposed approach was evaluated on two Socha benchmarks. Modified HSA provided the high quality solutions on these benchmarks.

The flow shop problem has been widely used in chemical processing, pharmaceutical, and packing. Gao et al. [75] used discrete HSA (DHSA) to resolve the no-wait flow shop problem. The local search algorithms were incorporated in HSA to minimize the flow time for flow shop problem. Studies showed that DHSA gave better results than the HSA. Gao et al. [76] extended their work by incorporating Pareto-based grouping method. The proposed method was called Pareto-based grouping discrete harmony search algorithm (PGDHSA). The grouping approach was utilized to improvise the convergence. The results revealed that PGDHSA proved its efficiency and effectiveness with the other compared algorithms over the job shop scheduling problem. Yuan et al. [77] hybridized the HSA with local search to maintain the balance between exploration and exploitation phases. Beside this, the neighborhood structure was also improved. The proposed approach was tested on 201 benchmark test problems. Gao et al. [78] utilized the weighted combination of both completion time and tardiness for flexible job shop scheduling problem. The machine assignment and job permutation were used to memory initialization. The exploration capability of HSA was enhanced through local search operators. The proposed algorithm was evaluated on 49 benchmark instances and provided better results for scheduling problems. Yuan and Xu [79] proposed two algorithms, namely, hybrid HSA and large neighborhood search, for job shop scheduling problem. They hybridized both algorithms to improve the performance.

6.2. Civil Engineering

Lee and Geem [80] used HSA for truss structure optimization. They applied HSA on 10-bar planar truss, 17-bar planar truss, 18-bar planar truss, 22-bar space truss, 25-bar space truss, 72-bar space truss, 200-bar planar truss, and 120-bar dome space. The HSA provided the optimal solution for these problems. HSA was successfully applied on structural design problems [83]. The design of steel frames was optimized using HSA by Degertekin [81]. The load, resistance, and displacement constraints were considered during the optimization process. Huang et al. [82] used HSA for optimization of rectangular plate products in a steel plant. A variable neighborhood search algorithm was incorporated in HSA. The proposed method was effective for design problems. Lee et al. [84] designed a discrete HSA (DHSA) for truss optimization. The effectiveness of DHSA was tested on 72-bar space truss, 200-bar planer truss, and 120-bar dome space truss [85,89]. Saka [86] presented the HSA for selecting the optimal sections of beams and columns of steel frame. García-Segura et al. [87] presented a computer-aided program to study the post-tensioned concrete box-girder road bridges. HSA was used to optimize thirty-three design variables associated with box-girder road bridges. HSA was also utilized to minimize the cost of offshore mooring systems [88].

During the last few years, HSA was successfully used in designing of water distribution network and waste water management. The network has to be designed by keeping in mind the variations in the elevation, separations, and diameter of pipes. The network should be designed in a way to give smooth water supply with minimal cost. Geem [90] optimized the pipe diameters for water distribution network using HSA. EPANET was incorporated to determine the hydraulic constraints. This study found that HSA provided either the same cost or less cost (i.e., 0.28–10.26%) than the existing algorithms. The particle swarm concept was incorporated in DHSA for water network design [91]. Geem et al. [92] designed the optimal pipe network using HSA. The power loss criterion was incorporated in HSA to enhance the feasibility of pipe network. The switching problem in water pumping system was solved through HSA [93]. HSA was successfully used in various problems such hydrological parameter analysis [94], scheduling of dam system [95], ground water management [96,97], site layout selection [98,99], and earthquake analysis [100].

6.3. Electrical Engineering

Electrical engineering focuses primarily on the power supply optimization where the large amount of power is to be supplied with the minimal cost required [103]. Sivasubramani and Swarup [101] proposed a multiobjective HSA (MOHSA) to solve the optimal power flow problem. Both nondominated sorting and crowding distance were used to obtain the optimal Pareto front. The proposed MOHSA was evaluated on IEEE 30 bus system. MOHSA outperforms the NSGA-II in terms of optimal solutions. Vasebi et al. [105] presented HSA to solve the heat and power economic dispatch problem. The same problem was solved by Khorram and Jaberipour [106].

Khazali and Kalantar [107] designed a HSA for solving reactive power dispatch problem. The HSA was used to determine the generator voltages, positions of taps, and amount of reactive compensation devices. IEEE 30 and 57-bus systems were used to evaluate the performance of HSA. Elattar [108] proposed a modified HSA (MHSA) to solve economic emission dispatch problem. The control parameters of MHSA were modified according to the application. The roulette wheel selection mechanism was used in MHSA. MHSA attained better reduction in power generation cost as compared to the existing techniques. Rehman et al. [108] hybridized HSA with firefly algorithm (HSA-FA) for evaluation of energy management controller. Sivasubramani and Swarup [110] presented MOHSA for economic load dispatch. The fuel cost and emission were optimized simultaneously. The ranking procedure with dynamic crowding distance was used to develop the distributed Pareto-optimal set. The performance of MOHSA was tested on IEEE 30 and 118-bus systems.

Nekooei et al. [113] developed an improved MOHSA to assess the impact of distributed generators. The optimal scheduling of generators was done by Yadav et al. [114]. They used HSA to determine the optimal solution for reducing the fuel consumption. Ngonkham and Buasri [115] used HSA for solving economic dispatch problem in wind energy conversion system. The cost computed from HSA was reduced by 1.4%. HSA was used in variety of power engineering problems such as optimal design of LID [102], energy demand estimation [104], virtual instrumentation [112], and electrical field analysis [111].

6.4. Industrial Engineering

Geem et al. [116] used HSA to determine the optimal route for eastern part of China. The fourth party logistics problem with time windows (4PLTW) was solved through HSA [117]. HSA was able to determine the optimal path within reasonable time and cost. Huang et al. [118] minimized the route cost and time window penalties for 4PLTW. Alomoush et al. [120] hybridized HSA with Jaya search algorithm to solve the 0/1 knapsack problem. The penalty function was incorporated to handle the weight condition. Twenty different case studies were used to evaluate the performance of hybrid algorithm. Biao et al. [121] integrated fruit fly strategy into improved HSA (IHSA) for solving multidimensional knapsack problems. The global-best pitch adjustment and parallel updating strategy were also used to enhance the search. The well-known benchmark test instances were used to evaluate the performance of hybrid IHSA.

Fesanghary et al. [122] hybridized HSA with sequential quadratic programming to solve the constrained and nonconstrained engineering design problems. Nawaz et al. [123] used HSA for processing the jobs according to the priority assigned to jobs. The vanishing point is an important factor in self-driving vehicles. HSA was used to determine the vanishing point [124]. Yassen et al. [119] used HSA-optimizer and HSA-solver for vehicle routing problem. Mikaeil et al. [125] studied the risk of geological hazards on Ardabil-Mianeh highway tunnel using HSA. The tunnel instability, squeezing, and water inflow were assessed.

6.5. Clustering

Forsati et al. [126] proposed clustering algorithms based on the concept of HSA. K-means was hybridized with HSA to achieve better web clustering results. The proposed approach was tested on five different datasets and provided better convergence results than the K-means and HSA [128]. Cobos et al. [127] combined iterative global-best HSA with K-means for web clustering. Global-best HSA was used to search the space globally. K-means was used as local search for further improvement in clustering solutions. Bayesian information criterion was used to determine the number of clusters. The time complexity of the proposed approach was lesser than the existing clustering techniques.

Kumar et al. [130] developed an automatic data clustering technique using parameter adaptive harmony search algorithm (PAHSA). A variable length encoding scheme was used to determine the number of clusters automatically. The threshold setting and cutoff mechanisms were used to refine the search strategy. The proposed approach was evaluated on both UCI datasets and images. Alia et al. [131] used HSA to optimize the initial cluster centres of fuzzy c-means. Thereafter, it was applied on MRI images for segmentation. Shareghi and Hassanabadi [132] used HSA-based sentence selection for automatic text summarization. The readability, cohesion, and topic relevance were used to design the fitness function. Mendoza et al. [133] used global-best HSA and local search strategy for document summarization. The sentence length, coverage, and position of sentence were incorporated in fitness function. The proposed approach has less execution time than the other techniques. A survey on clustering techniques using harmony search algorithms was found in [129].

6.6. Networking

Forsati et al. [134] designed novel algorithms to solve the bandwidth-delay constrained multicast routing problem using HSA. The first algorithm utilized the modified Prufer number for multicast trees. The second algorithm used node parent index representation scheme for encoding the solutions. The solution quality and convergence of the proposed algorithm were analyzed. Karahan et al. [135] used hybrid HSA for the parameter estimation of Muskingum flood routing model. The penalty function was incorporated in the model to evade the negativity of outflows and storages. Zeng and Dong [136] proposed a new encoding scheme of harmony memory for routing in wireless sensor networks. The dynamic adaption strategy was used to improve the control parameter of IHSA. To improve the convergence speed, local search strategy was incorporated in IHSA.

Wireless sensor network (WSN) slowly and progressively gained the spotlight due to its capability of sensing any materialistic activity without using any cabled connection. Manjarres et al. [137] presented the hybridization of HSA with local search to alleviate the nonuniqueness of networks. The connectivity-based geometrical constraints were considered during the optimization process. Manjarres et al. [138] used a multiobjective harmony search algorithm for wireless sensor networks. The concepts of nondominated sorting and crowding distance were utilized in the proposed approach. The local search procedure was used to remove the flip ambiguity phenomenon. The information of node connectivity was utilized in the proposed approach. Landa-Torres et al. [139] designed a HSA to determine the number of access points for maximizing the coverage level of deployed network.

6.7. Image Processing

Fourie et al. [140] presented a visual tracking approach using HSA. The visual tracking was known as harmony filter. The harmony filter utilized the color histogram and found out the target location using Bhattacharya coefficient. This study revealed that the harmony filter has better accuracy and computational speed than particle filter and Kalman filter. Ebrahim et al. [141] presented a method to determine the best angular trajectory using HSA. HSA was applied to improve the image by performing edge preservation [142]. Edge preservation was done by both image conservation as well as an optimization process. The performance of the HSA was compared with histogram equalization algorithm and the proposed approach gave enhanced image output. Al-Betar et al. [143] utilized HSA for grey level image enhancement. The proposed approach was compared with histogram equalization and image adjacent algorithms. The results revealed that HSA provided better results than these algorithms in terms of entropy measure. The multilevel thresholding of an image was done through the HSA [144]. The image histograms were used to encode the harmony vectors. Ostu or Kapur methods were used for designing the objective function. The outcome was favorable to the Otsu method as compared to the Kapur method. It was also observed that HSA gave effectively optimized and accurate results.

6.8. Software Engineering

Alsewari and Zamli [145] developed a pairwise harmony search algorithm (PHSA) to perform the pairwise testing. Alsewari and Zamli [146] investigated the adoption of HSA in variable-strength t-way test generation strategy. The HSA provided the competitive results as compared to the existing test strategies. However, the proposed approach can be implemented in parallel fashion. The interaction test data were generated through HSA [147]. The greedy approach was used to generate a complete test suite. Mao [148] generated the test data by using HSA. He used probes for collecting the coverage information and inserted into the branches. The coverage factor was used to design the fitness function. The branch information was used to determine the weight of each branch. Abed et al. [149] developed an unsupervised method for word disambiguation using HSA. HSA-based dependency generator was used to parse sentences. The relatedness measurements and semantic similarity were used to design the fitness function. The evaluation of proposed approach was done on benchmark datasets and achieved effective solutions on these datasets. Kang et al. [93] presented just-in-time software defect prediction using HSA.

6.9. Mechanical Engineering

Geem and Hwangbo [151] developed a multiobjective HSA for thermal conductance and heat pipe design. The control parameters such as length of conduction fin, thickness of fin, operation temperature, and adhesive thickness were used to design the multiobjective function. Fesanghary et al. [152] hybridized the global sensitivity analysis and HSA for optimization of tube heat exchangers. The harmonic optimization in multilevel inverters was done through HSA [153]. Geem and Yoon [154] used HSA for charging schedule of energy storage system. However, lifetime, efficiency, and storage cost was considered in this system. Zarei et al. [155] presented a HSA to determine the optimal cutting parameters of face milling. The number of passes and cutting parameters were optimized through HSA. The main objective of this problem is to optimize the production cost.

6.10. Photonics

Dong et al. [156] presented a method for detection of photon density wave using HSA. The control parameters of HSA were adjusted to improve the search process. Zhang and Hanzo [157] designed a HSA-based multiuser detection and channel decoding for DS-CDMA systems. Ser et al. [158] hybridized both HSA and differential evolution (DE) for power allocation in an orthogonal frequency division multiple access downlink. The greedy subcarrier exchange technique was also incorporated in the hybrid algorithm. The well-known problems, which are improvised by HSA, are sensing multiple users in CDMA systems, organizing resources in an active cordless system [159] and developing radar codes [160] and management of telecommunication gadgets [161].

6.11. Healthcare

The medical care facility is worthy when it is accessible physically on demand. The location of medical centre, the distance between the patient and the centre, and modes of transportation available are the main factors of medical care facilities. HSA was used to establish a connection between the medical centres and their availability to people [174]. Nurse rostering problem is considered a combinatorial task with numerous restrictions [172]. In the study, HSA was used to resolve this problem. Harmony memory in HSA was used to save the improved changes in the solution during the evaluation process. HSA not only improved results but also exhibited efficient performance as compared to the other metaheuristic algorithms used for the same purpose [173]. In [174], HSA was used to find the most suitable place for constructing a medical centre. The combination of genetic algorithm and a local searching was used to search the area for medical care centre on the basis of the population of patients [176]. A multiobjective grouping harmony search algorithm (MOGHSA) was developed for the best possible allocation of medical centres, considering money, distance, and capability [177].

HSA have shown their acceptability for treatment of medical problems. For treating cancer, ionizing radiation is used and requires a proper strategy for getting efficient results. HSA come in play for enhancing the radioisotope positioning along with intensity of the radiation stream [169]. HSA is also used to probe into the large amounts of dose-rated prostate brachytherapy [170]. Another use of HSA is in the diagnosis of epileptic convulsion phenomenon. Differential harmony search algorithm (DHSA) is responsible for enhancing categorization and giving a precise result with minimal complexity [171]. The common medical problems solved by HSAs are hearing aids [164], influenza forecasting [165, 166], and protein structure prediction [167, 168].

6.12. Miscellaneous

Geem [178] and Kim et al. [179] utilized HSA for parameter estimation of Muskingum model. Mun and Geem [180] designed a method to determine the sound power levels of noise sources. The level of acoustic parameters and overall noise were used to evaluate the noise level. HSA was used to evaluate this process. Yusup et al. [181] presented a survey on feature selection and dimensionality reduction using harmony search algorithms. HSA was used to compute the Angstrom coefficient in the study and exhibited great outcome. It proved to be an effective method to improve the calculations and get enhanced outcome [182185].

7. Future Research Directions

In last few decades, researchers have investigated the control parameters of HSA in detail. Beside this, some researchers have also modified the basic structure of HSA by incorporating the concepts of other metaheuristics. However, there are a few open areas in HSA for further research. The possible research directions of HSA are given as follows.

7.1. Parameter Tuning

Parameter tuning is the most crucial step of any metaheuristic algorithms. More investigations are required to determine the optimal parameter setting of HSA and identified parameter setting should be applicable on a wide variety of applications. The parameter tuning problem is considered as an optimization problem. Automatic schemes are required to select the optimal parameters according to the given problem.

7.2. Theoretical Analysis

Most of the research articles did not provide any theoretical analysis of modification and improvement that was held in HSA. There is a need to study the HSA and give the reason why HSA performs better than others. The theoretical analysis of parameters, structure, and landscapes of fitness is required.

7.3. Many-Objective Optimization

Pareto-optimal dominance concept has been used in HSA to solve the many-objective problems. This concept was used to compare the solutions. Based upon this concept, the archive becomes quickly full for some optimization problems. Therefore, there is a need to use the special operators such as hypervolume, reference vector adaption strategy, and knee points.

7.4. Multiobjective Optimization

A number of multiobjective harmony search algorithms have been developed. Still, there is some scope that can be targeted in near future. The existing algorithms utilized the concept of archive. Some other mechanisms and multiobjective operators are available in literature, which can be utilized to solve the multiobjective problems.

8. Conclusions

More than 100 papers were studied and analyzed to highlight the strength, weakness, and robustness of HSA. A comprehensive review of the HSA is presented in this paper. The aim of this paper is to provide the summarized overview and research applications of HSA. HSA variants such as binary, chaotic, multiobjective, and hybridized are analyzed with merits and demerits. The control parameters of HSA are studied in detail. It is observed from the literature that HSA has wide applicability in engineering, networking, scheduling, classification, bioinformatics, and other problems. HSA allows improvising the method by either making changes in some of its parameters or by hybridizing it with a different algorithm.

After study of this paper, the researchers can apply HSA in their research problems. The researchers can pay attention to some applications and variants of HSA after examining the merits and demerits of HSA. The researchers can try to explore the HSA for solving the many-objective optimization problems. There are few open areas for improvement and hybridization of HSA with other algorithms [186].

Data Availability

Data will be made available upon request to the corresponding author.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: overview and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at: Publisher Site | Google Scholar
  2. L. Velho, P. Carvalho, J. Gomes, and L. D. Figueiredo, Mathematical Optimization in Computer Graphics and Vision, Elsevier, Amsterdam, Netherland, 2008.
  3. H. Pannu, D. Singh, and A. Kaur Malhi, “Multi-objective particle swarm optimization-based adaptive neuro-fuzzy inference system for benzene monitoring,” Neural Computing and Applications, vol. 31, no. 7, pp. 2195–2205, 2019. View at: Publisher Site | Google Scholar
  4. H. S. Pannu, D. Singh, and A. K. Malhi, “Improved particle swarm optimization based adaptive neuro‐fuzzy inference system for benzene detection,” CLEAN–Soil, Air, Water, vol. 46, no. 5, Article ID 1700162, 2018. View at: Publisher Site | Google Scholar
  5. Z. W. Geem, J. H. Kim, and G. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001. View at: Google Scholar
  6. V. Kumar, J. K. Chhabra, and D. Kumar, ““Effect of harmony search parameters’ variation in clustering,” Procedia Technology, vol. 6, pp. 265–274, 2012. View at: Publisher Site | Google Scholar
  7. D. Moher and A. Liberati, “The PRISMA Group (2009) Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statement,” PLoS Med, vol. 6, 2009. View at: Publisher Site | Google Scholar
  8. M. Mahdavi, M. Fesanghary, and E. Damangir, “An improved harmony search algorithm for solving optimization problems,” Applied Mathematics and Computation, vol. 188, pp. 1567–1579, 2007. View at: Publisher Site | Google Scholar
  9. Q. K. Pan, P. N. Suganthan, M. F. Tasgetiren et al., “A self-adaptive global best harmony search algorithm for continuous optimization problems,” Appl. Math. Comput., vol. 216, pp. 830–848, 2010. View at: Publisher Site | Google Scholar
  10. S. Das, A. Mukhopadhyay, A. Roy, A. Abraham, and B. K. Panigrahi, “Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 41, no. 1, pp. 89–106, 2011. View at: Publisher Site | Google Scholar
  11. Z. Kong, L. Gao, L. Wang, and Y. Ge, “On an adaptive harmony search algorithm,” International Journal of Innovative Computing, Information and Control, vol. 5, no. 9, pp. 2551–2560, 2009. View at: Google Scholar
  12. C. M. Wang and Y. F. Huang, “Self adaptive harmony search algorithm for optimization,” Journal of Applied Mathematics, vol. 37, no. 4, pp. 2826–2837, 2010. View at: Publisher Site | Google Scholar
  13. K. Luo, “A novel self-adaptive harmony search algorithm,” Journal of Applied Mathematics, vol. 2013, Article ID 653749, 16 pages, 2013. View at: Publisher Site | Google Scholar
  14. J. Chen, Q. K. Pan, and J. Q. Li, “Harmony search algorithm with dynamic control parameters,” Applied Mathematics and Computation, vol. 219, pp. 592–604, 2012. View at: Publisher Site | Google Scholar
  15. A. Kattan and R. Abdullah, “A dynamic self-adaptive harmony search algorithm for continuous optimization problems,” Applied Mathematics and Computation, vol. 219, pp. 8542–8567, 2013. View at: Publisher Site | Google Scholar
  16. J. Kalivarapu, S. Jain, and S. Bag, “An improved harmony search algorithm with dynamically varying bandwidth,” Applied Mathematics and Computation, vol. 48, pp. 1091–1108, 2016. View at: Publisher Site | Google Scholar
  17. V. Kumar, J. K. Chhabra, and D. Kumar, “Parameter adaptive harmony search algorithm for unimodal and multimodal optimization problems,” Journal of Computational Science, vol. 5, no. 2, pp. 144–155, 2014. View at: Publisher Site | Google Scholar
  18. V. Kumar, J. K. Chhabra, and D. Kumar, “Clustering using modified harmony search algorithm,” International Journal of Computational Intelligence Studies, vol. 3, no. 2/3, pp. 113–133, 2014. View at: Publisher Site | Google Scholar
  19. M. Khalili, R. Kharrat, K. Salahshoor et al., “Global dynamic harmony search algorithm: Gdhs,” Applied Mathematics and Computation, vol. 228, pp. 195–219, 2014. View at: Publisher Site | Google Scholar
  20. Z. Guo, H. Yang, S. Wang et al., “Adaptive harmony search with best-based search strategy,” Soft Computing, vol. 22, pp. 1335–1349, 2018. View at: Publisher Site | Google Scholar
  21. Y. Wang, Z. Guo, and Y. Wang, “Enhanced harmony search with dual strategies and adaptive parameters,” Soft Computing, vol. 21, pp. 4431–4445, 2017. View at: Publisher Site | Google Scholar
  22. N. Siddique and H. Adeli, “Harmony search algorithm and its variants,” International Journal of Pattern Recognition and Artificial Intelligence, vol. 29, no. 8, 2015. View at: Publisher Site | Google Scholar
  23. J. Yi, C. Lu, and G. Li, “A literature review on latest developments of Harmony Search and its applications to intelligent manufacturing,” Mathematical Biosciences and Engineering, vol. 16, no. 4, pp. 2086–2117, 2019. View at: Publisher Site | Google Scholar
  24. R. Enayatifar, M. Yousefi, A. H. Abdullah et al., “LAHS: a novel harmony search algorithm based on learning automata,” Communications in Nonlinear Science and Numerical Simulation, vol. 18, pp. 3481–3497, 2013. View at: Publisher Site | Google Scholar
  25. V. Kumar, J. K. Chhabra, and D. Kumar, “Variance-based harmony search algorithm for unimodal and multimodal optimization problems with application to clustering,” Cybernetics and Systems, vol. 45, no. 6, pp. 486–511, 2014. View at: Publisher Site | Google Scholar
  26. Z. W. Geem and K.-B. Sim, “Parameter-setting-free harmony search algorithm,” Applied Mathematics and Computation, vol. 217, no. 8, pp. 3881–3889, 2010. View at: Publisher Site | Google Scholar
  27. Y.-W. Jeong, S.-M. Park, Z. W. Geem, K.-B. Sim, and “, “Advanced parameter-setting-free harmony search algorithm,” Applied Sciences, vol. 10, no. 7, 2020. View at: Publisher Site | Google Scholar
  28. S. Jiang, Y. Zhang, P. Wang, and M. Zheng, “An almost-parameter-free harmony search algorithm for groundwater pollution source identification,” Water Science Technology, vol. 68, no. 11, pp. 2359–2366, 2013. View at: Publisher Site | Google Scholar
  29. M. Shaqfa and Z. Orban, “Modified parameter-setting-free harmony search (PSFHS) algorithm for optimizing the design of reinforced concrete beams,” Structural and Multidisciplinary Optimization, vol. 60, pp. 999–1019, 2019. View at: Publisher Site | Google Scholar
  30. S. Mun and Y.-H. Cho, “Modified harmony search optimization for constrained design problems,” Expert Systems with Applications, vol. 39, no. 1, pp. 419–423, 2012. View at: Publisher Site | Google Scholar
  31. G. Li and H. Wang, “Improved harmony search algorithm for global optimization,” Chinese Control and Decision, vol. 21, 2018. View at: Google Scholar
  32. H.-B. Ouyang, L.-Q. Gao, S. Li, X.-Y. Kong, Q. Wang, and D.-X. Zou, “Improved harmony search algorithm: LHS,” Applied Mathematics and Computation, vol. 53, pp. 133–167, 2017. View at: Publisher Site | Google Scholar
  33. B. Alatas, “‘‘Chaotic harmony search algorithms,” Applied Mathematics and Computation, vol. 216, no. 3, pp. 2687–2699, 2010. View at: Publisher Site | Google Scholar
  34. M. F. El-Santawy, A. N. Ahmed, Z. El-Dean, and A. Ramadan, “‘‘Chaotic harmony search optimizer for solving numerical integration,” Computer Science and Information Systems, vol. 16, no. 2, pp. 21–24, 2012. View at: Google Scholar
  35. O. Abdel-Raouf, I. El-henawy, and M. Abdel-Baset, “‘‘Chaotic harmony search algorithm with different chaotic maps for solving assignment problems,” International Journal of Applied and Computational, vol. 86, no. 10, pp. 1–6, 2014. View at: Publisher Site | Google Scholar
  36. O. Abdel-Raouf, I. El-Henawy, and M. Abdel-Baset, “‘‘A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles,” International Journal of Applied and Computational, vol. 6, no. 3, p. 38, 2014. View at: Publisher Site | Google Scholar
  37. M. Shafaati and H. Mojallali, “IIR filter optimization using improved chaotic harmony search algorithm,” Automatika, vol. 59, no. 3-4, pp. 331–339, 2018. View at: Publisher Site | Google Scholar
  38. A. Askarzadeh, “A discrete chaotic harmony search-based simulated annealing algorithm for optimum design of PV/wind hybrid system,” Solar Energy, vol. 97, pp. 93–101, 2013. View at: Publisher Site | Google Scholar
  39. J. Yi, C.-H. Chu, and L. Gao, “Parallel chaotic local search enhanced harmony search algorithm for engineering design optimization,” Journal of Intelligent Manufacturing, vol. 30, pp. 405–428, 2019. View at: Publisher Site | Google Scholar
  40. L. Wang, R. Yang, Y. Xu, Q. Niu, P. M. Pardalos, and M. Fei, “‘‘An improved adaptive binary harmony search algorithm,” ’Inf. Sci., vol. 232, pp. 58–87, 2013. View at: Publisher Site | Google Scholar
  41. M. Ravindra, R. S. Rao, and V. S. NagaRaju, “A binary harmony search algorithm approach for security constrained allocation of PMUs to obtain complete observability,,” in Intelligent Communication, Control and Devices, S. Choudhury, R. Mishra, R. Mishra, and A. Kumar, Eds., vol. 989, Springer, Singapore, 2020. View at: Google Scholar
  42. G. Lin and Z. Li, “A hybrid binary harmony search algorithm for solving the winner determination problem,” International Journal of Innovative Computing and Applications, vol. 10, no. 1, pp. 59–68, 2019. View at: Publisher Site | Google Scholar
  43. X. Kong, L. Gao, H. Ouyang, and S. Li, ““A simplified binary harmony search algorithm for large scale 0–1 knapsack problems,” Expert Systems with Applications, vol. 42, pp. 5337–5355, 2015. View at: Publisher Site | Google Scholar
  44. Z. W. Geem, “‘‘Multiobjective optimization of time-cost trade-off using harmony search,” Journal of Construction Engineering and Management, vol. 136, no. 3, pp. 711–716, 2010. View at: Publisher Site | Google Scholar
  45. H. Xu, X. Z. Gao, T. Wang, and K. Xue, “Harmony search optimization algorithm: application to a reconfigurable mobile robot prototype,” in Recent Advances in Harmony Search Algorithm, Studies in Computational Intelligence, vol. vol. 270, pp. 11–22, Springer, Singapore, 2010. View at: Google Scholar
  46. J. Ricart, G. Huttemann, J. Lima, and B. Baran, “Multiobjective harmony search algorithm proposals,” Electronics Notes in Theoretical Computer Science, vol. 281, pp. 51–67, 2011. View at: Publisher Site | Google Scholar
  47. Y. H. Choi, H. M. Lee, D. G. Yoo, and J. H. Kim, “Application of self-adaptive method in multi-objective harmony search algorithm,” Harmony Search Algorithm, vol. 20, pp. 15–21, 2017. View at: Google Scholar
  48. A. Prajapati, J. K. Chhabra, and MaD. H. S. “, “Many-objective discrete harmony search to improve exiting package design,” Computational Intelligence, vol. 35, no. 1, pp. 98–123, 2019. View at: Publisher Site | Google Scholar
  49. L. Wang, Y. Mao, Q. Niu, and M. Fei, “A multi-objective binary harmony search algorithm,”,” in Advances in Swarm Intelligence, Y. Tan, Y. Shi, Y. Chai, and G. Wang, Eds., vol. vol. 6729, Springer, Singapore, 2011. View at: Google Scholar
  50. P. Sabrinath, “Multiobjective optimization method based on adaptive parameter harmony search algorithm,” Journal of Applied Mathematics, vol. 2015, 12 pages, 2015. View at: Publisher Site | Google Scholar
  51. N. Taherinejad, “Highly reliable harmony search algorithm,” Circuit Theory and Design, Springer, Singapore, 2009. View at: Google Scholar
  52. M. G. H. Omran and M. Mahdavi, “Global-best harmony search,” Applied Mathematics and Computation, vol. 198, no. 2, pp. 643–656, 2008. View at: Publisher Site | Google Scholar
  53. L. D. Santos Coelho and D. L. de Andrade Bernert, “An improved harmony search algorithm for synchronization of discrete-time chaotic systems,” Chaos Solitons Fractals, vol. 41, no. 5, pp. 2526–2532, 2009. View at: Publisher Site | Google Scholar
  54. X. Wang, X. Z. Gao, and S. J. Ovaska, “Fusion of clonal selection algorithm and harmony search method in optimisation of fuzzy classification systems,” International Journal of Bio-Inspired Computation, vol. 1, no. 1, pp. 80–88, 2009. View at: Publisher Site | Google Scholar
  55. Y. C. Lee and A. Y. Zomaya, ““Interweaving heterogeneous metaheuristics using harmony search,” in Proceedings of the IEEE International Symposium on Parallel & Distributed Processing, pp. 1–8, Atlanda, GA, USA, 2009. View at: Google Scholar
  56. D. Zou, L. Gao, J. Wu, S. Li, and Y. Li, “A novel global harmony search algorithm for reliability problems,” Computers & Industrial Engineering, vol. 58, no. 2, pp. 307–316, 2010. View at: Publisher Site | Google Scholar
  57. O. M. Alia, R. Mandava, and M. E. Aziz, “A hybrid harmony search algorithm to mri brain segmentation,” in Proceedings of the IEEE International Conference on Cognitive Informatics, Tsinghua University, Beijing, China, 2010. View at: Google Scholar
  58. X. Z. Gao, X. Wang, and S. J. Ovaska, ““Modified harmony search methods for uni-modal and multi-modal optimization,” in Proceedings of the International Conference on Hybrid Intelligent Systems, pp. 65–72, Barcelona, Spain, 2008. View at: Google Scholar
  59. A. Yildiz and F. Ozturk, “Hybrid taguchi-harmony search approach for shape optimization,,” in Recent Advances in Harmony Search Algorithm, Z. Geem, Ed., pp. 89–98, Springer, Berlin, Germany, 2010. View at: Google Scholar
  60. W. S. Jang, H. I. Kang, and B. H. Lee, ““Hybrid simplex-harmony search method for optimization problems,” in Congress on Evolutionary Computation, pp. 4157–4164, Springer, Berlin, Germany, 2008. View at: Google Scholar
  61. S. M. Mousavi, S. Abdullah, S. T. A. Niaki, and S. Banihashemi, “An intelligent hybrid classification algorithm integrating fuzzy rule-based extraction and harmony search optimization: medical diagnosis applications,” Knowledge-based Systems, vol. 2020, Article ID 106943, 2021. View at: Google Scholar
  62. G.-G. Wang, A. H. Gandomi, X. Zhao, and H. C. E. Chu, “Hybridizing harmony search algorithm with cuckoo search for global numerical optimization,” Soft Computing, vol. 20, pp. 273–285, 2016. View at: Publisher Site | Google Scholar
  63. F. Amini and P. Ghaderi, “Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers,” Soft Computing, vol. 13, no. 5, pp. 2272–2280, 2013. View at: Publisher Site | Google Scholar
  64. A. Fouad, D. Boukhetala, F. Boudjema et al., “A novel global harmony search method based on ant colony optimisation algorithm,” Journal of Experimental and Theoretical Artificial Intelligence, vol. 28, pp. 215–238, 2016. View at: Publisher Site | Google Scholar
  65. L. Guo, G.-G. Wang, H. Wang, and D. Wang, “An effective hybrid firefly algorithm with harmony search for global numerical optimization,” The Scientific World Journal, vol. 1, 2013. View at: Google Scholar
  66. G. Wang and L. Guo, “A novel hybrid bat algorithm with harmony search for global numerical optimization,” Journal of Applied Mathematics, vol. 2013, Article ID 696491, 21 pages, 2013. View at: Publisher Site | Google Scholar
  67. S. Tuo, L. Yong, and T. Zhou, “An improved harmony search based on teaching-learning strategy for unconstrained optimization problems,” Mathematical Problems in Engineering, vol. 2013, Article ID 413565, 21 pages, 2013. View at: Publisher Site | Google Scholar
  68. G. Wang, L. Guo, H. Duan et al., “Hybridizing harmony search with biogeography based optimization for global numerical optimization,” Journal of Computational and Theoretical Nanoscience, vol. 10, pp. 2312–2322, 2013. View at: Publisher Site | Google Scholar
  69. G. Zhang and Y. Li, “A memetic algorithm for global optimization of multimodal nonseparable problems,” IEEE, vol. 46, pp. 1375–1387, 2016. View at: Publisher Site | Google Scholar
  70. A. Sadollah, H. Sayyaadi, D. G. Yoo et al., “Mine blast harmony search: a new hybrid optimization method for improving exploration and exploitation capabilities,” Applied Soft Computing, vol. 68, pp. 548–564, 2018. View at: Publisher Site | Google Scholar
  71. B. Naik, J. Nayak, and H. S. Behra, “A global-best harmony search based gradient descent learning FLANN (GbHS-GDL-FLANN) for data classification,” Egyptian Informatics Journal, vol. 17, no. 1, pp. 57–87, 2016. View at: Publisher Site | Google Scholar
  72. M. A. Al-Betar, A. T. Khader, and I. Y. Liao, “‘‘A harmony search with multi-pitch adjusting rate for the University course timetabling,” in Recent Advances in Harmony Search Algorithm, pp. 147–161, Springer, Berlin, Germany, 2010. View at: Google Scholar
  73. M. A. Al-Betar and A. T. M. Khader Zaman, “‘‘University course timetabling using a hybrid harmony search metaheuristic algorithm,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 42, no. 5, pp. 664–681, 2012. View at: Publisher Site | Google Scholar
  74. M. A. Al-Betar and A. T. Khader, “‘‘A harmony search algorithm for University course timetabling,” Annals of Operations Research, vol. 194, no. 3, pp. 3–31, 2012. View at: Publisher Site | Google Scholar
  75. K.-Z. Gao, Q.-K. Pan, and J.-Q. Li, “‘‘Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion,” The International Journal of Advanced Manufacturing Technology, vol. 56, no. 5–8, pp. 683–692, 2011. View at: Publisher Site | Google Scholar
  76. K.-Z. Gao, P. N. Suganthan, Q.-K. Pan, T. J. Chua, T. X. Cai, and C.-S. Chong, “‘‘Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling,” The International Journal of Advanced Manufacturing Technology, vol. 289, pp. 76–90, 2014. View at: Publisher Site | Google Scholar
  77. Y. Yuan, H. Xu, and J. Yang, “‘‘A hybrid harmony search algorithm for the flexible job shop scheduling problem,” vol. 13, no. 3, pp. 3259–3272, 2013. View at: Publisher Site | Google Scholar
  78. K.-Z. Gao, P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai, and C. S. Chong, “‘‘Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives,” Journal of Intelligent Manufacturing, vol. 27, no. 2, pp. 363–374, 2016. View at: Publisher Site | Google Scholar
  79. Y. Yuan and H. Xu, “‘‘An integrated search heuristic for large-scale flexible job shop scheduling problems,” Computers & Operations Research, vol. 40, no. 12, pp. 2864–2877, 2013. View at: Publisher Site | Google Scholar
  80. S. Lee and Z. W. Geem, “‘‘A new structural optimization method based on the harmony search algorithm,” Computers & Operations Research, vol. 82, no. 9–10, pp. 781–798, 2004. View at: Publisher Site | Google Scholar
  81. S. O. Degertekin, “‘Optimum design of steel frames using harmony search algorithm,” Structural and Multidisciplinary Optimization, vol. 36, no. 3, pp. 393–401, 2008. View at: Publisher Site | Google Scholar
  82. M. Huang, H.-Y. Dong, X.-W. Wang, B.-L. Zheng, and W. H. Ip, “‘Guided variable neighborhood harmony search for integrated charge planning in primary steelmaking processes,” Genetic Programming and Evolvable Machines, vol. 2009, pp. 231–238, 2009. View at: Google Scholar
  83. Z. W. Geem, Harmony Search Algorithms for Structural Design Optimization, vol. vol. 239, Springer, Berlin, Germany, 2009.
  84. K. S. Lee, Z. W. Geem, S.-H. Lee, and K.-W. Bae, “The harmony search heuristic algorithm for discrete structural optimization,” Optimization and Engineering, vol. 37, no. 7, pp. 663–684, 2005. View at: Publisher Site | Google Scholar
  85. K. S. Lee, S. W. Han, and Z. W. Geem, “Discrete size and discrete-continuous configuration optimization methods for truss structures using the harmony search algorithm,” International Journal of Optimization in Civil Engineering, vol. 1, pp. 107–126, 2011. View at: Google Scholar
  86. M. P. Saka, “‘‘Optimum design of steel sway frames to BS5950 using harmony search algorithm,” International Journal of Optimization in Civil Engineering, vol. 65, no. 3, pp. 36–43, 2009. View at: Publisher Site | Google Scholar
  87. T. García-Segura, V. Yepes, and J. A. González, “‘‘Computer-support tool to optimize bridges automatically,” International Journal of Computational Methods and Experimental Measurements, vol. 5, no. 3, pp. 171–178, 2017. View at: Publisher Site | Google Scholar
  88. S. Ryu, A. S. Duggal, C. N. Heyl, and Z. W. Geem, “‘‘Cost-optimized FPSO mooring design via harmony search,” Journal of Offshore Mechanics and Arctic Engineering, vol. 138, no. 6, Article ID 061303, 2016. View at: Publisher Site | Google Scholar
  89. F. E. E. Doˇgan and M. P. Saka, “‘‘Optimum design of cellular beams using harmony search and particle swarm optimizers,” Journal of Constructional Steel Research, vol. 67, no. 3, pp. 237–247, 2011. View at: Google Scholar
  90. Z. W. Geem, “‘‘Optimal cost design of water distribution networks using harmony search,” Optimization and Engineering, vol. 38, no. 3, pp. 259–277, 2006. View at: Publisher Site | Google Scholar
  91. Z. W. Geem, “‘‘Particle-swarm harmony search for water network design,” Optimization and Engineering, vol. 41, no. 3, pp. 297–311, 2009. View at: Publisher Site | Google Scholar
  92. Z. W. Geem, J. H. Kim, and G. Loganathan, “‘‘Harmony search optimization: application to pipe network design,” International Journal of Modelling and Simulation, vol. 22, no. 3, pp. 125–133, 2002. View at: Publisher Site | Google Scholar
  93. Z. W. Geem, “‘‘Harmony search in water pump switching problem,” International Journal of Modelling and Simulation, vol. 3612, pp. 751–760, 2005. View at: Publisher Site | Google Scholar
  94. Z. W. Geem, “‘‘Hydraulic analysis of water distribution network using harmony search,” International Journal of Modelling and Simulation, vol. 2009, pp. 1–9, 2009. View at: Google Scholar
  95. Z. W. Geem, “‘‘Optimal scheduling of multiple dam system using harmony search algorithm,” International Journal of Modelling and Simulation, vol. 4507, pp. 316–323, 2007. View at: Google Scholar
  96. M. T. Ayvaz, “‘‘Application of harmony search algorithm to the solution of groundwater management models,” Advances in Water Resources, vol. 32, no. 3, pp. 916–924, 2009. View at: Google Scholar
  97. Z. W. Geem and J. C. Williams, “‘‘Ecological optimization using harmony search,” Advances in Water Resources, vol. 4, pp. 148–152, 2008. View at: Google Scholar
  98. Y. M. Cheng, L. Li, T. Lansivaara, S. C. Chi, and Y. J. Sun, “‘‘An improved harmony search minimization algorithm using different slip surface generation methods for slope stability analysis,” Optimization and Engineering, vol. 40, no. 2, pp. 95–115, 2008. View at: Publisher Site | Google Scholar
  99. R. Gholizadeh, G. G. Amiri, and B. Mohebi, “‘‘An alternative approach to a harmony search algorithm for a construction site layout problem,” Canadian Journal of Civil Engineering, vol. 37, no. 12, pp. 1560–1571, 2010. View at: Publisher Site | Google Scholar
  100. A. H. Kayhan, K. A. Korkmaz, and A. Irfanoglu, “‘‘Selecting and scaling real ground motion records using harmony search algorithm,” Soil Dynamics Earthquake Engineering, vol. 31, no. 7, pp. 941–953, 2011. View at: Google Scholar
  101. S. Sivasubramani and K. Swarup, “‘‘Multi-objective harmony search algorithm for optimal power flow problem,” International Journal of Electrical Power & Energy Systems, vol. 33, no. 3, pp. 745–752, 2011. View at: Publisher Site | Google Scholar
  102. F. De Paola, M. Giugni, F. Pugliese, and P. Romano, “‘‘Optimal design of LIDs in urban storm water systems using a harmony-search decision support system,” Water Resources Management, vol. 32, no. 3, pp. 4933–4951, 2018. View at: Publisher Site | Google Scholar
  103. D. Manjarres, “‘‘A survey on applications of the harmony search algorithm,” Engineering Applications of Artificial Intelligence, vol. 26, no. 8, pp. 1818–1831, 2013. View at: Publisher Site | Google Scholar
  104. H. Ceylan, H. Ceylan, S. Haldenbilen, and O. Baskan, “‘‘Transport energy modeling with meta-heuristic harmony search algorithm, an application to Turkey,” Energy Policy, vol. 36, no. 7, pp. 2527–2535, 2008. View at: Publisher Site | Google Scholar
  105. A. Vasebi, M. Fesanghary, and S. M. T. Bathaee, “‘‘Combined heat and power economic dispatch by harmony search algorithm,” International Journal of Electrical Power & Energy Systems, vol. 29, no. 3, pp. 713–719, 2007. View at: Publisher Site | Google Scholar
  106. E. Khorram and M. Jaberipour, “‘‘Harmony search algorithm for solving combined heat and power economic dispatch problems,” Energy Conversion and Management, vol. 52, no. 2, pp. 1550–1554, 2011. View at: Publisher Site | Google Scholar
  107. A. H. Khazali and M. Kalantar, “‘‘Optimal reactive power dispatch based on harmony search algorithm,” International Journal of Electrical Power & Energy Systems, vol. 33, no. 3, pp. 684–692, 2011. View at: Publisher Site | Google Scholar
  108. E. E. Elattar, “‘‘Modified harmony search algorithm for combined economic emission dispatch of microgrid incorporating renewable sources,” Energy, vol. 159, pp. 496–507, 2018. View at: Publisher Site | Google Scholar
  109. A. U. Rehmanet al., “‘‘Efficient energy management system using firefly and harmony search algorithm,” Broadband Wireless Computational, vol. 12, pp. 37–49, 2017. View at: Publisher Site | Google Scholar
  110. S. Sivasubramani and K. Swarup, “‘Environmental/economic dispatch using multi-objective harmony search algorithm,” Electric Power Systems Research, vol. 81, no. 9, pp. 1778–1785, 2011. View at: Publisher Site | Google Scholar
  111. J. Park, K.-H. Lee, J. Park, H. Choi, and I.-M. Lee, “‘‘Predicting anomalous zone ahead of tunnel face utilizing electrical resistivity: I. Algorithm and measuring system development,” Tunnelling Underground Space Technology, vol. 60, pp. 141–150, 2016. View at: Publisher Site | Google Scholar
  112. M. Navarro, J. M. Corchado, and Y. Demazeau, “Modeling a harmonic composition system with virtual organizations to assist novice composers,” Expert Systems with Applications, vol. 57, pp. 345–355, 2016. View at: Publisher Site | Google Scholar
  113. K. Nekooei, M. M. Farsangi, H. Nezamabadi-Pour, and K. Y. Lee, “An improved multi-objective harmony search for optimal placement of DGs in distribution systems,” IEEE Transactions Smart Grid, vol. 4, no. 1, pp. 557–567, 2013. View at: Google Scholar
  114. P. Yadav, R. Kumar, S. K. Panda, and C. S. Chang, “‘‘An improved harmony search algorithm for optimal scheduling of the diesel generators in oil rig platforms,” Energy Conversion and Management, vol. 52, no. 2, pp. 893–902, 2011. View at: Publisher Site | Google Scholar
  115. S. Ngonkham and P. Buasri, “‘‘Harmony search algorithm to improve cost reduction in power generation system integrating large scale wind energy conversion system,” World Non-Grid-Connected Wind Power Energy, vol. 2009, pp. 1–5, 2009. View at: Google Scholar
  116. Z. W. Geem, C.-L. Tseng, and Y. Park, “‘‘Harmony search for generalized orienteering problem: best touring in China,” Energy Conversion and Management, vol. 3612, pp. 741–750, 2005. View at: Publisher Site | Google Scholar
  117. G. Bo, M. Huang, W. H. Ip, and X. Wang, “‘‘The harmony search fourth routing optimization in fourth party logistics with time windows,” in Proceedings of the IEEE Congress on Evolutionary Computation 2011, pp. 962–967, CEC), New Orleans, LA, USA, May 2009. View at: Google Scholar
  118. M. Huang, G. Bo, X. Wang, and W. H. Ip, “‘‘The optimization of routing in fourth-party logistics with soft time windows using harmony search,” in Proceedings of the 6th International Conference on Natural Computation, pp. 4344–4348, Changsha, China, August 2010. View at: Google Scholar
  119. E. T. Yassen, M. Ayob, M. Z. A. Nazri, and N. R. Sabar, “‘‘Meta-harmony search algorithm for the vehicle routing problem with time windows,” Journal of Information Science, vol. 325, pp. 140–158, Dec. 2015. View at: Google Scholar
  120. A. Alomoush, A. A. Alsewari, H. S. Alamri, and K. Z. Zamli, “‘‘Solving0/1 knapsack problem using hybrid HS and Jaya algorithms,” Advanced Science Letters, vol. 24, no. 3, pp. 7486–7489, 2018. View at: Publisher Site | Google Scholar
  121. B. Zhang, Q.-K. Pan, X.-L. Zhang, and P.-Y. Duan, “‘‘An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems,” Applied Soft Computing, vol. 29, pp. 288–297, 2015. View at: Publisher Site | Google Scholar
  122. M. Fesanghary, M. Mahdavi, M. Minary-Jolandan, and Y. Alizadeh, “‘‘Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems,” vol. 197, no. 3, pp. 3080–3091, 2008. View at: Publisher Site | Google Scholar
  123. M. Nawaz, E. E. Enscore, and I. Ham, “‘‘A heuristic algorithm for them-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 3, pp. 91–95, 1983. View at: Publisher Site | Google Scholar
  124. Y. Y. Moon, Z. W. Geem, and G.-T. Han, “‘‘Vanishing point detection for self-driving car using harmony search algorithm,” Swarm and Evolutionary Computation, vol. 41, pp. 111–119, 2018. View at: Publisher Site | Google Scholar
  125. R. Mikaeil, S. S. Haghshenas, Y. Shirvand, M. V. Hasanluy, and V. Roshanaei, “‘‘Risk assessment of geological hazards in a tunneling project using harmony search algorithm (case study: Ardabil-Mianeh railway tunnel),” Civil Engineering Journal, vol. 2, no. 10, pp. 546–554, 2016. View at: Publisher Site | Google Scholar
  126. R. Forsati, M. Mahdavi, M. Kangavari, and B. Safarkhani, “‘‘Web page clustering using harmony search optimization,” Swarm and Evolutionary Computation, vol. 2008, pp. 1601–1604, 2008. View at: Google Scholar
  127. C. Cobos, J. Andrade, W. Constain, M. Mendoza, and E. León, “‘‘Web document clustering based on global-best harmony search, K-means, frequent term sets and Bayesian information criterion,” IEEE, vol. 2, pp. 1–8, 2010. View at: Google Scholar
  128. R. Forsati, M. Meybodi, M. Mahdavi, and A. Neiat, “‘‘Hybridization of K-means and harmony search methods for Web page clustering,” IEEE, vol. 1, pp. 329–335, 2008. View at: Google Scholar
  129. L. A. Abualigah, A. Diabat, and Z. W. Geem, “A comprehensive survey of the harmony search algorithm in clustering applications,,” Applied Sciences (Switzerland), vol. 10, no. 11, 2020. View at: Publisher Site | Google Scholar
  130. V. Kumar, J. K. Chhabra, and D. Kumar, “Automatic data clustering using parameter adaptive harmony search algorithm and its application to image segmentation,” Journal of Intelligent Systems, vol. 25, no. 4, 2016. View at: Publisher Site | Google Scholar
  131. O. M. Alia, R. Mandava, D. Ramachandram, and M. E. Aziz, “‘‘Harmony search-based cluster initialization for fuzzy c-means segmentation of MR images,” IEEE Region, vol. 4, pp. 1–6, 2009. View at: Google Scholar
  132. E. Shareghi and L. S. Hassanabadi, “‘‘Text summarization with harmony search algorithm-based sentence extraction,” Soft Computing, vol. 7, pp. 226–231, 2008. View at: Google Scholar
  133. M. Mendoza, C. Cobos, and E. León, “‘‘Extractive single-document summarization based on global-best harmony search and a greedy local optimizer,” Journal of Intelligent Systems, vol. 25, pp. 52–66, 2015. View at: Publisher Site | Google Scholar
  134. R. Forsati, A. Haghighat, and M. Mahdavi, “‘‘Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing,” Computer Communications, vol. 31, no. 10, pp. 2505–2519, 2008. View at: Publisher Site | Google Scholar
  135. H. Karahan, G. Gurarslan, and Z. W. Geem, “‘‘Parameter estimation of the nonlinear Muskingum flood-routing model using a hybrid harmony search algorithm,” Journal of Hydrologic Engineering, vol. 18, no. 3, pp. 352–360, 2012. View at: Google Scholar
  136. B. Zeng and Y. Dong, “‘‘An improved harmony search based energy-efficient routing algorithm for wireless sensor networks,” Soft Computing, vol. 41, pp. 135–147, 2016. View at: Publisher Site | Google Scholar
  137. D. Manjarres, J. Del Ser, S. Gil-Lopez, M. Vecchio, I. Landa-Torres, and R. Lopez-Valcarce, “A novel heuristic approach for distance and connectivity-based multi hop node localization in wireless sensor networks,” Soft Computing, vol. 17, pp. 17–28, 2013. View at: Publisher Site | Google Scholar
  138. D. Manjarres, J. Del Ser, S. Gil-Lopez et al., “The design of a novel two-objective harmony search approach for distance- and connectivity-based localization in wireless sensor networks,” Engineering Applications of Artificial Intelligence, vol. 26, no. 2, pp. 669–676, 2013. View at: Publisher Site | Google Scholar
  139. I. Landa-Torres, S. Gil-Lopez, J. DelSer, S. Salcedo-Sanz, D. Manjarres, and J. A. Portilla-Figueras, “Efficient citywide planning of open wifi access networks using novel grouping harmony search heuristics,” Engineering Applications of Artificial Intelligence, vol. 26, no. 3, pp. 1124–1130, 2013. View at: Publisher Site | Google Scholar
  140. J. Fourie, S. Mills, and R. Green, “‘‘Harmony filter: a robust visual tracking system using the improved harmony search algorithm,” Image and Vision Computing, vol. 28, no. 3, pp. 1702–1716, 2010. View at: Publisher Site | Google Scholar
  141. E. Yazdi, “Evolution of biped walking using neural oscillators controller and harmony search algorithm optimizer,” 2010, http://arxiv.org/abs/1006.4553. View at: Google Scholar
  142. Y. A. Z. A. Alkareem, I. Venkat, M. A. Al-Betar, and A. T. Khader, “Edge preserving image enhancement via harmony search algorithm,” Data Mining and Optimization, vol. 3, 2012. View at: Google Scholar
  143. S. Ghosh, P. Shivakumara, P. Roy, U. Pal, and T. Lu, “Graphology based handwritten character analysis for human behaviour identification,” CAAI Transactions on Intelligence, vol. 5, no. 1, pp. 55–65, 2020. View at: Publisher Site | Google Scholar
  144. D. Oliva, E. Cuevas, G. Pajares, D. Zaldivar, and M. Perez-Cisneros, “Multilevel thresholding segmentation based on harmony search optimization,” Journal of Applied Mathematics, vol. 2013, 2013. View at: Google Scholar
  145. A. R. A. Alsewari and K. Z. Zamli, “‘‘A harmony search based pairwise sampling strategy for combinatorial testing,” International Journal of Physical Sciences, vol. 7, no. 7, pp. 1062–1072, 2012. View at: Google Scholar
  146. A. R. A. Alsewari and K. Z. Zamli, “‘‘Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support,” Information and Software Technology, vol. 54, no. 6, pp. 553–568, 2012. View at: Publisher Site | Google Scholar
  147. A. A. Alsewari and K. Z. Zamli, “‘‘Interaction test data generation using harmony search algorithm,” International Journal of Physical Sciences, vol. 2011, pp. 559–564, 2011. View at: Google Scholar
  148. C. Mao, “‘‘Harmony search-based test data generation for branch coverage in software structural testing,” Neural Computing and Applications, vol. 25, no. 1, pp. 199–216, 2014. View at: Publisher Site | Google Scholar
  149. S. A. Abed, S. Tiun, and N. Omar, “‘‘Harmony search algorithm for word sense disambiguation,” ’PLoS One, vol. 10, no. 9, Article ID e0136614, 2015. View at: Publisher Site | Google Scholar
  150. J. Kang, S. Kwon, D. Ryu, and J. Baik, Harmony Search-Based Parameter Optimization for Just-In-Time Software Defect Prediction in the Maritime Software, MDPI, Basel, Switzerland, 2020.
  151. Z. W. Geem, “Application of Harmony Search to Multi-Objective Optimization for Satellite Heat Pipe Design,” in Proceedings of the US-Korea Conference, pp. 1–3, New Jersey, NJ, USA. View at: Google Scholar
  152. M. Fesanghary, E. Damangir, and I. Soleimani, “‘‘Design optimization of shell and tube heat exchangers using global sensitivity analysis and harmony search algorithm,” Applied Thermal Engineering, vol. 29, no. 5–6, pp. 1026–1031, 2009. View at: Publisher Site | Google Scholar
  153. B. Majidi, H. R. Baghaee, G. B. Gharehpetian, J. Milimonfared, and M. Mirsalim, “‘‘Harmonic optimization in multi-level inverters using harmony search algorithm,” Power Energy, vol. 2008, pp. 646–650, 2008. View at: Google Scholar
  154. Z. W. Geem and Y. Yoon, “‘‘Harmony search optimization of renewable energy charging with energy storage system,” Power Energy System, vol. 86, pp. 120–126, 2017. View at: Google Scholar
  155. O. Zarei, M. Fesanghary, B. Farshi, R. Jalili Saffar, and M. R. Razfar, “‘‘Optimization of multi-pass face-milling via harmony search algorithm,” Journal of Materials Processing Technology, vol. 209, no. 3, pp. 2386–2392, 2009. View at: Publisher Site | Google Scholar
  156. H. Dong, Y. Bo, M. Gao, and T. Zhu, “‘‘Improved harmony search for detection with photon density wave,” Photoelectron Detection Imaging, vol. 29, Article ID 662523, 2007. View at: Google Scholar
  157. R. Zhang and L. Hanzo, “‘‘Iterative multiuser detection and channel decoding for DS-CDMA using harmony search,” IEEE Signal Processing Letters, vol. 16, no. 10, pp. 917–920, 2009. View at: Google Scholar
  158. J. D. Ser, M. N. Bilbao, S. Gil-Lopez, M. Matinmikko, and S. Salcedo-Sanz, “Iterative power and subcarrier allocation in rate-constrained OFDMA downlink systems based on harmony search heuristics,” Engineering Applications of Artificial Intelligence, vol. 24, no. 5, pp. 748–756, 2011. View at: Google Scholar
  159. J. D. Ser, M. Matinmikko, S. Gil-Lopez, and M. Mustonen, “Centralized and distributed spectrum channel assignment in cognitive wireless networks: a harmony search approach,” Applied Soft Computing, vol. 12, no. 2, pp. 921–930, 2012. View at: Publisher Site | Google Scholar
  160. S. Gil-Lopez, J. Del Ser, S. Salcedo-Sanz, A. M. Perez-Bellido, J. M. Cabero, and J. A. Portilla-Figueras, “A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem,” Expert Systems with Applications, vol. 39, no. 12, pp. 11089–11093, 2012. View at: Publisher Site | Google Scholar
  161. F. Harrou and A. Zeblah, An Efficient Harmony Search Optimization for Maintenance Planning to the Telecommunication Systems, Intechopen, Rijeka, Croatia, 2011.
  162. A. M. Mohsen, A. T. Khader, and D. Ramachandram, “‘‘Hsrnafold:A harmony search algorithm for rna secondary structure prediction based on minimum free energy,” Journal of Materials Processing Technology, vol. 17, pp. 11–15, 2008. View at: Google Scholar
  163. A. M. Mohsen, A. T. Khader, and A. Ghallab, “‘‘The effect of using different thermodynamic models with harmony search algorithm in the accuracy of RNA secondary structure prediction,” Journal of Materials Processing Technology, vol. 43, pp. 505–510, 2009. View at: Google Scholar
  164. J. Amor, E. Alexandre, R. Gil, L. Álvarez, and E. Huerta, “‘‘Music-inspired harmony search algorithm applied to feature selection for sound classification in hearing AIDS,” PLoS Computer Biology, vol. 9, p. 124, 2008. View at: Google Scholar
  165. K. S. Hickmann, “‘‘Forecasting the 2013-2014 influenza season using Wikipedia,” PLoS Computer Biology, vol. 11, no. 5, Article ID e1004239, 2015. View at: Publisher Site | Google Scholar
  166. S. Tuo, J. Zhang, X. Yuan, Z. He, Y. Liu, and Z. Liu, “‘‘Niche harmony search algorithm for detecting complex disease associated high-order SNP combinations,” Science Report, vol. 7, no. 1, 2017. View at: Publisher Site | Google Scholar
  167. S. Taghipour, P. Zarrineh, M. Ganjtabesh, and A. Nowzari-Dalini, “‘‘Improving protein complex prediction by reconstructing a high-confidence protein-protein interaction network of Escherichia coli from different physical interaction data sources,” BMC Bioinformatics, vol. 18, no. 1, p. 10, 2017. View at: Publisher Site | Google Scholar
  168. J. Dongardive, A. Patil, A. Bir, S. Jamkhedkar, and S. Abraham, “‘‘Finding motifs using harmony search,” BMC Bioinformatics, vol. 143, p. 41, 2010. View at: Google Scholar
  169. A. Panchal, “‘‘Harmony search in therapeutic medical physics,” in Music-Inspired Harmony Search Algorithm, pp. 189–203, Springer, Berlin, Germany, 2009. View at: Google Scholar
  170. A. Panchal and B. Tom, “Harmony search optimization for HDR prostate brachytherapy,” International Journal of Radiation Oncology, Biology, Physics, vol. 75, no. 3, 2009. View at: Publisher Site | Google Scholar
  171. T. K. Gandhi, P. Chakraborty, G. G. Roy, and B. K. Panigrahi, “Discrete harmony search based expert model for epileptic seizure detection in electroencephalography,” Expert Systems with Applications, vol. 39, no. 4, pp. 4055–4062, 2012. View at: Publisher Site | Google Scholar
  172. P. Brucker, R. Qu, and E. Burke, “Personnel scheduling: models and complexity,” European Journal of Operational Research, vol. 210, no. 3, pp. 467–473, 2011. View at: Publisher Site | Google Scholar
  173. M. Hadwan, M. Ayob, N. R. Sabar, and R. Qu, “A harmony search algorithm for nurse rostering problems,” Info. Sciences, vol. 233, pp. 126–140, 2013. View at: Publisher Site | Google Scholar
  174. B. Gupta, M. Tiwari, and S. S. Lamba, “Visibility improvement and mass segmentation of mammogram images using quantile separated histogram equalisation with local contrast enhancement,” Chinese Association for Artificial Intelligence, vol. 4, no. 2, pp. 73–79, 2019. View at: Publisher Site | Google Scholar
  175. J. A. Pacheco and S. Casado, “Solving two location models with few facilities by using a hybrid heuristic: a real health resources case,” Computers & Operations Research, vol. 32, no. 12, pp. 3075–3091, 2005. View at: Publisher Site | Google Scholar
  176. T. Wiens, “Engine speed reduction for hydraulic machinery using predictive algorithms,” International Journal of Hydromech, vol. 2, no. 1, pp. 16–31, 2019. View at: Publisher Site | Google Scholar
  177. R. Wang, H. Yu, G. Wang, G. Zhang, and W. Wang, “Study on the dynamic and static characteristics of gas static thrust bearing with micro-hole restrictors,” International Journal of Hydromech, vol. 2, no. 3, pp. 189–202, 2019. View at: Publisher Site | Google Scholar
  178. Z. W. Geem, “‘‘Parameter estimation of the nonlinear Muskingum model using parameter-setting-free harmony search,” Journal of Hydrologic Engineering, vol. 16, no. 3, pp. 684–688, 2010. View at: Google Scholar
  179. J. H. Kim, Z. W. Geem, and E. S. Kim, “‘‘Parameter estimation of the nonlinear Muskingum model using harmony search,” JAWRA Journal of the American Water Resources Association, vol. 37, no. 3, pp. 1131–1138, 2001. View at: Publisher Site | Google Scholar
  180. S. Mun and Z. W. Geem, “‘‘Determination of individual sound power levels of noise sources using a harmony search algorithm,” International Journal of Industrial Ergonomics, vol. 39, no. 3, pp. 366–370, 2009. View at: Publisher Site | Google Scholar
  181. N. Yusup, A. M. Zain, and A. A. Latib, “A review of Harmony Search algorithm-based feature selection method for classification,” International Journal of Industrial Ergonomics, vol. 192, Article ID 012028, 2019. View at: Google Scholar
  182. I. Rahimi, B. Bakhtiari, K. Qaderi, and M. Aghababaie, “Calibration of Angstrom equation for estimating solar radiation using meta-heuristic harmony search algorithm (case study: mashhad-east of Iran),” Energy Procedia, vol. 18, pp. 644–651, 2012. View at: Publisher Site | Google Scholar
  183. A. Sharma, R. Kumar, and P. K. Singh, “SLA constraint quickest path problem for data transmission services in capacitated networks,” International Journal of Performability Engineering, vol. 15, no. 4, pp. 1061–1072, 2019. View at: Google Scholar
  184. H. S. Basavegowda and G. Dagnew, “Deep learning approach for microarray cancer data classification,” International Journal of Performability Engineering, vol. 5, no. 1, pp. 22–33, 2020. View at: Publisher Site | Google Scholar
  185. S. Osterland and J. Weber, “Analytical analysis of single-stage pressure relief valves,” International Journal of Hydromech, vol. 2, no. 1, pp. 32–53, 2019. View at: Publisher Site | Google Scholar
  186. E. Cuevas, N. Ortega-Sánchez, D. Zaldivar, and M. Pérez-Cisneros, “‘‘Circle detection by harmony search optimization,” Journal of Intelligent and Robotic Systems, vol. 66, no. 3, pp. 359–376, 2012. View at: Publisher Site | Google Scholar

Copyright © 2021 Mahima Dubey et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Related articles

No related content is available yet for this article.
 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views1888
Downloads646
Citations

Related articles

No related content is available yet for this article.

Article of the Year Award: Outstanding research contributions of 2021, as selected by our Chief Editors. Read the winning articles.