A BRIEF SURVEY ON
HYBRID METAHEURISTICS:
The term metaheuristic was introduced to define heuristic methods
that can be applied to a wide set of different problems. In other words,
a metaheuristic can be seen as a general algorithmic fr a mework which
can be applied to different optimization problems with relatively few
modifications to make them adapted to a specific problem. Genetic and
evolutionary algorithms, tabu search, simulated annealing, iterated local
search, and ant colony optimization, just to name a few, are typical representatives
falling under this generic term. Each of them has an individual
historical background, follows certain paradigms and philosophies,
and puts one or more particular strategic concepts in the foreground.,A BRIEF SURVEY ON
HYBRID METAHEURISTICS:
The term metaheuristic was introduced to define heuristic methods
that can be applied to a wide set of different problems. In other words,
a metaheuristic can be seen as a general algorithmic fr a mework which
can be applied to different optimization problems with relatively few
modifications to make them adapted to a specific problem. Genetic and
evolutionary algorithms, tabu search, simulated annealing, iterated local
search, and ant colony optimization, just to name a few, are typical representatives
falling under this generic term. Each of them has an individual
historical background, follows certain paradigms and philosophies,
and puts one or more particular strategic concepts in the foreground.