Hindawi

Mathematical Problems in Engineering

Volume 2021, Article ID 5594267, 22 pages
https://doi.org/10.1155/2021/5594267

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

Mahima Dubey,1 Vijay Kumar ,1 Manjit Kaur ,2 and Thanh-Phong Dao 3,4

1
Computer Science and Engineering, National Institute of Technology, Hamirpur 177001, H.P, India
2
Computer Science Engineering, School of Engineering and Applied Sciences, Bennett University, Greater Noida 201310, India
3
Division of Computational Mechatronics, Institute for Computational Science, Ton Duc +ang University,
Ho Chi Minh City, Vietnam
4
Faculty of Electrical & Electronics Engineering, Ton Duc +ang University, Ho Chi Minh City, Vietnam

Correspondence should be addressed to anh-Phong Dao; [email protected]

Received 17 January 2021; Revised 21 March 2021; Accepted 2 April 2021; Published 16 April 2021

Academic Editor: Hassène Gritli

Copyright © 2021 Mahima Dubey et al. is 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.

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. e natural inspiration and
conceptual framework of HSA are discussed. e control parameters of HSA are described with their mathematical foundation.
e improvement and hybridization in HSA with other metaheuristics are discussed in detail. e applicability of HSA in different
problem domains is studied. e future research directions of HSA are also investigated.

1. Introduction solving the real-life problems. Along with the evolution of new
techniques, the complexities of the optimization problems in
Optimization is the process for selecting the best possible engineer designs affronted were increased. ese methods are
value of decision variables from the available set of values unable to solve these problems [3]. Due to the complexities of
under some specific constraints [1]. is process is used to problems, it becomes difficult to solve it by using the classical
minimize or maximize the fitness function of the optimization techniques in the reasonable time duration. To alleviate this
problems. e fitness function is influenced by a set of issue, metaheuristic techniques are developed in the recent
variables, called decision variables and a set of restrictions, years. ese techniques are able to solve the complex problems
which acts as a barrier to certain values of the decision in a reasonable time period. Metaheuristic techniques are
variables. Based on the nature of search space, the optimi- inspired from the ideas derived from biological science,
zation problems are broadly categorized into two main classes physics, behavior of animals, insects, etc. [4]. A number of
such as continuous and discrete [2]. Beside this, the cate- metaheuristic algorithms are developed in the literature. Some
gorization of problems based on nature of fitness function is of the well-known techniques are genetic algorithm (GA), ant
linear, convex, quadratic, concave, and sparse. e nature of colony optimization (ACO), particle swarm optimization
problem has to be analyzed before applying the optimization (PSO), grey wolf optimization (GWO), harmony search al-
techniques [3]. A large number of optimization techniques are gorithm (HSA), and many more (see Figure 1).
available in the literature to solve the real-life problems. Harmony search algorithm (HSA) is a well-known
e classical techniques such as quasi-Newton method, metaheuristic algorithm, which is developed by Geem et al.
dynamic programming, and linear programming are used for [5] in 2001. HSA is inspired from the improvisation process
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
2 Mathematical Problems in Engineering

Galaxy-based
Wind driven
search
optimization
algorithm Charged
Flower (WDO)
(GbSA) system
pollination
search
algorithm Gravitational
Black hole (CSS)
(FPA) search
algorithm
algorithm
(BH)
(GSA)
Whale
Genetic
optimization
algorithm
Particle algorithm Physics (GA)
swarm (WOA) based Evolutionary
optimization strategy (ES)
(PSO) Artificial Differential
Swarm
bee colony Evolution evolution
inspired
(ABC) based (DE) Shuffled
Cat swarm Metaheuristic
complex
optimization
Spotted Biogeography evolution
(CSO)
hyena based (SCE)
optimizer optimization
Nature Unique
(SHO) (BBO)
inspired solution

Firefly Guided
Simulated
algorithm Cuckoo local
annealing
(FA) search (CS) search
(SA)
(GLS)

Bat Bacterial Variable Iterated

algorithm foraging neighborhood local
(BA) optimization search search
(BFO) (VNS) (ILS)

Figure 1: Classification of metaheuristic techniques.

of musicians. A musician searches for the perfect notes to is paper discusses the harmony search algorithm in
develop a perfect harmony. Based on this concept, HSA was four-fold. ese are as follows:
developed to search a good solution for an optimization
(1) eoretical aspects of HSA that comprise the im-
problem. e developers of HSA performed extensive ex-
provements, hybridization with other meta-
perimentation to validate its performance. e main char-
heuristics, and multiobjectivity.
acteristics of HSA are as follows: (1) the initial setting of
decision variables is not required, (2) derivate information is (2) Control parameters of HSA, which includes im-
not required, and (3) few control parameters are needed for provements in harmony memory consideration rate,
fine tuning [6]. Due to these characteristics, HSA is preferred pitch adjustment rate, and distance bandwidth.
over the other existing metaheuristic techniques. HSA is (3) Applications of HSA that comprise image process-
used to solve the wide variety of problems such as clustering ing, clustering, civil engineering, electrical engi-
problems, social-economic problems, power engineering neering, bioinformatics, software engineering,
problems, computer vision problems, scheduling problems, scheduling, and mechanical engineering.
and global optimization problems. e HSA is considered as (4) Challenges of HSA that include the future research
an efficient algorithm with a simple implementation. Some direction, either the modification in HSA or appli-
researchers also investigated the applicability of HSA on cability in other research domains.
different domains.
e main aim of this paper is to provide a comprehensive e organization of this paper is structured as follows.
analysis of every aspect of HSA and motivate the researchers Section 2 presents the basic concepts of classical harmony
to use it in their problem domain. is paper also highlights search algorithm. e research methodology is presented in
the improvement and hybridization of HSA with other Section 3. e control parameters of harmony search al-
metaheuristics to alleviate the weakness of algorithm. e gorithm are elaborated in Section 4. Section 5 presents the
modification in control parameters of HSA is also investi- variants of harmony search algorithm. Section 6 discusses
gated. e applicability of HSA in different research domain various applications in different research domains. e
is discussed in detail. Figure 2 shows the number of research future research directions are mentioned in Section 7, fol-
articles published on HSA. lowed by the concluding remarks in Section 8.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 3

Research papers published on HSA in year 2016-2021 (till date)

12500

10000
Publication count
7500

5000

2500

0
2016 2017 2018 2019 2020 2021 (till date)
Years
Figure 2: Number of research articles published on HSA from 2016 to 2021.

2. Harmony Search Algorithm 2.2. Mathematical Modelling. In HSA, the working of op-
erators is similar to the activities performed by a musician
is section presents the inspiration, working, and flowchart while creating a perfect harmony. A musician tries to change
of HSA. It also describes the main components of HSA. the different tones until the perfect harmony is found.
ereafter, the collection is stored in the memory. In an
2.1. Inspiration. HSA is a metaheuristic technique that optimization problem, the operators undergo different
mimics from the improvisation process of musicians. It variations; if the results of the variation are favorable, then
comes under the category of community-inspired meta- the memory is updated by adding this to the memory and
heuristic algorithms. It provides a perfect stability between removing the undesirable one. During the production of
the exploration and exploitation phases of search process. music, one of these three events occurs [5]:
HSA is inspired by the natural event where a musician (i) One of the stored tones from a collection of different
searches for the perfect notes to develop a perfect harmony ones from the memory (Harmony Memory) is
(see Figure 3). e method used to search perfect solutions selected
for the given problem is similar to the method used by a (ii) Any adjacent tone, which is nearer to one of the
musician who tries to find harmony delightful to the ears. stored ones, is selected (pitch adjustment)
e method used for deriving the value of fitness function is
similar to the method of deriving a standard with the help of (iii) Any arbitrary tone is selected, which falls under the
pitch of every musical instrument [3]. standard scope (random selection)
ere are three situations occurring, in which the pitch e main components of HSA are harmony memory size
can be improved by a musician. (HMS), harmony memory consideration rate (HMCR), pitch
(1) A stored pitch from the memory of the musician is adjustment rate (PAR), and stopping criteria (i.e., number of
played improvisation (NI)). ese parameters are responsible for
exploration and exploitation. Figure 4 shows the flowchart of
(2) A neighboring pitch from the stored pitches is played HSA. e main steps of HSA are described as follows [5].
(3) Any arbitrary pitch is played, which is falling within
the standard scope
2.2.1. Initialization of Optimization Problem and Control
Equivalently, the selection of a value of every decision Parameters. e optimization problem is defined as follows:
variable in the algorithm is done by the following three acts: minimize
fn(a), (1)
(1) One value from the stored values of the memory is maximize
selected
where fn(a) represents the fitness function of a; a is a set of
(2) Some neighboring values of the stored values are each decision variable (ax ). e value of each decision
selected variable should lie in the range,
(3) Any arbitrary value that lies in the standard scope is axl ≤ ax ≤ axh , x � 1, 2, ..., n. e values of HMS, HMCR,
selected PAR, and NI are also initialized.
e abovementioned acts are governed through the two
main components of HSA. ese are harmony memory 2.2.2. Initialization of Harmony Memory. Harmony mem-
considering rate (HMCR) and pitch adjusting rate (PAR) ory (HM) is initialized arbitrarily in the range of
[5]. axl ≤ ax ≤ axh , x � 1, 2, ..., n. It is done by the following step:
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
4 Mathematical Problems in Engineering

Figure 3: Harmony in music.

Start

Initialize problems and factors

Initialize harmony memory arbitrarily

Evaluate fitness function value for HM harmonies

s=1

x=1

Rand ≤ No
Arbitrary selection
HMCR?
s=s+1 Yes
x=x+1
Memory consideration a′x = axl + Rand × (axh – axl)

a′x = axi (for i = 1, 2, ..., HMS) No

x = n?

x=x+1
Rand ≤ Yes Pitch adjustment Yes
PAR?
No
No a′x = a′x ± ar × lb
x = n?
Yes
Revise harmony memory

Add a′x and remove Yes f (a′x) ≤

wh from HM f(wh)?
No
s= Yes Return best harmony End
smax?
No
Figure 4: Flowchart of HSA.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 5

axi � axl + Rand × axh − axl 􏼁, i � 1, 2, ..., HMS, (2) 4. Control Parameters of HSA
where Rand is a random function that takes any arbitrary e well-known control parameters of HSA are pitch ad-
value from [0,1]. justment rate (PAR), harmony memory consideration rate
(HMCR), distance bandwidth (BW), harmony memory
(HM), and termination criteria (see Figure 5). e re-
2.2.3. Creating a New Harmony Vector. For creating a new searchers have tried to modify the structure of original HSA
harmony, harmony vector a′ � (a1′, a2′, ..., an′) is used. It is by using the abovementioned control parameters. PAR,
decided by three control parameters, namely, pitch ad- HMCR, and BW are responsible for convergence of HSA.
justment, arbitrary selection, and memory consideration.
Another control parameter distance bandwidth (BW) is
used to modify the harmony vector, which plays a crucial 4.1. Modification in PAR and BW. Mahdavi et al. [8] de-
role in pitch adjustment step (Algorithm 1). e fol- veloped an improved version of HSA (IHSA) to alleviate the
lowing actions are performed to create a new memory [3, shortcoming of HSA. e values of PAR and BW were
5]. dynamically updated according to the generation. e
mathematical formulation of these control parameters is
given as follows [8]:
2.2.4. Revising Harmony Memory. e fitness value of the PARmax − PARmin 􏼁
newly generated harmony vector ax′ is compared with the PAR(gn) � PARmin + × gn, (3)
NI
fitness value of worst harmony vector stored in the memory.
If the earlier one is fitter than the latter one, then the worst where PAR(gn)denotes the pitch adjustment rate in gen-
harmony value in the memory is replaced with the newly eration gn; PARmin and PARmax are the minimum and
generated harmony vector. Otherwise, newly generated maximum adjustment rates, respectively.
harmony vector is ignored.
In BWmin /BWmax 􏼁
BW(gn) � BWmax · exp􏼠 · gn􏼡, (4)
NI
2.2.5. Evaluating Termination Condition. e evolution
where BW(gn)represents the distance bandwidth in gen-
process of HSA is stopped if the termination condition is
eration gn; BWmin and BWmax are the minimum and max-
achieved. e termination condition can be determined by
imum bandwidths, respectively. e challenging task of
the total number of improvisations reached so far. Other-
IHSA is to determine the appropriate values of lower and
wise, go to Step 3. Step 3 is considered as a crucial step for the
upper limits of BW. Pan et al. [9] developed a self-adaptive
improvisation process.
GHSA (SGHSA). A new improvisation scheme was devel-
oped to capture the best solution for generating new har-
3. Research Methodology monies. e distance bandwidth is dynamically decreased
with increase in number of generation. e mathematical
In this paper, the systematic review of harmony search al- formulation of BW is given as follows [9]:
gorithm (HSA) was conducted according to the guidelines of BWmax − BWmin NI
⎪
⎧
⎪ BWmax − × 2gn, if gn < ,
PRISMA [7]. For the selection of appropriate research ar- ⎪
⎪
⎪
⎨ NI 2
ticles relevant to HSA, a search has been conducted on BW(gn) � ⎪
Google Scholar, Scopus, and PubMed. Search was conducted ⎪
⎪
⎪
⎪ NI
by using the keywords “Harmony Search Algorithm” or ⎩ BWmin , if gn ≥ .
2
“HSA” or “improved harmony search algorithm” or “variant
of HSA” or “Adaptive harmony search” or “Application of (5)
HSA” or “Application of harmony search” or “Modification e modification in HSA was developed by Das et al. [10]
in HSA” or “parameter free harmony search.” e selection and known as an explorative HSA (EHSA). ey used the
and rejection criteria for research articles that are relevant to population variance for modification. e distance band-
HSA are presented in Table 1. width was dynamically changed to proportional to standard
Total 63,500 research articles were explored on Google deviation of the current population. BW is given as follows:
Scholar, Scopus, and PubMed including manual search- 􏽱������
ing. Initially, all the duplicate research articles and articles BW(gn) � σ zi 􏼁 � var zi 􏼁, (6)
published before 2008 were discarded. After this, 2400
research articles were selected for the next phase. 300 where σ(zi )represents the standard deviation of the current
research articles were selected after the reading of titles population, zi .
and abstract. 100 research articles were selected after Kong et al. [11] developed an adaptive HSA (AHSA) that
reading conclusion and facts found in articles. 20 research utilized the dynamically adjusting PAR and BW. PAR was
articles are selected for review after the fourth round of dynamically changed according to the fitness value. e
screening. mathematical formulation of PAR is defined as [11]
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
6 Mathematical Problems in Engineering

