Abstract
An application of genetic algorithms and simulated annealing to a class section scheduling problem is described. Included are a comparison of the two types of optimizing technologies, a discussion of the application domain, a description of how annealing can be used to optimize in the domain with annealing, and a description of new techniques used to optimize annealing algorithms or other numeric processes with a genetic algorithm. It is concluded that the procedures used for this application will generalize to similar domains.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 231-236 |
| Number of pages | 6 |
| ISBN (Print) | 0818607637 |
| State | Published - 1987 |
All Science Journal Classification (ASJC) codes
- General Engineering
Fingerprint
Dive into the research topics of 'SCHEDULE OPTIMIZATION WITH PROBABILISTIC SEARCH.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver