CEE 5290 - Heuristic Methods for Optimization

(crosslisted) CS 5722, ORIE 5340

Fall. 3-4 credits, variable.

Prerequisites: CS 2110/ENGRD 2110; ENGRD 3200 or permission of instructor. Enrollment limited to: graduate standing.

C. A. Shoemaker.

Teaches heuristic search methods including simulated annealing, tabu search, genetic algorithms, derandomized evolution strategy, and random walk developed for optimization of combinatorial- and continuous-variable problems. Application project options include wireless networks, protein folding, job shop scheduling, partial differential equations, satisfiability, or independent projects. Statistical methods are presented for comparing algorithm results. Advantages and disadvantages of heuristic search methods for both serial and parallel computation are discussed in comparison with other optimization algorithms.