For each x ∈ [1, n]

If Rand ≤ HMCR, then/ ∗ harmony memory consideration ∗ /
ax′ � axi , i ∈ [1, HMS]
If Rand ≤ PAR, then/ ∗ pitch adjustment ∗ /
ax′ � ax′ + Rand × BW
End if
Else
ax′ � axl + Rand × (axh − axl ) / ∗ arbitrary selection ∗ /
End if
End For

ALGORITHM 1

Table 1: Selection and removal criteria for shortlisting research articles.

Sr.
Parameters Selection criteria Removal criteria
no.
Time
1 Research articles published from 2008 to 2021 Research articles published before 2008
duration
Research articles on bioinformatics, software engineering,
Research articles on economics, environment,
2 Application scheduling, mechanical engineering, industrial engineering, and
and social-economics
networking
Research articles focus on the variants of HSA and control Research articles focus on the variant of other
3 Comparison
parameter metaheuristics
Research involves case study, patent, and
Research articles include experimental results and solid
4 Study articles in different languages other than
mathematical foundation
English
Research articles include the different operators
5 Analysis Research articles include the various control parameters of HSA
of other metaheuristics

Harmony memory
0 ≤ HMCR ≤ 1
consideration rule

Pitch adjustment rule 0 ≤ PAR ≤ 0.5

Control
parameter
HM = HMS
Harmony memory (total number of
vector values)

Max. number of
Termination condition
iterations (s)

Figure 5: Control parameters of HSA.

⎪
⎧
⎪ Df(gn)
⎪
⎪ 1, if ≥ 1, or Df(gn − 1) � 0,
⎪
⎪ Df(gn − 1)
⎨
PAR(gn) � ⎪ (7)
⎪
⎪
⎪
⎪ Df(gn)
⎪
⎩ , otherwise,
Df(gn − 1)

tri � HM(int(Rand × HMS + 1)),

where Df(gn − 1) and Df(gn) denote the difference be-
tween minimum and maximum values of fitness function in tri � tri + 􏼂max HMi 􏼁 − tri 􏼃 × Rand, (8)
the previous and current generations, respectively. tri � tri − 􏼂tri − min HMi 􏼁􏼃 × Rand,
Wang and Huang [12] developed a new variant of HSA
by modifying the PAR and BW. ey replaced the BW with where tri denotes the ith variable selected from HM. Rand is
maximum and minimum values present in HM. e fol- the random number selected from the range of 0 and 1.
lowing equations are used in the place of BW: max(HMi )and min(HMi )denote the minimum and
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 7

maximum values of ith variable present in HM. e same Kalivarapu et al. [16] proposed a self-adaptive IHSA
modification in PAR was done as mentioned in [8], but in (SIHSA) based on dynamic change in BW. e modification
the opposite direction. in BW was computed as [16]
Luo [13] developed a novel self-adaptive mechanism for c
HSA. PAR was not considered during the improvisation BW(gn) � . (15)
1 + k(gn/NI)m
process. e following equation was designed for con-
structing HMCR parameter: Here,
1 BWmax
HMCR � 1 − , (9) k � 50 × In􏼢 􏼣, (16)
n+1 100 × BWmin
where n represents the dimension of problem. BW was
where mand c are constants whose values depend upon the
dynamic updated for each variable (say, zi ) and defined as
maximum and minimum values of BW. m should be greater
[13]
than 1.
⎪
⎧ UBi − LBi 􏼁 gn
⎪
⎪ × 􏼒1 − 􏼓, if Fitstd > 0.0001,
⎨ 100 NI
BWi (gn) � ⎪ 4.2. Modification in PAR and HMCR. Kumar et al. [17]
⎪
⎪
⎩ utilized both local and global search capabilities by modi-
0.0001, otherwise,
fying the value of HMCR and PAR parameters and devel-
(10) oped an algorithm which is called as parameter adaptive
where Fitstd represents the standard deviation of fitness HSA (PAHSA). ey explored the possibility of nonlinear
function values in the current harmony memory. change in these parameters. e linear change in these
Chen et al. [14] designed a novel variant of HSA, known parameters was also explored in [18]. Both PAR and HMCR
as NDHSA, which dynamically updates the control pa- were modified linearly and computed as follows:
rameters, PAR and BW. e following equations were used PARmax − PARmin 􏼁
to update both PAR and BW for improving the harmony PAR(gn) � PARmin + ×(NI − gn),
NI
vectors. (17)
PAR(gn) � PARmin + PARmax − PARmin 􏼁 × e− (k×gn/NI) .
HMCR(gn) � HMCRmin
(11)
HMCRmax − HMCRmin 􏼁 (18)
Here, k is the constant parameter and value is set to 5 + × gn.
NI
when the number of iterations is 50,000.
e nonlinear modifications have been done in both
⎪
⎧ UBi − LBi
⎪
⎪ if z � 0, PAR and HMCR and computed as follows.
⎪
⎪ 1000
⎪
⎪
⎪
⎪ In PARmin /PARmax 􏼁
⎨ PAR(gn) � PARmax · exp􏼠 · gn􏼡,
BW(z) � ⎪ z, if 0 < z < 1, (12) NI
⎪
⎪
⎪
⎪ (19)
⎪
⎪
⎪
⎩ max􏼒UBi − LBi , 1􏼓,
⎪
if z > 1.
50 HMCR(gn) � HMCRmin
Kattan and Abdullah [15] developed a dynamic self- In HMCRmin /HMCRmax 􏼁
· exp􏼠 · gn􏼡.
adaptive HSA (DSAHSA) to improve the search process. NI
e control parameters, namely, PAR and BW were dy-
(20)
namically updated. e value of PAR either increases or
decreases according to the best-to-worst ratio. e Khalili et al. [19] developed a global dynamic HSA
modifications in these parameters are computed as named as GDHSA. Both HMCR and PAR were modified
follows: dynamically during the search process and computed as
Fit zbest 􏼁 follows:
PAR(gn) � PARmax + PARmin − PARmax 􏼁 × , 􏽲������������������
Fit zworst 􏼁 gn − 1 gn − 1
PAR(gn) � 0.85 + 0.3 × × 􏼒1 − 􏼓, (21)
(13) NI − 1 NI − 1
􏽲�������������������
where Fit(zbest ) and Fit(zworst )denote the best and worst gn − 1 gn − 1
quality solutions in the HM. e dynamic BW was com- HMCR(gn) � 0.9 + 0.2 × × 􏼒1 − 􏼓. (22)
NI − 1 NI − 1
puted using the standard deviation of respective dimension
of HM. It is computed as follows: During the first half of search process, the values of
HMCR and PAR increase and decrease in second half of
BW(i) � Rand􏼐− 􏼐c.Std􏼐zHM
i
HM
􏼑􏼑, 􏼐c.Std􏼐zi 􏼑􏼑􏼑. (14) evolution process.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
8 Mathematical Problems in Engineering

Guo et al. [20] developed an adaptive HSA based on the Table 2: Modification done in the control parameters of HSA.
concept of best-based strategy (ABHSA). e control pa- Ref. Algorithm PAR HMCR BW
rameters such as HMCR and PAR were modified according
[8] IHSA ✓ 7 ✓
to the feedback obtained from the evolution process. e [9] SGHSA 7 7 ✓
initial values of HMCR and PAR were randomly generated [10] EHSA 7 7 ✓
in the range of (0.9, 1.0) and (0.1, 1.0), respectively. Both [11] AHSA ✓ 7 ✓
HMCR and PAR were reinitialized with low probability of [12] SAHSA ✓ 7 ✓
0.1 during search process. [13] NSHSA ✓ ✓ ✓
Wang et al. [21] developed a new variant of HSA based [17] PAHSA ✓ ✓ 7
on dual strategies and adaptive parameters (DSAHS). Both [18] MHSA ✓ ✓ 7
HMCR and PAR were initialized to 0.95 and 0.5, respec- [14] NDHSA ✓ 7 ✓
tively. e values of these parameters were modified [20] ABHSA ✓ ✓ 7
according to the fitness of harmony vector. Table 2 depicts [15] DSAHSA ✓ 7 ✓
[19] GDHSA ✓ ✓ 7
the modification done in the control parameters of HSA.
[16] SIHSA 7 7 ✓
[21] DSAHS ✓ ✓ 7
5. Variants of HSA
In last few years, the various variants of HSA have been being stuck in local optima are avoided. El-Santawy et al.
developed to solve the diverse real-life optimization prob- [34] combined the chaos theory with HSA for solving nu-
lems. e modification in HSA has been done in two-folds. merical integration problem. e convergence of the pro-
First, the basic structure of HSA has been modified by in- posed approach was improved. Abdel-Raouf et al. [35]
corporating the different operators such as chaotic, binary, proposed an improved version of chaotic HSA (IHSCH) for
and crowding distance. Second, HSA has been hybridized linear assignment problems. e chaos was incorporated in
with other metaheuristic algorithms [22, 23]. harmony memory to alleviate the local optima. e com-
putation time of IHSCH is smaller than the traditional al-
5.1. Improved HSA. Enayatifar et al. [24] presented a novel gorithms. e chaotic HSA is hybridized with flower
harmony search algorithm using learning automata pollination to solve Sudoku problem [36]. e design of
(LAHSA). e learning-based mechanism was used to en- adaptive infinite impulse response (IIR) filter system was
hance the search capability of algorithm. LAHSA provided optimized by Shafaati and Mojallali [37]. ey incorporated
better performance than the other variants of HSA over chaos in HSA to solve the identification problem of IIR
benchmark test functions. Kumar et al. [25] developed a system. Askarzadeh [38] hybridized the concepts of simu-
variance-based harmony search algorithm (HSA) for solving lated annealing and chaotic search with HSA (DCHSSA) for
optimization problems. e variance of the current pop- optimal design of wind system. Yi et al. [39] presented a
ulation and current harmony vector was used to improvise parallel chaotic modified HSA, known as MHS-PCLS, for
the HM. e proposed approach eliminated the constant constrained engineering design problems. e robustness of
parameter setting problem. Geem and Sim [26] proposed a search was enhanced through MHS-PCLS. e performance
parameter-setting-free HSA (PSFHSA) to alleviate the pa- of MHS-PCLS was better than the existing harmony search
rameter setting problem of HSA. ey designed a novel algorithms. Table 4 shows the performance comparison of
matrix for memorizing the parameters for each variable. different chaotic harmony search algorithms.
ere is no need to set the control parameters for the given
problem. However, the performance of PSFHSA is not as
5.3. Binary HSA. To overcome the shortcomings of HSA, an
good as the original HSA. To improve the performance of
adaptive version of BHSA (ABHSA) was proposed by Wang
PSFHSA, Jeong et al. [27] developed an advanced version of
et al. [40]. e control parameters were improved through
PSFHSA (APSFHSA). ey reduced the additional memory
BHSA. e performance of ABHSA was tested on both low-
requirement during the search process.
and high-dimensional knapsack problems. Ravindra et al.
Jing et al. [28] developed a variant of HSA that modify
[41] developed a BHSA for optimal deployment of phasor
the control parameter within the specified range during the
measurement units. Lin and Li [42] designed a hybrid BHSA
search process and called advanced PSFHSA (APSFHSA). To
to solve winner determination problem. Both HMCR and
improve the performance of PSFHSA, Shaqfa and Orban
PAR were modified to provide the balance between inten-
[29] modified the pitch adjustment step of PSFHSA and
sification and diversification. Kong et al. [43] proposed a
applied on the optimization of concrete beam design. A
simplified binary HSA (SBHSA) to solve 0–1 knapsack
number of modifications have been proposed in HSA to
problems. e main difference between SBHSA and HSA is
improve its performance [30–32]. Table 3 shows the im-
in terms of improvisation process. e control parameters of
provement in the variants of HAS.
HSA were used to generate new solutions. SBHSA enhances
the convergence and population diversity. SBHSA was
5.2. Chaotic HSA. Alatas [33] utilized chaotic maps in HSA evaluated on both low- and high-dimensional knapsack
for parameter adaptation. Due to chaotic maps, the con- problems. e performance comparison of different binary
vergence of HSA was improved and the solutions which are harmony search algorithms is depicted in Table 5.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 9

