Loading course details…
Loading course details…
Binghamton University · UGRD

This course is a survey of the newer, most common adaptive search methods. This is a project- and research-oriented course designed to give graduate students a foundation from which to explore areas of their own interest. Focused topics include simulated annealing, genetic algorithms, evolution strategies, tabu search, ant colony methods, and particle swarm optimization. Other search methods such as genetic programming, evolutionary programming and random search methods will be briefly covered. Major emphasis is on NP complete combinatorial problems found in engineering. Issues such as solution encodings, stochastic convergence, selection methods, local and global search methods are discussed. Prerequisite: SSIE 505 or equivalent, SSIE 520, and knowledge of at least one programming language. Offered in the Fall semester. 3 cred Levels: Graduate
Fall 2026 · 3 sections
Aug 18 – Dec 8
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 01Class #12134 | Fr · 8:15 – 11:15 AM | Engineering Building G22 | Not published |
| 20Class #12140 |
| Distance Learning N/A |
| Not published |
| 30Class #35404 | Time not published | Distance Learning N/A | Not published |
|---|