Texas State University
This course covers heuristic methods that search beyond local optima such as simulated annealing, tabu search, genetic algorithms, ant-colony systems and particle swarm. Papers from the literature, problem-specific heuristics, evaluation methods, and implementations are discussed.
3 credits
IE 5347