Table 3: Improvement in the variants of HSA.

Ref. Algorithm Description Application Performance
Learning automata is employed to improve the
[24] LAHSA Optimization problems Less computational time
performance
Variance of harmony memory is used to improve the
[25] VHSA Clustering Good performance
harmony vectors
Each variable is associated with matrix of memorizing Water distribution network Eliminate the parameter tuning
[26] PSFHSA
operation types design problem
Additional memory is not used during the Better performance than
[27] APSFHSA Optimization problems
improvisation process PSFHSA
Self-adaption mechanism is employed to tune the Groundwater pollution Better exploration and
[28] APFHSA
parameters problem exploitation
Better performance than
[29] MPSFHSA Pitch adjustment step is modified Concrete beam design
PSFHSA

Table 4: Improvement in HSA with chaotic algorithms.

Ref. Algorithm Description Application Performance
[33] CHSA Chaotic maps are used for parameter adaption Optimization problems Improvement in convergence
[34] CHSA Chaotic is used to manipulate parameter value Numerical integration Improve accuracy, convergence
Chaotic is employed to improve the harmony
[35] IHSCH Assignment problems Improvement in computational time
memory
[36] FPCHSA Hybridized chaotic harmony with flower pollination Sudoku puzzles Improve performance of CHSA
Chaotic and social components of PSO are used to Less computational complexity, more
[37] CIHSA IIR filter optimization
enhance exploration robustness
[38] DCHSSA Hybridized the chaotic and simulated annealing Wind system Good performance
MHS- Parallel chaotic search is proposed to improve the Engineering design
[39] More robustness
PCLS performance of HSA problems

Table 5: Improvement in HSA with binary algorithms.

Ref. Algorithm Description Application Performance
Binary encoding and adaptive mechanism are Improvement in convergence and
[40] ABHSA Knapsack problems
incorporated in HSA accuracy
Deployment of phasor
[41] BHSA BHSA has been proposed for state estimation Solution quality
measurement units
Tabu search is employed to improve the local
[42] HBHSA Winner determination problem Improve the performance
search ability
[43] SBHSA e control parameters are dynamically updated Knapsack problems Improve the solution quality

5.4. Multiobjective HSA. ere are two approaches to solve multiobjective problems. e self-adaptive mechanism was
the multiobjective problems. ese are weighted sum ap- incorporated in MOHSA to enhance the performance [47].
proach and Pareto-optimal front approaches. e former Prajapati and Chhabra [48] developed a many-objective
one tries to solve the multiobjective problem by assigning discrete HSA (MaDHSA) to resolve the software remod-
weight factors to convert the multiple objectives into single ularization problem. e quality indicator and external
objective. e second approach aims to optimize all ob- archive are used to rank the nondominated solutions. e
jectives simultaneously. In this approach, nondominated five objectives related to remodularization were utilized to
solutions are used. HSA used to optimize the project improve the accuracy of modularization solution. Wang
planning by minimizing the tradeoff between time and cost et al. [49] developed a multiobjective binary harmony search
[44]. e ranking method was used for Pareto-optimum algorithm (MBHSA). e nondominated sorting-based
solutions. Xu et al. [45] implemented a multiobjective HSA crowding distance was used to update the harmony memory.
(MOHSA) for development of a mobile robot. e stability, e search ability of MBHSA was improved through
torque resistance of rear wheels, and mass of robot have to be modified PAR operator. e performance of MBHSA out-
optimized through MOHSA. performs the existing variants in terms of convergence and
Ricart et al. [46] incorporated the concepts of ranking diversity. Sabrinath et al. [50] extended PAHSA to solve
assignment and Pareto-optimality in HSA to solve the multiobjective optimization problems. e weighted sum
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
10 Mathematical Problems in Engineering

approach was used to assign the weightages to performance was used to tune the harmony vectors present in HM. In the
indices. Table 6 shows the performance comparison of second approach, harmony memory updating strategy was
different multiobjective harmony search algorithms. proposed. e proposed approaches were able to maintain
the diversity in HM. However, the optimal parameter se-
lection has to be analyzed.
5.5. Hybrid HSA. e performance of HSA can be further
Yildiz and Ozturk [59] combined both HSA and Taguchi
improved by incorporating the components of other met-
method to improve the performance of HSA. Jang et al. [60]
aheuristic algorithms. Taherinejad [51] utilized the concept
combined Nelder-Mead Simplex algorithm (NM-SA) with
of simulated annealing (SA) in the dynamic version of PAR.
HSA to enhance the quality of harmony vectors present in
e mathematical formulation of modified PAR is given as
HM. Naik et al. [40] proposed a variant of GHSA that
follows [51]:
utilized the concepts of gradient descent learning (GDL) and
PARmax − PARmin 􏼁 functional link artificial neural network (FLANN). e
PAR(gn) � PARmax − × gn. (23)
NI search capability of GDL was used to optimize the weight of
FLANN. HSA was also hybridized with fuzzy logic [61],
e modification in PAR changed the direction in re- cuckoo search algorithm (CS) [62], ant colony optimization
verse order, which is suggested by Mahdavi et al. [8], and (ACO) [63,64], firefly algorithm (FA) [65], bat algorithm
improves the performance of HSA. Omran and Mahdavi (BA) [66], teaching learning-based optimization (TLBO)
[52] incorporated the concept of particle swarm optimiza- [67], biogeography-based optimization (BBO) [68], memetic
tion (PSO) in HSA for enhancing the performance. e BW algorithm (MA) [69], and mine blast algorithm (MBA) [70].
was replaced with global-best particle. Santos Coelho and e performance comparison of different hybrid harmony
Andrade Bernert [53] dynamically modified the PAR by search algorithms is shown in Table 7.
using the concepts borrowed from dispersed PSO (DPSO).
e modified PAR is given as follows:
6. Applications
PAR(gn) � PARmin + PARmax − PARmin 􏼁
Due to the easy implementation and proficiency of HSA, it is
Fitmax (gn) − mean(Fit)􏼁 (24)
used in a large number of applications. e applications of
× ,
Fitmax (gn) − Fitmin (gn)􏼁 HSA are categorized into following classes such as image
processing, clustering, civil engineering, electrical engi-
where Fitmin (gn) and Fitmax (gn)denote the minimum and neering, bioinformatics, software engineering, scheduling,
maximum fitness values in generation gn, respectively. mechanical engineering, industrial engineering, networking,
mean(Fit) represents the mean of fitness value of all har- and other engineering applications. Table 8 depicts the
mony vectors present in HM. summarization of various applications of HSA. e appli-
e clonal selection algorithm (CSA) is hybridized with cability of HSA in different research domains is shown in
HSA to improve the convergence speed [54]. CSA was used Figure 6.
to improve the harmony vectors present in HM. is ap-
proach alleviated the premature problem. However, the
computational speed of this approach is much higher than 6.1. Scheduling. e two major problems such as course
the original HSA. e parallel metaheuristic-based frame- timetabling and hob shop scheduling are targeted. e
work was proposed by Lee and Zomaya [55]. ey used HSA timetabling problem is a challenging task in any academic
as a key component. Genetic algorithm (GA), simulated institutions. Al-Betar et al. [72] used a HSA for course
annealing (SA), and artificial immune system (AIS) were timetabling problem. ey modified the PAR to design the
used to improve the harmony vectors. e main advantage neighborhood structure. e neighborhood structure was
of this approach was faster convergence speed. Zou et al. [56] divided into two different procedures with random accep-
proposed a novel HSA to solve the reliability problems. A tance rule. is rule was changed to accept the local change
position updating mechanism was designed. However, this on new harmony vectors. Al-Betar et al. [73] proposed a
mechanism speeds up the premature convergence. To hybrid HSA for course timetabling problem. ey used hill
handle this situation, genetic mutation was introduced. climbing method to enhance the exploitation process. e
Fesanghary et al. [44] hybridized HSA with sequential global-best concept was incorporated in HSA for better
quadratic programming (SQP) to enhance the exploitation convergence. e proposed method was tested on eleven
mechanism. e balance between global and local search is datasets and attained the best result over the existing
controlled through the control parameter, Pc . Pc was set to methods. e modification in HSA was proposed by Al-
0.1 as reported in the literature. Alia et al. [57] designed a Betar and Khader [74] for timetabling problem. e HMCR
fuzzy clustering algorithm using HSA for image segmen- and PAR were modified to change the acceptance rule. e
tation. e empty operator was used for selection mecha- proposed approach was evaluated on two Socha bench-
nism. Fuzzy c-means (FCM) was hybridized with HSA to marks. Modified HSA provided the high quality solutions on
improve the quality of segmentation results. Gao et al. [58] these benchmarks.
developed two variants of HSA for solving optimization e flow shop problem has been widely used in chemical
problems. In the first approach, HSA is integrated with processing, pharmaceutical, and packing. Gao et al. [75]
differential evolution (DE) to improve the convergence. DE used discrete HSA (DHSA) to resolve the no-wait flow shop
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 11

Table 6: Improvement in HSA with multiobjective algorithms.

Ref. Algorithm Description Application Performance
Ranking method is used for Pareto-optimal
[44] MOHSA Project planning Improve the performance
solutions
Maximize the stability and
[45] MOHSA Pareto-optimality used Design of mobile robot
minimize the mass of robot
Ranking assignment and Pareto-optimality are
[46] MOHSA Optimization problems Better convergence, good solutions
employed in HSA
Self-adaptive mechanism is incorporated in
[47] MOHSA Water distribution network Improve the performance
MOHSA
External archive is employed to rank and store Software remodularization
[48] MaDHSA Improvement in accuracy
nondominated solutions problem
Nondominated sorting-based crowding distance is
[49] MBHSA Benchmark problems Improve convergence and diversity
employed to enhance the diversity
Weighted sum approach is used for assigning the Disk-brake and helical spring
[50] MPAHSA Improve performance
weightage to performance indicators problems

Table 7: Improvement in HSA with hybrid algorithms.

Hybrid
Ref. Description Application Performance
algorithm
Travelling salesman
[51] SA PAR is modified by using the cooling concept of SA Improve reliability
problem
[52] PSO BW is replaced with the concept of global-best particle Optimization problems Improve performance
PAR is dynamically updated by using the concept of
[53] DPSO PID controller Improve performance
DPSO
CSA is employed to improve the harmony vectors in Fuzzy classification
[54] CSA Better classification accuracy
HSA system
GA, SA, and AIS are used to improve the solutions Better convergence, avoid the
[55] GA, SA, AIS Task scheduling
stored in HM local optima
Genetic mutation and position updating mechanism
[56] GA, PSO Reliability problems Higher exploration capability
are used to improve the performance
Improve the effectiveness and
[A44] SQP SQP is employed to improve the local search Optimization problems
robustness of HSA
FCM is integrated into HSA for improving the
[57] FCM Clustering Superior performance
convergence
[58] DE DE is employed to fine tune the harmony vectors Optimization problems Improvement in performance
[59] Taguchi Taguchi is used to initialize the harmony memory Shape optimization Avoid premature convergence
NM-SA is employed to enhance the search capability of
[60] NM-SA Optimization problems Better exploration capability
HSA
GDL- Search capability of GDL is used to optimize the weight Enhance the classification
[71] Classification
FLANN of FLANN accuracy
Fuzzy rules are used to select the best rules in fuzzy-
[61] Fuzzy logic Medical diagnosis Improve the efficiency
based system
Mutation operator is employed to improve the
[62] CS Optimization problems Improve the convergence
harmony in HSA
Optimal location of
[63] ACO e concepts of ACO are incorporated into HSA Improve the convergence rate
structural dampers
HSA is used to mutate the fireflies for escaping the
[65] FA Optimization problems Less computational cost
solutions, which are being trapped into local optima

