All ECSTATIC Materials
Document Type
Course Syllabus
Publication Date
Fall 2012
Abstract
Heuristic optimization algorithms are artificial intelligence search methods that can be used to find the optimal decisions for designing or managing a wide range of complex systems. This course describes a variety of (meta) heuristic search methods including simulated annealing, tabu search, genetic algorithms, genetic programming, dynamically dimensioned search, and multiobjective methods. Algorithms will be used to find values of discrete and/or continuous variables that optimize system performance or improve system reliability. Students can select application projects from a range of application areas. The advantages and disadvantages of heuristic search methods for both serial and parallel computation are discussed in comparison to other optimization algorithms. Course taught at Cornell University.
Recommended Citation
Shoemaker, Christine, "Heuristic Methods for Optimization - Cornell University" (2012). All ECSTATIC Materials. Paper 49.
https://digitalcommons.usu.edu/ecstatic_all/49