Information Technology Reference
In-Depth Information
Table 2.
Algorithm-Innovation Matrix for Modified, Non-Hybrid HS Algorithms
Author's Algo-
r
ithm Name
Parameters
Operations
HM
Constraint Han-
dling
Termination Crite-
ria
Structural Changes
Reference
L
&
U
tightened
HS
x
x
City-inverting &
neighbouring-city-
going for TSP
-
-
-
-
[1]
at
/2 for
benchmark prob-
lem
MaxImp
Revised HS
(ReHS)
HMCR
PAR
are not fixed
&
-
-
-
-
-
[39, 40]
HS
-
-
-
Feasible solutions
only stored in HM
-
-
[4, 8, 9]
Harmony Anneal-
ing Algorithm
(HAA)
-
Random playing re-
placed by very fast
SA
-
-
-
-
[58, 59, 86]
HS
PAR
different for
-
-
-
-
-
[78]
m
= ±1,2,3
(
PAR
1
,
PAR
2
,
PAR
3
)
Modified HS
(MHS)
-
Special training of
elite harmonies; pro-
portionate selection
Identical harmonies in
HM replaced with
new harmonies
-
-
-
[45]
Search WWH ::
Custom Search