problem. e local search algorithms were incorporated in compared algorithms over the job shop scheduling problem.
HSA to minimize the flow time for flow shop problem. Yuan et al. [77] hybridized the HSA with local search to
Studies showed that DHSA gave better results than the HSA. maintain the balance between exploration and exploitation
Gao et al. [76] extended their work by incorporating Pareto- phases. Beside this, the neighborhood structure was also
based grouping method. e proposed method was called improved. e proposed approach was tested on 201
Pareto-based grouping discrete harmony search algorithm benchmark test problems. Gao et al. [78] utilized the
(PGDHSA). e grouping approach was utilized to im- weighted combination of both completion time and tardi-
provise the convergence. e results revealed that PGDHSA ness for flexible job shop scheduling problem. e machine
proved its efficiency and effectiveness with the other assignment and job permutation were used to memory
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
12 Mathematical Problems in Engineering

Table 8: Applications of HSA in different domains.

Broad area Problem/applications Algorithm used Reference
Course timetabling HSA, hybrid HSA [72–74]
Scheduling
Flow shop scheduling DHSA, PGDHSA MOHSA, hybrid HSA [75–79]
Structural design optimization HSA, DHSA [80–86]
Bridge design optimization HSA [87]
Mooring design HSA [88]
Cellular beam design HSA [89]
Civil engineering Water distribution networks HSA, PSO-HSA [90–94]
Dam design HSA [95]
Ground water management HSA [96, 97]
Site layout problem IHSA [98, 99]
Earthquake analysis HSA [100]
Optimal power flow MOHSA, HSA [101–104]
Economic load dispatch HSA, FA-HAS, MOHSA [105–111]
Electrical engineering
Virtual instrumentation HSA [112]
Placement of diesel generators HSA, MOHSA [113–115]
Optimal vehicle path HSA, MOHSA [116–119]
Knapsack problem Hybrid HSA [120, 121]
Industrial engineering Machine sequencing problem HSA [122, 123]
Vanishing point detection in car HSA [124]
Geological hazards assessment HSA [125]
Web clustering HSA, hybrid HSA [126, 127]
Clustering Data clustering HSA, hybrid HSA [128–131]
Document summarization HSA, global-best HSA [132, 133]
Multicast routing HSA [134]
Networking Muskingum flood routing Hybrid HSA [135, 136]
Wireless sensor networks HSA [137–139]
Visual tracking system IHSA [140, 141]
Image processing
Segmentation HSA [142–144]
Testing HSA, hybrid HSA [145–148]
Software engineering Word sense disambiguation HSA [149]
Software defect detection HSA [150]
Heat pipe design HSA [151, 152]
Mechanical engineering Power generation system IHSA [153, 154]
Milling HSA [155]
Detection of photon density HSA [156]
Photonics
Channel decoding HSA [157–161]
RNA structure prediction HSA [162, 163]
Hearing aids HSA [164]
Influenza forecast HSA [165, 166]
Healthcare
Protein structure prediction HSA [167, 168]
Medical physics HSA, DHSA [169–171]
Health resource management HSA [172–177]
Global optimization HSA [178, 179]
Noise level estimation HSA [180]
Miscellaneous
Feature selection HSA, IHSA, MOHSA [181]
Astronomy HSA [182]

initialization. e exploration capability of HSA was en- planar truss, 17-bar planar truss, 18-bar planar truss, 22-bar
hanced through local search operators. e proposed al- space truss, 25-bar space truss, 72-bar space truss, 200-bar
gorithm was evaluated on 49 benchmark instances and planar truss, and 120-bar dome space. e HSA provided the
provided better results for scheduling problems. Yuan and optimal solution for these problems. HSA was successfully
Xu [79] proposed two algorithms, namely, hybrid HSA and applied on structural design problems [83]. e design of
large neighborhood search, for job shop scheduling prob- steel frames was optimized using HSA by Degertekin [81].
lem. ey hybridized both algorithms to improve the e load, resistance, and displacement constraints were
performance. considered during the optimization process. Huang et al.
[82] used HSA for optimization of rectangular plate prod-
ucts in a steel plant. A variable neighborhood search al-
6.2. Civil Engineering. Lee and Geem [80] used HSA for gorithm was incorporated in HSA. e proposed method
truss structure optimization. ey applied HSA on 10-bar was effective for design problems. Lee et al. [84] designed a
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 13

Applications of HSA

Power Image
Data mining Medical Agriculture Scheduling
engineering processing

(i) Optimal method (i) Optimal power (i) Edge

(i) Enhancing (i) Pump scheduling
(i) Data clustering for UAE air- supply with
radioisotope (ii) Flexible job conservation
(ii) Data robots minimum cost
positioning scheduling (ii) Gray image
classification (ii) Maximum crop factor
(ii) Find optimal (iii) No-wait flow enrichment
(iii) Feature Selection production (ii) Reduction of
division of dosage shop job (iii) Multilevel
(iv) Prediction (iii) Minimum water CHP in power
required scheduling thresholding
supply plants
(iii) Diagnosis of
epileptic (iii) Enhanced output
convulsion from FACTS
phenomenon devices

Communication Water resource Manufacturing

Astronomy Health care
system management and designing

(i)Maximize range of sensors

(i) Find optimal (i) Best possible (i) Construction and organization
(ii)Minimize power consumption
water circulation path to the nearest (ii) Energy and environment
(iii)Searching nodes and their locations (i) Compute angstrom
health care center (iii) Factories and machineries
(iv) Sensing multiple users in CDMA network coefficient (iv) It geographical and farming
system (ii) Cost (ii) Optimal solution
(v) Chemical and fuel
(v) Develop radar code minimization for NRP
(vi) Designing and scheduling
(vi) Managing telecommunication gadgets

Figure 6: Application of HSA in different domains.

discrete HSA (DHSA) for truss optimization. e effec- amount of power is to be supplied with the minimal cost
tiveness of DHSA was tested on 72-bar space truss, 200-bar required [103]. Sivasubramani and Swarup [101] proposed a
planer truss, and 120-bar dome space truss [85,89]. Saka [86] multiobjective HSA (MOHSA) to solve the optimal power
presented the HSA for selecting the optimal sections of flow problem. Both nondominated sorting and crowding
beams and columns of steel frame. Garcı́a-Segura et al. [87] distance were used to obtain the optimal Pareto front. e
presented a computer-aided program to study the post- proposed MOHSA was evaluated on IEEE 30 bus system.
tensioned concrete box-girder road bridges. HSA was used MOHSA outperforms the NSGA-II in terms of optimal
to optimize thirty-three design variables associated with solutions. Vasebi et al. [105] presented HSA to solve the heat
box-girder road bridges. HSA was also utilized to minimize and power economic dispatch problem. e same problem
the cost of offshore mooring systems [88]. was solved by Khorram and Jaberipour [106].
During the last few years, HSA was successfully used in Khazali and Kalantar [107] designed a HSA for solving
designing of water distribution network and waste water reactive power dispatch problem. e HSA was used to
management. e network has to be designed by keeping in determine the generator voltages, positions of taps, and
mind the variations in the elevation, separations, and di- amount of reactive compensation devices. IEEE 30 and 57-
ameter of pipes. e network should be designed in a way to bus systems were used to evaluate the performance of HSA.
give smooth water supply with minimal cost. Geem [90] Elattar [108] proposed a modified HSA (MHSA) to solve
optimized the pipe diameters for water distribution network economic emission dispatch problem. e control param-
using HSA. EPANET was incorporated to determine the eters of MHSA were modified according to the application.
hydraulic constraints. is study found that HSA provided e roulette wheel selection mechanism was used in MHSA.
either the same cost or less cost (i.e., 0.28–10.26%) than the MHSA attained better reduction in power generation cost as
existing algorithms. e particle swarm concept was in- compared to the existing techniques. Rehman et al. [108]
corporated in DHSA for water network design [91]. Geem hybridized HSA with firefly algorithm (HSA-FA) for eval-
et al. [92] designed the optimal pipe network using HSA. e uation of energy management controller. Sivasubramani and
power loss criterion was incorporated in HSA to enhance the Swarup [110] presented MOHSA for economic load dis-
feasibility of pipe network. e switching problem in water patch. e fuel cost and emission were optimized simul-
pumping system was solved through HSA [93]. HSA was taneously. e ranking procedure with dynamic crowding
successfully used in various problems such hydrological distance was used to develop the distributed Pareto-optimal
parameter analysis [94], scheduling of dam system [95], set. e performance of MOHSA was tested on IEEE 30 and
ground water management [96,97], site layout selection 118-bus systems.
[98,99], and earthquake analysis [100]. Nekooei et al. [113] developed an improved MOHSA to
assess the impact of distributed generators. e optimal
scheduling of generators was done by Yadav et al. [114]. ey
6.3. Electrical Engineering. Electrical engineering focuses used HSA to determine the optimal solution for reducing the
primarily on the power supply optimization where the large fuel consumption. Ngonkham and Buasri [115] used HSA
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
14 Mathematical Problems in Engineering

for solving economic dispatch problem in wind energy selection for automatic text summarization. e readability,
conversion system. e cost computed from HSA was re- cohesion, and topic relevance were used to design the fitness
duced by 1.4%. HSA was used in variety of power engi- function. Mendoza et al. [133] used global-best HSA and
neering problems such as optimal design of LID [102], local search strategy for document summarization. e
energy demand estimation [104], virtual instrumentation sentence length, coverage, and position of sentence were
[112], and electrical field analysis [111]. incorporated in fitness function. e proposed approach has
less execution time than the other techniques. A survey on
clustering techniques using harmony search algorithms was
6.4. Industrial Engineering. Geem et al. [116] used HSA to
found in [129].
determine the optimal route for eastern part of China. e
fourth party logistics problem with time windows (4PLTW)
was solved through HSA [117]. HSA was able to determine 6.6. Networking. Forsati et al. [134] designed novel algo-
the optimal path within reasonable time and cost. Huang rithms to solve the bandwidth-delay constrained multicast
et al. [118] minimized the route cost and time window routing problem using HSA. e first algorithm utilized the
penalties for 4PLTW. Alomoush et al. [120] hybridized HSA modified Prufer number for multicast trees. e second
with Jaya search algorithm to solve the 0/1 knapsack algorithm used node parent index representation scheme for
problem. e penalty function was incorporated to handle encoding the solutions. e solution quality and conver-
the weight condition. Twenty different case studies were gence of the proposed algorithm were analyzed. Karahan
used to evaluate the performance of hybrid algorithm. Biao et al. [135] used hybrid HSA for the parameter estimation of
et al. [121] integrated fruit fly strategy into improved HSA Muskingum flood routing model. e penalty function was
(IHSA) for solving multidimensional knapsack problems. incorporated in the model to evade the negativity of outflows
e global-best pitch adjustment and parallel updating and storages. Zeng and Dong [136] proposed a new
strategy were also used to enhance the search. e well- encoding scheme of harmony memory for routing in
known benchmark test instances were used to evaluate the wireless sensor networks. e dynamic adaption strategy
performance of hybrid IHSA. was used to improve the control parameter of IHSA. To
Fesanghary et al. [122] hybridized HSA with sequential improve the convergence speed, local search strategy was
quadratic programming to solve the constrained and non- incorporated in IHSA.
constrained engineering design problems. Nawaz et al. [123] Wireless sensor network (WSN) slowly and progres-
used HSA for processing the jobs according to the priority sively gained the spotlight due to its capability of sensing any
assigned to jobs. e vanishing point is an important factor materialistic activity without using any cabled connection.
in self-driving vehicles. HSA was used to determine the Manjarres et al. [137] presented the hybridization of HSA
vanishing point [124]. Yassen et al. [119] used HSA-opti- with local search to alleviate the nonuniqueness of networks.
mizer and HSA-solver for vehicle routing problem. Mikaeil e connectivity-based geometrical constraints were con-
et al. [125] studied the risk of geological hazards on Ardabil- sidered during the optimization process. Manjarres et al.
Mianeh highway tunnel using HSA. e tunnel instability, [138] used a multiobjective harmony search algorithm for
squeezing, and water inflow were assessed. wireless sensor networks. e concepts of nondominated
sorting and crowding distance were utilized in the proposed
approach. e local search procedure was used to remove
6.5. Clustering. Forsati et al. [126] proposed clustering al-
the flip ambiguity phenomenon. e information of node
gorithms based on the concept of HSA. K-means was hy-
connectivity was utilized in the proposed approach. Landa-
bridized with HSA to achieve better web clustering results.
Torres et al. [139] designed a HSA to determine the number
e proposed approach was tested on five different datasets
of access points for maximizing the coverage level of
and provided better convergence results than the K-means
deployed network.
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 6.7. Image Processing. Fourie et al. [140] presented a visual
local search for further improvement in clustering solutions. tracking approach using HSA. e visual tracking was
Bayesian information criterion was used to determine the known as harmony filter. e harmony filter utilized the
number of clusters. e time complexity of the proposed color histogram and found out the target location using
approach was lesser than the existing clustering techniques. Bhattacharya coefficient. is study revealed that the har-
Kumar et al. [130] developed an automatic data clus- mony filter has better accuracy and computational speed
tering technique using parameter adaptive harmony search than particle filter and Kalman filter. Ebrahim et al. [141]
algorithm (PAHSA). A variable length encoding scheme was presented a method to determine the best angular trajectory
used to determine the number of clusters automatically. e using HSA. HSA was applied to improve the image by
threshold setting and cutoff mechanisms were used to refine performing edge preservation [142]. Edge preservation was
the search strategy. e proposed approach was evaluated on done by both image conservation as well as an optimization
both UCI datasets and images. Alia et al. [131] used HSA to process. e performance of the HSA was compared with
optimize the initial cluster centres of fuzzy c-means. histogram equalization algorithm and the proposed ap-
ereafter, it was applied on MRI images for segmentation. proach gave enhanced image output. Al-Betar et al. [143]
Shareghi and Hassanabadi [132] used HSA-based sentence utilized HSA for grey level image enhancement. e
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 15

