Overview of Applications and Developments in the Harmony Search Algorithm - Music-Inspired Harmony Search Algorithm: Theory and Applications - page 28

Table 2. ( continued )

U adjusted
for chaotic har-
monies

L &

Chaos HS Method
(three versions)

x x Chaotic harmony

generation via logistic
equation

- - - Multiple harmonies

generated per im-
provisation

[67]

Modified HS
Method

- HM considering and

random playing
modified

- If solution is in-

feasible, a new
solution is gener-
ated using a pen-
alty or correcting
strategy

- All solutions may be

pitch adjusted

[63]

U tightened
in final round of
iterations

L &

Modified Harmony
Method (MHM)

x x HM considering uses

biased selection

All solutions in HM
except best one are
replaced several times
during iterations

- Based on lack of

change in f and on
number of improvi-
sations

All solutions may be
pitch adjusted; multi-
ple harmonies gener-
ated per improvisation

[19, 69, 70]

Modified HS for
MCSP

- Random playing has

biased probability;
deterministic selec-
tion of land parcel
every 10 iterations if
species not already
covered

HM initialisation with
5× HMS random vec-
tors; at most two iden-
tical vectors allowed
in HM

- - New harmony genera-

tion may stop if the
maximum number of
parcels is reached

[17]

HS - Random playing re-

placed with non-

- - - - [64]