On metaheuristic algorithms for combinatorial optimization problems
On Metaheuristic Algorithms for Combinatorial Optimization
Problems
Mutsunori Yagiura and Toshihide Ibaraki
Graduate School of Informatics, Kyoto University, Kyoto, 606-8501 Japan
SUMMARY
Metaheuristic algorithms are widely recognized as
one of the most practical approaches for combinatorial
optimization problems. Among representative metaheuris-
tics are genetic algorithms, simulated annealing, tabu
search, and so on. I