proposed approach was compared with histogram equal- evolution (DE) for power allocation in an orthogonal fre-
ization and image adjacent algorithms. e results revealed quency division multiple access downlink. e greedy
that HSA provided better results than these algorithms in subcarrier exchange technique was also incorporated in the
terms of entropy measure. e multilevel thresholding of an hybrid algorithm. e well-known problems, which are
image was done through the HSA [144]. e image histo- improvised by HSA, are sensing multiple users in CDMA
grams were used to encode the harmony vectors. Ostu or systems, organizing resources in an active cordless system
Kapur methods were used for designing the objective [159] and developing radar codes [160] and management of
function. e outcome was favorable to the Otsu method as telecommunication gadgets [161].
compared to the Kapur method. It was also observed that
HSA gave effectively optimized and accurate results.
6.11. Healthcare. e medical care facility is worthy when it
is accessible physically on demand. e location of medical
6.8. Software Engineering. Alsewari and Zamli [145] de- centre, the distance between the patient and the centre, and
veloped a pairwise harmony search algorithm (PHSA) to modes of transportation available are the main factors of
perform the pairwise testing. Alsewari and Zamli [146] medical care facilities. HSA was used to establish a con-
investigated the adoption of HSA in variable-strength t-way nection between the medical centres and their availability to
test generation strategy. e HSA provided the competitive people [174]. Nurse rostering problem is considered a
results as compared to the existing test strategies. However, combinatorial task with numerous restrictions [172]. In the
the proposed approach can be implemented in parallel study, HSA was used to resolve this problem. Harmony
fashion. e interaction test data were generated through memory in HSA was used to save the improved changes in
HSA [147]. e greedy approach was used to generate a the solution during the evaluation process. HSA not only
complete test suite. Mao [148] generated the test data by improved results but also exhibited efficient performance as
using HSA. He used probes for collecting the coverage in- compared to the other metaheuristic algorithms used for the
formation and inserted into the branches. e coverage same purpose [173]. In [174], HSA was used to find the most
factor was used to design the fitness function. e branch suitable place for constructing a medical centre. e com-
information was used to determine the weight of each bination of genetic algorithm and a local searching was used
branch. Abed et al. [149] developed an unsupervised method to search the area for medical care centre on the basis of the
for word disambiguation using HSA. HSA-based depen- population of patients [176]. A multiobjective grouping
dency generator was used to parse sentences. e relatedness harmony search algorithm (MOGHSA) was developed for
measurements and semantic similarity were used to design the best possible allocation of medical centres, considering
the fitness function. e evaluation of proposed approach money, distance, and capability [177].
was done on benchmark datasets and achieved effective HSA have shown their acceptability for treatment of
solutions on these datasets. Kang et al. [93] presented just- medical problems. For treating cancer, ionizing radiation is
in-time software defect prediction using HSA. 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
6.9. Mechanical Engineering. Geem and Hwangbo [151]
[169]. HSA is also used to probe into the large amounts of
developed a multiobjective HSA for thermal conductance
dose-rated prostate brachytherapy [170]. Another use of
and heat pipe design. e control parameters such as length
HSA is in the diagnosis of epileptic convulsion phenome-
of conduction fin, thickness of fin, operation temperature,
non. Differential harmony search algorithm (DHSA) is
and adhesive thickness were used to design the multi-
responsible for enhancing categorization and giving a pre-
objective function. Fesanghary et al. [152] hybridized the
cise result with minimal complexity [171]. e common
global sensitivity analysis and HSA for optimization of tube
medical problems solved by HSAs are hearing aids [164],
heat exchangers. e harmonic optimization in multilevel
influenza forecasting [165, 166], and protein structure
inverters was done through HSA [153]. Geem and Yoon
prediction [167, 168].
[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. 6.12. Miscellaneous. Geem [178] and Kim et al. [179] utilized
e number of passes and cutting parameters were opti- HSA for parameter estimation of Muskingum model. Mun
mized through HSA. e main objective of this problem is to and Geem [180] designed a method to determine the sound
optimize the production cost. power levels of noise sources. e level of acoustic pa-
rameters and overall noise were used to evaluate the noise
level. HSA was used to evaluate this process. Yusup et al.
6.10. Photonics. Dong et al. [156] presented a method for [181] presented a survey on feature selection and dimen-
detection of photon density wave using HSA. e control sionality reduction using harmony search algorithms. HSA
parameters of HSA were adjusted to improve the search was used to compute the Angstrom coefficient in the study
process. Zhang and Hanzo [157] designed a HSA-based and exhibited great outcome. It proved to be an effective
multiuser detection and channel decoding for DS-CDMA method to improve the calculations and get enhanced
systems. Ser et al. [158] hybridized both HSA and differential outcome [182–185].
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
16 Mathematical Problems in Engineering

7. Future Research Directions After study of this paper, the researchers can apply HSA
in their research problems. e researchers can pay attention
In last few decades, researchers have investigated the control to some applications and variants of HSA after examining
parameters of HSA in detail. Beside this, some researchers the merits and demerits of HSA. e researchers can try to
have also modified the basic structure of HSA by incor- explore the HSA for solving the many-objective optimiza-
porating the concepts of other metaheuristics. However, tion problems. ere are few open areas for improvement
there are a few open areas in HSA for further research. e and hybridization of HSA with other algorithms [186].
possible research directions of HSA are given as follows.
Data Availability
7.1. Parameter Tuning. Parameter tuning is the most crucial
step of any metaheuristic algorithms. More investigations Data will be made available upon request to the corre-
are required to determine the optimal parameter setting of sponding author.
HSA and identified parameter setting should be applicable
on a wide variety of applications. e parameter tuning Conflicts of Interest
problem is considered as an optimization problem. Auto-
matic schemes are required to select the optimal parameters e authors declare that they have no conflicts of interest.
according to the given problem.
References
7.2. +eoretical Analysis. Most of the research articles did [1] C. Blum and A. Roli, “Metaheuristics in combinatorial
not provide any theoretical analysis of modification and optimization: overview and conceptual comparison,” ACM
improvement that was held in HSA. ere is a need to study Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003.
the HSA and give the reason why HSA performs better than [2] L. Velho, P. Carvalho, J. Gomes, and L. D. Figueiredo,
others. e theoretical analysis of parameters, structure, and Mathematical Optimization in Computer Graphics and Vi-
landscapes of fitness is required. sion, Elsevier, Amsterdam, Netherland, 2008.
[3] H. Pannu, D. Singh, and A. Kaur Malhi, “Multi-objective
particle swarm optimization-based adaptive neuro-fuzzy
7.3. Many-Objective Optimization. Pareto-optimal domi- inference system for benzene monitoring,” Neural Com-
nance concept has been used in HSA to solve the many- puting and Applications, vol. 31, no. 7, pp. 2195–2205, 2019.
objective problems. is concept was used to compare the [4] H. S. Pannu, D. Singh, and A. K. Malhi, “Improved particle
swarm optimization based adaptive neuro-fuzzy inference
solutions. Based upon this concept, the archive becomes
system for benzene detection,” CLEAN–Soil, Air, Water,
quickly full for some optimization problems. erefore, vol. 46, no. 5, Article ID 1700162, 2018.
there is a need to use the special operators such as hyper- [5] Z. W. Geem, J. H. Kim, and G. Loganathan, “A new heuristic
volume, reference vector adaption strategy, and knee points. optimization algorithm: harmony search,” Simulation,
vol. 76, no. 2, pp. 60–68, 2001.
[6] V. Kumar, J. K. Chhabra, and D. Kumar, ““Effect of harmony
7.4. Multiobjective Optimization. A number of multi- search parameters’ variation in clustering,” Procedia Tech-
objective harmony search algorithms have been developed. nology, vol. 6, pp. 265–274, 2012.
Still, there is some scope that can be targeted in near future. [7] D. Moher and A. Liberati, “e PRISMA Group (2009)
e existing algorithms utilized the concept of archive. Some Preferred reporting items for systematic reviews and meta-
other mechanisms and multiobjective operators are available analyses: the PRISMA statement,” PLoS Med, vol. 6, 2009.
in literature, which can be utilized to solve the multiobjective [8] M. Mahdavi, M. Fesanghary, and E. Damangir, “An im-
problems. proved harmony search algorithm for solving optimization
problems,” Applied Mathematics and Computation, vol. 188,
pp. 1567–1579, 2007.
8. Conclusions [9] Q. K. Pan, P. N. Suganthan, M. F. Tasgetiren et al., “A self-
adaptive global best harmony search algorithm for contin-
More than 100 papers were studied and analyzed to highlight uous optimization problems,” Appl. Math. Comput.vol. 216,
the strength, weakness, and robustness of HSA. A com- pp. 830–848, 2010.
prehensive review of the HSA is presented in this paper. e [10] S. Das, A. Mukhopadhyay, A. Roy, A. Abraham, and
aim of this paper is to provide the summarized overview and B. K. Panigrahi, “Exploratory power of the harmony search
research applications of HSA. HSA variants such as binary, algorithm: analysis and improvements for global numerical
chaotic, multiobjective, and hybridized are analyzed with optimization,” IEEE Transactions on Systems, Man, and
merits and demerits. e control parameters of HSA are Cybernetics, Part B, vol. 41, no. 1, pp. 89–106, 2011.
[11] Z. Kong, L. Gao, L. Wang, and Y. Ge, “On an adaptive
studied in detail. It is observed from the literature that HSA
harmony search algorithm,” International Journal of Inno-
has wide applicability in engineering, networking, sched- vative Computing, Information and Control, vol. 5, no. 9,
uling, classification, bioinformatics, and other problems. pp. 2551–2560, 2009.
HSA allows improvising the method by either making [12] C. M. Wang and Y. F. Huang, “Self adaptive harmony search
changes in some of its parameters or by hybridizing it with a algorithm for optimization,” Journal of Applied Mathematics,
different algorithm. vol. 37, no. 4, pp. 2826–2837, 2010.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 17

[13] K. Luo, “A novel self-adaptive harmony search algorithm,” [31] G. Li and H. Wang, “Improved harmony search algorithm
Journal of Applied Mathematics, vol. 2013, Article ID 653749, for global optimization,” Chinese Control and Decision,
16 pages, 2013. vol. 21, 2018.
[14] J. Chen, Q. K. Pan, and J. Q. Li, “Harmony search algorithm [32] H.-B. Ouyang, L.-Q. Gao, S. Li, X.-Y. Kong, Q. Wang, and
with dynamic control parameters,” Applied Mathematics and D.-X. Zou, “Improved harmony search algorithm: LHS,”
Computation, vol. 219, pp. 592–604, 2012. Applied Mathematics and Computation, vol. 53, pp. 133–167,
[15] A. Kattan and R. Abdullah, “A dynamic self-adaptive har- 2017.
mony search algorithm for continuous optimization prob- [33] B. Alatas, “‘‘Chaotic harmony search algorithms,” Applied
lems,” Applied Mathematics and Computation, vol. 219, Mathematics and Computation, vol. 216, no. 3, pp. 2687–
pp. 8542–8567, 2013. 2699, 2010.
[16] J. Kalivarapu, S. Jain, and S. Bag, “An improved harmony [34] M. F. El-Santawy, A. N. Ahmed, Z. El-Dean, and
search algorithm with dynamically varying bandwidth,” A. Ramadan, “‘‘Chaotic harmony search optimizer for
Applied Mathematics and Computation, vol. 48, pp. 1091– solving numerical integration,” Computer Science and In-
1108, 2016. formation Systems, vol. 16, no. 2, pp. 21–24, 2012.
[17] V. Kumar, J. K. Chhabra, and D. Kumar, “Parameter [35] O. Abdel-Raouf, I. El-henawy, and M. Abdel-Baset,
adaptive harmony search algorithm for unimodal and “‘‘Chaotic harmony search algorithm with different chaotic
multimodal optimization problems,” Journal of Computa- maps for solving assignment problems,” International
tional Science, vol. 5, no. 2, pp. 144–155, 2014. Journal of Applied and Computational, vol. 86, no. 10,
[18] V. Kumar, J. K. Chhabra, and D. Kumar, “Clustering using pp. 1–6, 2014.
modified harmony search algorithm,” International Journal [36] O. Abdel-Raouf, I. El-Henawy, and M. Abdel-Baset, “‘‘A
of Computational Intelligence Studies, vol. 3, no. 2/3, novel hybrid flower pollination algorithm with chaotic
pp. 113–133, 2014. harmony search for solving sudoku puzzles,” International
[19] M. Khalili, R. Kharrat, K. Salahshoor et al., “Global dynamic Journal of Applied and Computational, vol. 6, no. 3, p. 38,
harmony search algorithm: Gdhs,” Applied Mathematics and 2014.
Computation, vol. 228, pp. 195–219, 2014. [37] M. Shafaati and H. Mojallali, “IIR filter optimization using
[20] Z. Guo, H. Yang, S. Wang et al., “Adaptive harmony search improved chaotic harmony search algorithm,” Automatika,
vol. 59, no. 3-4, pp. 331–339, 2018.
with best-based search strategy,” Soft Computing, vol. 22,
[38] A. Askarzadeh, “A discrete chaotic harmony search-based
pp. 1335–1349, 2018.
simulated annealing algorithm for optimum design of PV/
[21] Y. Wang, Z. Guo, and Y. Wang, “Enhanced harmony search
wind hybrid system,” Solar Energy, vol. 97, pp. 93–101, 2013.
with dual strategies and adaptive parameters,” Soft Com-
[39] J. Yi, C.-H. Chu, and L. Gao, “Parallel chaotic local search
puting, vol. 21, pp. 4431–4445, 2017.
enhanced harmony search algorithm for engineering design
[22] N. Siddique and H. Adeli, “Harmony search algorithm and
optimization,” Journal of Intelligent Manufacturing, vol. 30,
its variants,” International Journal of Pattern Recognition and
pp. 405–428, 2019.
Artificial Intelligence, vol. 29, no. 8, 2015.
[40] L. Wang, R. Yang, Y. Xu, Q. Niu, P. M. Pardalos, and M. Fei,
[23] J. Yi, C. Lu, and G. Li, “A literature review on latest de-
“‘‘An improved adaptive binary harmony search algorithm,”
velopments of Harmony Search and its applications to in-
’Inf. Sci.vol. 232, pp. 58–87, 2013.
telligent manufacturing,” Mathematical Biosciences and [41] M. Ravindra, R. S. Rao, and V. S. NagaRaju, “A binary
Engineering, vol. 16, no. 4, pp. 2086–2117, 2019. harmony search algorithm approach for security constrained
[24] R. Enayatifar, M. Yousefi, A. H. Abdullah et al., “LAHS: a allocation of PMUs to obtain complete observability,,” in
novel harmony search algorithm based on learning Intelligent Communication, Control and Devices,
automata,” Communications in Nonlinear Science and Nu- S. Choudhury, R. Mishra, R. Mishra, and A. Kumar, Eds.,
merical Simulation, vol. 18, pp. 3481–3497, 2013. Vol. 989, Springer, Singapore, 2020.
[25] V. Kumar, J. K. Chhabra, and D. Kumar, “Variance-based [42] G. Lin and Z. Li, “A hybrid binary harmony search algorithm
harmony search algorithm for unimodal and multimodal for solving the winner determination problem,” Interna-
optimization problems with application to clustering,” Cy- tional Journal of Innovative Computing and Applications,
bernetics and Systems, vol. 45, no. 6, pp. 486–511, 2014. vol. 10, no. 1, pp. 59–68, 2019.
[26] Z. W. Geem and K.-B. Sim, “Parameter-setting-free harmony [43] X. Kong, L. Gao, H. Ouyang, and S. Li, ““A simplified binary
search algorithm,” Applied Mathematics and Computation, harmony search algorithm for large scale 0–1 knapsack
vol. 217, no. 8, pp. 3881–3889, 2010. problems,” Expert Systems with Applications, vol. 42,
[27] Y.-W. Jeong, S.-M. Park, Z. W. Geem, K.-B. Sim, and “, pp. 5337–5355, 2015.
“Advanced parameter-setting-free harmony search algo- [44] Z. W. Geem, “‘‘Multiobjective optimization of time-cost
rithm,” Applied Sciences, vol. 10, no. 7, 2020. trade-off using harmony search,” Journal of Construction
[28] S. Jiang, Y. Zhang, P. Wang, and M. Zheng, “An almost- Engineering and Management, vol. 136, no. 3, pp. 711–716,
parameter-free harmony search algorithm for groundwater 2010.
pollution source identification,” Water Science Technology, [45] H. Xu, X. Z. Gao, T. Wang, and K. Xue, “Harmony search
vol. 68, no. 11, pp. 2359–2366, 2013. optimization algorithm: application to a reconfigurable
[29] M. Shaqfa and Z. Orban, “Modified parameter-setting-free mobile robot prototype,” in Recent Advances in Harmony
harmony search (PSFHS) algorithm for optimizing the de- Search Algorithm, Studies in Computational Intelligence,
sign of reinforced concrete beams,” Structural and Multi- vol. vol. 270, pp. 11–22, Springer, Singapore, 2010.
disciplinary Optimization, vol. 60, pp. 999–1019, 2019. [46] J. Ricart, G. Huttemann, J. Lima, and B. Baran, “Multi-
[30] S. Mun and Y.-H. Cho, “Modified harmony search opti- objective harmony search algorithm proposals,” Electronics
mization for constrained design problems,” Expert Systems Notes in +eoretical Computer Science, vol. 281, pp. 51–67,
with Applications, vol. 39, no. 1, pp. 419–423, 2012. 2011.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
18 Mathematical Problems in Engineering

[47] Y. H. Choi, H. M. Lee, D. G. Yoo, and J. H. Kim, “Application [63] F. Amini and P. Ghaderi, “Hybridization of harmony search
of self-adaptive method in multi-objective harmony search and ant colony optimization for optimal locating of struc-
algorithm,” Harmony Search Algorithm, vol. 20, pp. 15–21, tural dampers,” Soft Computing, vol. 13, no. 5,
2017. pp. 2272–2280, 2013.
[48] A. Prajapati, J. K. Chhabra, and MaD. H. S. “, “Many-ob- [64] A. Fouad, D. Boukhetala, F. Boudjema et al., “A novel global
jective discrete harmony search to improve exiting package harmony search method based on ant colony optimisation
design,” Computational Intelligence, vol. 35, no. 1, algorithm,” Journal of Experimental and +eoretical Artificial
pp. 98–123, 2019. Intelligence, vol. 28, pp. 215–238, 2016.
[49] L. Wang, Y. Mao, Q. Niu, and M. Fei, “A multi-objective [65] L. Guo, G.-G. Wang, H. Wang, and D. Wang, “An effective
binary harmony search algorithm,”,” in Advances in Swarm hybrid firefly algorithm with harmony search for global
Intelligence, Y. Tan, Y. Shi, Y. Chai, and G. Wang, Eds., Vol. numerical optimization,” +e Scientific World Journal, vol. 1,
vol. 6729, Springer, Singapore, 2011. 2013.
[50] P. Sabrinath, “Multiobjective optimization method based on [66] G. Wang and L. Guo, “A novel hybrid bat algorithm with
adaptive parameter harmony search algorithm,” Journal of harmony search for global numerical optimization,” Journal
Applied Mathematics, vol. 201512 pages, 2015. of Applied Mathematics, vol. 2013, Article ID 696491,
[51] N. Taherinejad, “Highly reliable harmony search algorithm,” 21 pages, 2013.
Circuit +eory and Design, pp. 818–822, Springer, Singapore, [67] S. Tuo, L. Yong, and T. Zhou, “An improved harmony search
2009. based on teaching-learning strategy for unconstrained op-
[52] M. G. H. Omran and M. Mahdavi, “Global-best harmony timization problems,” Mathematical Problems in Engineer-
search,” Applied Mathematics and Computation, vol. 198, ing, vol. 2013, Article ID 413565, 21 pages, 2013.
no. 2, pp. 643–656, 2008. [68] G. Wang, L. Guo, H. Duan et al., “Hybridizing harmony
[53] L. D. Santos Coelho and D. L. de Andrade Bernert, “An search with biogeography based optimization for global
improved harmony search algorithm for synchronization of numerical optimization,” Journal of Computational and
discrete-time chaotic systems,” Chaos Solitons Fractals, +eoretical Nanoscience, vol. 10, pp. 2312–2322, 2013.
vol. 41, no. 5, pp. 2526–2532, 2009. [69] G. Zhang and Y. Li, “A memetic algorithm for global op-
[54] X. Wang, X. Z. Gao, and S. J. Ovaska, “Fusion of clonal timization of multimodal nonseparable problems,” IEEE,
selection algorithm and harmony search method in opti- vol. 46, pp. 1375–1387, 2016.
[70] A. Sadollah, H. Sayyaadi, D. G. Yoo et al., “Mine blast
misation of fuzzy classification systems,” International
harmony search: a new hybrid optimization method for
Journal of Bio-Inspired Computation, vol. 1, no. 1, pp. 80–88,
improving exploration and exploitation capabilities,” Ap-
2009.
plied Soft Computing, vol. 68, pp. 548–564, 2018.
[55] Y. C. Lee and A. Y. Zomaya, ““Interweaving heterogeneous
[71] B. Naik, J. Nayak, and H. S. Behra, “A global-best harmony
metaheuristics using harmony search,” in Proceedings of the
search based gradient descent learning FLANN (GbHS-
IEEE International Symposium on Parallel & Distributed
GDL-FLANN) for data classification,” Egyptian Informatics
Processing, pp. 1–8, Atlanda, GA, USA, 2009.
Journal, vol. 17, no. 1, pp. 57–87, 2016.
[56] D. Zou, L. Gao, J. Wu, S. Li, and Y. Li, “A novel global
[72] M. A. Al-Betar, A. T. Khader, and I. Y. Liao, “‘‘A harmony
harmony search algorithm for reliability problems,” Com-
search with multi-pitch adjusting rate for the University
puters & Industrial Engineering, vol. 58, no. 2, pp. 307–316, course timetabling,” in Recent Advances in Harmony Search
2010. Algorithm, pp. 147–161, Springer, Berlin, Germany, 2010.
[57] O. M. Alia, R. Mandava, and M. E. Aziz, “A hybrid harmony [73] M. A. Al-Betar and A. T. M. Khader Zaman, “‘‘University
search algorithm to mri brain segmentation,” in Proceedings course timetabling using a hybrid harmony search meta-
of the IEEE International Conference on Cognitive Infor- heuristic algorithm,” IEEE Transactions on Systems, Man,
matics, Tsinghua University, Beijing, China, 2010. and Cybernetics, vol. 42, no. 5, pp. 664–681, 2012.
[58] X. Z. Gao, X. Wang, and S. J. Ovaska, ““Modified harmony [74] M. A. Al-Betar and A. T. Khader, “‘‘A harmony search al-
search methods for uni-modal and multi-modal optimiza- gorithm for University course timetabling,” Annals of Op-
tion,” in Proceedings of the International Conference on erations Research, vol. 194, no. 3, pp. 3–31, 2012.
Hybrid Intelligent Systems, pp. 65–72, Barcelona, Spain, 2008. [75] K.-Z. Gao, Q.-K. Pan, and J.-Q. Li, “‘‘Discrete harmony
[59] A. Yildiz and F. Ozturk, “Hybrid taguchi-harmony search search algorithm for the no-wait flow shop scheduling
approach for shape optimization,,” in Recent Advances in problem with total flow time criterion,” +e International
Harmony Search Algorithm, Z. Geem, Ed., pp. 89–98, Journal of Advanced Manufacturing Technology, vol. 56,
Springer, Berlin, Germany, 2010. no. 5–8, pp. 683–692, 2011.
[60] W. S. Jang, H. I. Kang, and B. H. Lee, ““Hybrid simplex- [76] K.-Z. Gao, P. N. Suganthan, Q.-K. Pan, T. J. Chua, T. X. Cai,
harmony search method for optimization problems,” in and C.-S. Chong, “‘‘Pareto-based grouping discrete harmony
Congress on Evolutionary Computation, pp. 4157–4164, search algorithm for multi-objective flexible job shop
Springer, Berlin, Germany, 2008. scheduling,” +e International Journal of Advanced
[61] S. M. Mousavi, S. Abdullah, S. T. A. Niaki, and Manufacturing Technology, vol. 289, pp. 76–90, 2014.
S. Banihashemi, “An intelligent hybrid classification algo- [77] Y. Yuan, H. Xu, and J. Yang, “‘‘A hybrid harmony search
rithm integrating fuzzy rule-based extraction and harmony algorithm for the flexible job shop scheduling problem,” vol.
search optimization: medical diagnosis applications,” 13, no. 3, pp. 3259–3272, 2013.
Knowledge-based Systems, vol. 2020, Article ID 106943, 2021. [78] K.-Z. Gao, P. N. Suganthan, Q. K. Pan, T. J. Chua, T. X. Cai,
[62] G.-G. Wang, A. H. Gandomi, X. Zhao, and H. C. E. Chu, and C. S. Chong, “‘‘Discrete harmony search algorithm for
“Hybridizing harmony search algorithm with cuckoo search flexible job shop scheduling problem with multiple objec-
for global numerical optimization,” Soft Computing, vol. 20, tives,” Journal of Intelligent Manufacturing, vol. 27, no. 2,
pp. 273–285, 2016. pp. 363–374, 2016.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 19

[79] Y. Yuan and H. Xu, “‘‘An integrated search heuristic for [96] M. T. Ayvaz, “‘‘Application of harmony search algorithm to
large-scale flexible job shop scheduling problems,” Com- the solution of groundwater management models,” Advances
puters & Operations Research, vol. 40, no. 12, pp. 2864–2877, in Water Resources, vol. 32, no. 3, pp. 916–924, 2009.
2013. [97] Z. W. Geem and J. C. Williams, “‘‘Ecological optimization
[80] S. Lee and Z. W. Geem, “‘‘A new structural optimization using harmony search,” Advances in Water Resources, vol. 4,
method based on the harmony search algorithm,” Computers pp. 148–152, 2008.
& Operations Research, vol. 82, no. 9–10, pp. 781–798, 2004. [98] Y. M. Cheng, L. Li, T. Lansivaara, S. C. Chi, and Y. J. Sun,
[81] S. O. Degertekin, “‘Optimum design of steel frames using “‘‘An improved harmony search minimization algorithm
harmony search algorithm,” Structural and Multidisciplinary using different slip surface generation methods for slope
Optimization, vol. 36, no. 3, pp. 393–401, 2008. stability analysis,” Optimization and Engineering, vol. 40,
[82] M. Huang, H.-Y. Dong, X.-W. Wang, B.-L. Zheng, and no. 2, pp. 95–115, 2008.
W. H. Ip, “‘Guided variable neighborhood harmony search [99] R. Gholizadeh, G. G. Amiri, and B. Mohebi, “‘‘An alternative
for integrated charge planning in primary steelmaking approach to a harmony search algorithm for a construction
site layout problem,” Canadian Journal of Civil Engineering,
processes,” Genetic Programming and Evolvable Machines,
vol. 37, no. 12, pp. 1560–1571, 2010.
vol. 2009, pp. 231–238, 2009.
[100] A. H. Kayhan, K. A. Korkmaz, and A. Irfanoglu, “‘‘Selecting
[83] Z. W. Geem, Harmony Search Algorithms for Structural
and scaling real ground motion records using harmony
Design Optimization, Vol. vol. 239, Springer, Berlin, Ger-
search algorithm,” Soil Dynamics Earthquake Engineering,
many, 2009. vol. 31, no. 7, pp. 941–953, 2011.
[84] K. S. Lee, Z. W. Geem, S.-H. Lee, and K.-W. Bae, “e [101] S. Sivasubramani and K. Swarup, “‘‘Multi-objective harmony
harmony search heuristic algorithm for discrete structural search algorithm for optimal power flow problem,” Inter-
optimization,” Optimization and Engineering, vol. 37, no. 7, national Journal of Electrical Power & Energy Systems, vol. 33,
pp. 663–684, 2005. no. 3, pp. 745–752, 2011.
[85] K. S. Lee, S. W. Han, and Z. W. Geem, “Discrete size and [102] F. De Paola, M. Giugni, F. Pugliese, and P. Romano,
discrete-continuous configuration optimization methods for “‘‘Optimal design of LIDs in urban storm water systems
truss structures using the harmony search algorithm,” In- using a harmony-search decision support system,” Water
ternational Journal of Optimization in Civil Engineering, Resources Management, vol. 32, no. 3, pp. 4933–4951, 2018.
vol. 1, pp. 107–126, 2011. [103] D. Manjarres, “‘‘A survey on applications of the harmony
[86] M. P. Saka, “‘‘Optimum design of steel sway frames to search algorithm,” Engineering Applications of Artificial
BS5950 using harmony search algorithm,” International Intelligence, vol. 26, no. 8, pp. 1818–1831, 2013.
Journal of Optimization in Civil Engineering, vol. 65, no. 3, [104] H. Ceylan, H. Ceylan, S. Haldenbilen, and O. Baskan,
pp. 36–43, 2009. “‘‘Transport energy modeling with meta-heuristic harmony
[87] T. Garcı́a-Segura, V. Yepes, and J. A. González, “‘‘Computer- search algorithm, an application to Turkey,” Energy Policy,
support tool to optimize bridges automatically,” Interna- vol. 36, no. 7, pp. 2527–2535, 2008.
tional Journal of Computational Methods and Experimental [105] A. Vasebi, M. Fesanghary, and S. M. T. Bathaee, “‘‘Combined
Measurements, vol. 5, no. 3, pp. 171–178, 2017. heat and power economic dispatch by harmony search al-
[88] S. Ryu, A. S. Duggal, C. N. Heyl, and Z. W. Geem, “‘‘Cost- gorithm,” International Journal of Electrical Power & Energy
optimized FPSO mooring design via harmony search,” Systems, vol. 29, no. 3, pp. 713–719, 2007.
Journal of Offshore Mechanics and Arctic Engineering, [106] E. Khorram and M. Jaberipour, “‘‘Harmony search algorithm
vol. 138, no. 6, Article ID 061303, 2016. for solving combined heat and power economic dispatch
[89] F. E. E. Do�gan and M. P. Saka, “‘‘Optimum design of cellular problems,” Energy Conversion and Management, vol. 52,
beams using harmony search and particle swarm opti- no. 2, pp. 1550–1554, 2011.
mizers,” Journal of Constructional Steel Research, vol. 67, [107] A. H. Khazali and M. Kalantar, “‘‘Optimal reactive power
dispatch based on harmony search algorithm,” International
no. 3, pp. 237–247, 2011.
Journal of Electrical Power & Energy Systems, vol. 33, no. 3,
[90] Z. W. Geem, “‘‘Optimal cost design of water distribution
pp. 684–692, 2011.
networks using harmony search,” Optimization and Engi-
[108] E. E. Elattar, “‘‘Modified harmony search algorithm for
neering, vol. 38, no. 3, pp. 259–277, 2006.
combined economic emission dispatch of microgrid incor-
[91] Z. W. Geem, “‘‘Particle-swarm harmony search for water
porating renewable sources,” Energy, vol. 159, pp. 496–507,
network design,” Optimization and Engineering, vol. 41,
2018.
no. 3, pp. 297–311, 2009. [109] A. U. Rehmanet al., “‘‘Efficient energy management system
[92] Z. W. Geem, J. H. Kim, and G. Loganathan, “‘‘Harmony using firefly and harmony search algorithm,” Broadband
search optimization: application to pipe network design,” Wireless Computational, vol. 12, pp. 37–49, 2017.
International Journal of Modelling and Simulation, vol. 22, [110] S. Sivasubramani and K. Swarup, “‘Environmental/economic
no. 3, pp. 125–133, 2002. dispatch using multi-objective harmony search algorithm,”
[93] Z. W. Geem, “‘‘Harmony search in water pump switching Electric Power Systems Research, vol. 81, no. 9, pp. 1778–1785,
problem,” International Journal of Modelling and Simulation, 2011.
vol. 3612, pp. 751–760, 2005. [111] J. Park, K.-H. Lee, J. Park, H. Choi, and I.-M. Lee, “‘‘Pre-
[94] Z. W. Geem, “‘‘Hydraulic analysis of water distribution dicting anomalous zone ahead of tunnel face utilizing
network using harmony search,” International Journal of electrical resistivity: I. Algorithm and measuring system
Modelling and Simulation, vol. 2009, pp. 1–9, 2009. development,” Tunnelling Underground Space Technology,
[95] Z. W. Geem, “‘‘Optimal scheduling of multiple dam system vol. 60, pp. 141–150, 2016.
using harmony search algorithm,” International Journal of [112] M. Navarro, J. M. Corchado, and Y. Demazeau, “Modeling a
Modelling and Simulation, vol. 4507, pp. 316–323, 2007. harmonic composition system with virtual organizations to
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
20 Mathematical Problems in Engineering

assist novice composers,” Expert Systems with Applications, harmony search, K-means, frequent term sets and Bayesian
vol. 57, pp. 345–355, 2016. information criterion,” IEEE, vol. 2, pp. 1–8, 2010.
[113] K. Nekooei, M. M. Farsangi, H. Nezamabadi-Pour, and [128] R. Forsati, M. Meybodi, M. Mahdavi, and A. Neiat, “‘‘Hy-
K. Y. Lee, “An improved multi-objective harmony search for bridization of K-means and harmony search methods for
optimal placement of DGs in distribution systems,” IEEE Web page clustering,” IEEE, vol. 1, pp. 329–335, 2008.
Transactions Smart Grid, vol. 4, no. 1, pp. 557–567, 2013. [129] L. A. Abualigah, A. Diabat, and Z. W. Geem, “A compre-
[114] P. Yadav, R. Kumar, S. K. Panda, and C. S. Chang, “‘‘An hensive survey of the harmony search algorithm in clustering
improved harmony search algorithm for optimal scheduling applications,,” Applied Sciences (Switzerland), vol. 10, no. 11,
of the diesel generators in oil rig platforms,” Energy Con- 2020.
version and Management, vol. 52, no. 2, pp. 893–902, 2011. [130] V. Kumar, J. K. Chhabra, and D. Kumar, “Automatic data
[115] S. Ngonkham and P. Buasri, “‘‘Harmony search algorithm to clustering using parameter adaptive harmony search algo-
improve cost reduction in power generation system inte- rithm and its application to image segmentation,” Journal of
grating large scale wind energy conversion system,” World Intelligent Systems, vol. 25, no. 4, 2016.
Non-Grid-Connected Wind Power Energy, vol. 2009, pp. 1–5, [131] O. M. Alia, R. Mandava, D. Ramachandram, and M. E. Aziz,
2009. “‘‘Harmony search-based cluster initialization for fuzzy
[116] Z. W. Geem, C.-L. Tseng, and Y. Park, “‘‘Harmony search for c-means segmentation of MR images,” IEEE Region, vol. 4,
generalized orienteering problem: best touring in China,” pp. 1–6, 2009.
Energy Conversion and Management, vol. 3612, pp. 741–750, [132] E. Shareghi and L. S. Hassanabadi, “‘‘Text summarization
2005. with harmony search algorithm-based sentence extraction,”
[117] G. Bo, M. Huang, W. H. Ip, and X. Wang, “‘‘e harmony Soft Computing, vol. 7, pp. 226–231, 2008.
search fourth routing optimization in fourth party logistics [133] M. Mendoza, C. Cobos, and E. León, “‘‘Extractive single-
with time windows,” in Proceedings of the IEEE Congress on document summarization based on global-best harmony
Evolutionary Computation 2011, pp. 962–967, CEC), New search and a greedy local optimizer,” Journal of Intelligent
Orleans, LA, USA, May 2009. Systems, vol. 25, pp. 52–66, 2015.
[118] M. Huang, G. Bo, X. Wang, and W. H. Ip, “‘‘e optimization [134] R. Forsati, A. Haghighat, and M. Mahdavi, “‘‘Harmony
of routing in fourth-party logistics with soft time windows search based algorithms for bandwidth-delay-constrained
using harmony search,” in Proceedings of the 6th Interna- least-cost multicast routing,” Computer Communications,
tional Conference on Natural Computation, pp. 4344–4348, vol. 31, no. 10, pp. 2505–2519, 2008.
Changsha, China, August 2010. [135] H. Karahan, G. Gurarslan, and Z. W. Geem, “‘‘Parameter
[119] E. T. Yassen, M. Ayob, M. Z. A. Nazri, and N. R. Sabar, estimation of the nonlinear Muskingum flood-routing model
“‘‘Meta-harmony search algorithm for the vehicle routing using a hybrid harmony search algorithm,” Journal of Hy-
problem with time windows,” Journal of Information Science, drologic Engineering, vol. 18, no. 3, pp. 352–360, 2012.
vol. 325, pp. 140–158, Dec. 2015. [136] B. Zeng and Y. Dong, “‘‘An improved harmony search based
[120] A. Alomoush, A. A. Alsewari, H. S. Alamri, and K. Z. Zamli, energy-efficient routing algorithm for wireless sensor net-
“‘‘Solving0/1 knapsack problem using hybrid HS and Jaya works,” Soft Computing, vol. 41, pp. 135–147, 2016.
algorithms,” Advanced Science Letters, vol. 24, no. 3, [137] D. Manjarres, J. Del Ser, S. Gil-Lopez, M. Vecchio, I. Landa-
pp. 7486–7489, 2018. Torres, and R. Lopez-Valcarce, “A novel heuristic approach
[121] B. Zhang, Q.-K. Pan, X.-L. Zhang, and P.-Y. Duan, “‘‘An for distance and connectivity-based multi hop node locali-
effective hybrid harmony search-based algorithm for solving zation in wireless sensor networks,” Soft Computing, vol. 17,
multidimensional knapsack problems,” Applied Soft Com- pp. 17–28, 2013.
puting, vol. 29, pp. 288–297, 2015. [138] D. Manjarres, J. Del Ser, S. Gil-Lopez et al., “e design of a
[122] M. Fesanghary, M. Mahdavi, M. Minary-Jolandan, and novel two-objective harmony search approach for distance-
Y. Alizadeh, “‘‘Hybridizing harmony search algorithm with and connectivity-based localization in wireless sensor net-
sequential quadratic programming for engineering optimi- works,” Engineering Applications of Artificial Intelligence,
zation problems,” vol. 197, no. 3, pp. 3080–3091, 2008. vol. 26, no. 2, pp. 669–676, 2013.
[123] M. Nawaz, E. E. Enscore, and I. Ham, “‘‘A heuristic algo- [139] I. Landa-Torres, S. Gil-Lopez, J. DelSer, S. Salcedo-Sanz,
rithm for them-machine, n-job flow-shop sequencing D. Manjarres, and J. A. Portilla-Figueras, “Efficient citywide
problem,” Omega, vol. 11, no. 3, pp. 91–95, 1983. planning of open wifi access networks using novel grouping
[124] Y. Y. Moon, Z. W. Geem, and G.-T. Han, “‘‘Vanishing point harmony search heuristics,” Engineering Applications of
detection for self-driving car using harmony search algo- Artificial Intelligence, vol. 26, no. 3, pp. 1124–1130, 2013.
rithm,” Swarm and Evolutionary Computation, vol. 41, [140] J. Fourie, S. Mills, and R. Green, “‘‘Harmony filter: a robust
pp. 111–119, 2018. visual tracking system using the improved harmony search
[125] R. Mikaeil, S. S. Haghshenas, Y. Shirvand, M. V. Hasanluy, algorithm,” Image and Vision Computing, vol. 28, no. 3,
and V. Roshanaei, “‘‘Risk assessment of geological hazards in pp. 1702–1716, 2010.
a tunneling project using harmony search algorithm (case [141] E. Yazdi, “Evolution of biped walking using neural oscillators
study: Ardabil-Mianeh railway tunnel),” Civil Engineering controller and harmony search algorithm optimizer,” 2010,
Journal, vol. 2, no. 10, pp. 546–554, 2016. http://arxiv.org/abs/1006.4553.
[126] R. Forsati, M. Mahdavi, M. Kangavari, and B. Safarkhani, [142] Y. A. Z. A. Alkareem, I. Venkat, M. A. Al-Betar, and
“‘‘Web page clustering using harmony search optimization,” A. T. Khader, “Edge preserving image enhancement via
Swarm and Evolutionary Computation, vol. 2008, pp. 1601– harmony search algorithm,” Data Mining and Optimization,
1604, 2008. vol. 3, 2012.
[127] C. Cobos, J. Andrade, W. Constain, M. Mendoza, and [143] S. Ghosh, P. Shivakumara, P. Roy, U. Pal, and T. Lu,
E. León, “‘‘Web document clustering based on global-best “Graphology based handwritten character analysis for
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
Mathematical Problems in Engineering 21

