الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 168 |  |  |
| | | from | 168 | | |
Abstract
University course timetabling problems (uctps) are well-known np hard combinatorial optimization problems. Because of the downsides of existing solution approaches in the literature , many researchers have proposed different evolutionary algorithms(eas)for handing them although eas are able to realize near-optimal soulations, they cannot guarantee optimality and , in fact,nosingle ea has reliably possessed the capacity to tackle awide range of problems