human behaviour identification,” CAAI Transactions on [160] S. Gil-Lopez, J. Del Ser, S. Salcedo-Sanz, A. M. Perez-Bellido,
Intelligence, vol. 5, no. 1, pp. 55–65, 2020. J. M. Cabero, and J. A. Portilla-Figueras, “A hybrid harmony
[144] D. Oliva, E. Cuevas, G. Pajares, D. Zaldivar, and M. Perez- search algorithm for the spread spectrum radar polyphase
Cisneros, “Multilevel thresholding segmentation based on codes design problem,” Expert Systems with Applications,
harmony search optimization,” Journal of Applied Mathe- vol. 39, no. 12, pp. 11089–11093, 2012.
matics, vol. 2013, 2013. [161] F. Harrou and A. Zeblah, An Efficient Harmony Search
[145] A. R. A. Alsewari and K. Z. Zamli, “‘‘A harmony search based Optimization for Maintenance Planning to the Telecommu-
pairwise sampling strategy for combinatorial testing,” In- nication Systems, Intechopen, Rijeka, Croatia, 2011.
ternational Journal of Physical Sciences, vol. 7, no. 7, [162] A. M. Mohsen, A. T. Khader, and D. Ramachandram,
pp. 1062–1072, 2012. “‘‘Hsrnafold:A harmony search algorithm for rna secondary
[146] A. R. A. Alsewari and K. Z. Zamli, “‘‘Design and imple- structure prediction based on minimum free energy,”
mentation of a harmony-search-based variable-strength Journal of Materials Processing Technology, vol. 17, pp. 11–15,
t-way testing strategy with constraints support,” Information 2008.
and Software Technology, vol. 54, no. 6, pp. 553–568, 2012. [163] A. M. Mohsen, A. T. Khader, and A. Ghallab, “‘‘e effect of
[147] A. A. Alsewari and K. Z. Zamli, “‘‘Interaction test data using different thermodynamic models with harmony search
generation using harmony search algorithm,” International algorithm in the accuracy of RNA secondary structure
Journal of Physical Sciences, vol. 2011, pp. 559–564, 2011. prediction,” Journal of Materials Processing Technology,
[148] C. Mao, “‘‘Harmony search-based test data generation for vol. 43, pp. 505–510, 2009.
branch coverage in software structural testing,” Neural [164] J. Amor, E. Alexandre, R. Gil, L. Álvarez, and E. Huerta,
Computing and Applications, vol. 25, no. 1, pp. 199–216, “‘‘Music-inspired harmony search algorithm applied to
2014. feature selection for sound classification in hearing AIDS,”
[149] S. A. Abed, S. Tiun, and N. Omar, “‘‘Harmony search al- PLoS Computer Biology, vol. 9, p. 124, 2008.
gorithm for word sense disambiguation,” ’PLoS One, vol. 10, [165] K. S. Hickmann, “‘‘Forecasting the 2013-2014 influenza
no. 9, Article ID e0136614, 2015. season using Wikipedia,” PLoS Computer Biology, vol. 11,
[150] J. Kang, S. Kwon, D. Ryu, and J. Baik, Harmony Search-Based no. 5, Article ID e1004239, 2015.
Parameter Optimization for Just-In-Time Software Defect [166] S. Tuo, J. Zhang, X. Yuan, Z. He, Y. Liu, and Z. Liu, “‘‘Niche
Prediction in the Maritime Software, MDPI, Basel, Switzer- harmony search algorithm for detecting complex disease
land, 2020. associated high-order SNP combinations,” Science Report,
[151] Z. W. Geem, “Application of Harmony Search to Multi- vol. 7, no. 1, 2017.
Objective Optimization for Satellite Heat Pipe Design,” in [167] S. Taghipour, P. Zarrineh, M. Ganjtabesh, and A. Nowzari-
Proceedings of the US-Korea Conference, pp. 1–3, New Jersey, Dalini, “‘‘Improving protein complex prediction by recon-
NJ, USA. structing a high-confidence protein-protein interaction
[152] M. Fesanghary, E. Damangir, and I. Soleimani, “‘‘Design network of Escherichia coli from different physical interac-
optimization of shell and tube heat exchangers using global tion data sources,” BMC Bioinformatics, vol. 18, no. 1, p. 10,
sensitivity analysis and harmony search algorithm,” Applied 2017.
+ermal Engineering, vol. 29, no. 5–6, pp. 1026–1031, 2009. [168] J. Dongardive, A. Patil, A. Bir, S. Jamkhedkar, and
[153] B. Majidi, H. R. Baghaee, G. B. Gharehpetian, S. Abraham, “‘‘Finding motifs using harmony search,” BMC
J. Milimonfared, and M. Mirsalim, “‘‘Harmonic optimization Bioinformatics, vol. 143, p. 41, 2010.
in multi-level inverters using harmony search algorithm,” [169] A. Panchal, “‘‘Harmony search in therapeutic medical
Power Energy, vol. 2008, pp. 646–650, 2008. physics,” in Music-Inspired Harmony Search Algorithm,
[154] Z. W. Geem and Y. Yoon, “‘‘Harmony search optimization of pp. 189–203, Springer, Berlin, Germany, 2009.
renewable energy charging with energy storage system,” [170] A. Panchal and B. Tom, “Harmony search optimization for
Power Energy System, vol. 86, pp. 120–126, 2017. HDR prostate brachytherapy,” International Journal of Ra-
[155] O. Zarei, M. Fesanghary, B. Farshi, R. Jalili Saffar, and diation Oncology, Biology, Physics, vol. 75, no. 3, 2009.
M. R. Razfar, “‘‘Optimization of multi-pass face-milling via [171] T. K. Gandhi, P. Chakraborty, G. G. Roy, and B. K. Panigrahi,
harmony search algorithm,” Journal of Materials Processing “Discrete harmony search based expert model for epileptic
Technology, vol. 209, no. 3, pp. 2386–2392, 2009. seizure detection in electroencephalography,” Expert Systems
[156] H. Dong, Y. Bo, M. Gao, and T. Zhu, “‘‘Improved harmony with Applications, vol. 39, no. 4, pp. 4055–4062, 2012.
search for detection with photon density wave,” Photoelec- [172] P. Brucker, R. Qu, and E. Burke, “Personnel scheduling:
tron Detection Imaging, vol. 29, Article ID 662523, 2007. models and complexity,” European Journal of Operational
[157] R. Zhang and L. Hanzo, “‘‘Iterative multiuser detection and Research, vol. 210, no. 3, pp. 467–473, 2011.
channel decoding for DS-CDMA using harmony search,” [173] M. Hadwan, M. Ayob, N. R. Sabar, and R. Qu, “A harmony
IEEE Signal Processing Letters, vol. 16, no. 10, pp. 917–920, search algorithm for nurse rostering problems,” Info. Sci-
2009. ences, vol. 233, pp. 126–140, 2013.
[158] J. D. Ser, M. N. Bilbao, S. Gil-Lopez, M. Matinmikko, and [174] B. Gupta, M. Tiwari, and S. S. Lamba, “Visibility improve-
S. Salcedo-Sanz, “Iterative power and subcarrier allocation in ment and mass segmentation of mammogram images using
rate-constrained OFDMA downlink systems based on har- quantile separated histogram equalisation with local contrast
mony search heuristics,” Engineering Applications of Arti- enhancement,” Chinese Association for Artificial Intelligence,
ficial Intelligence, vol. 24, no. 5, pp. 748–756, 2011. vol. 4, no. 2, pp. 73–79, 2019.
[159] J. D. Ser, M. Matinmikko, S. Gil-Lopez, and M. Mustonen, [175] J. A. Pacheco and S. Casado, “Solving two location models
“Centralized and distributed spectrum channel assignment with few facilities by using a hybrid heuristic: a real health
in cognitive wireless networks: a harmony search approach,” resources case,” Computers & Operations Research, vol. 32,
Applied Soft Computing, vol. 12, no. 2, pp. 921–930, 2012. no. 12, pp. 3075–3091, 2005.
 2629, 2021, 1, Downloaded from https://onlinelibrary.wiley.com/doi/10.1155/2021/5594267 by Cochrane Philippines, Wiley Online Library on [30/09/2024]. See the Terms and Conditions (https://onlinelibrary.wiley.com/terms-and-conditions) on Wiley Online Library for rules of use; OA articles are governed by the applicable Creative Commons License
22 Mathematical Problems in Engineering

[176] T. Wiens, “Engine speed reduction for hydraulic machinery

using predictive algorithms,” International Journal of
Hydromech, vol. 2, no. 1, pp. 16–31, 2019.
[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.
[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.
[179] J. H. Kim, Z. W. Geem, and E. S. Kim, “‘‘Parameter esti-
mation of the nonlinear Muskingum model using harmony
search,” JAWRA Journal of the American Water Resources
Association, vol. 37, no. 3, pp. 1131–1138, 2001.
[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.
[181] N. Yusup, A. M. Zain, and A. A. Latib, “A review of Harmony
Search algorithm-based feature selection method for clas-
sification,” International Journal of Industrial Ergonomics,
vol. 192, Article ID 012028, 2019.
[182] I. Rahimi, B. Bakhtiari, K. Qaderi, and M. Aghababaie,
“Calibration of Angstrom equation for estimating solar ra-
diation using meta-heuristic harmony search algorithm (case
study: mashhad-east of Iran),” Energy Procedia, vol. 18,
pp. 644–651, 2012.
[183] A. Sharma, R. Kumar, and P. K. Singh, “SLA constraint
quickest path problem for data transmission services in
capacitated networks,” International Journal of Perform-
ability Engineering, vol. 15, no. 4, pp. 1061–1072, 2019.
[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.
[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.
[186] E. Cuevas, N. Ortega-Sánchez, D. Zaldivar, and M. Pérez-
Cisneros, “‘‘Circle detection by harmony search optimiza-
tion,” Journal of Intelligent and Robotic Systems, vol. 66,
no. 3, pp. 359–376, 2012.