Solving Time-Tabling Problems Using Evolutionary Algorithms and Heuristics Search

摘要: The university time-tabling problem deals with scheduling classes into available timeslots without violating any constraints of time, venue and personnel. This is considered to be complexity NP therefore takes a lot time solve manually. In this chapter, new approach these by using multi-layered-algorithm combining evolutionary algorithms heuristic search has been attempted. Instead considering all the equally in concurrent manner, different types are handled techniques separate layers. An algorithm first generates sequences classes, function then applied estimate cost (in terms number needed) satisfy constraints, which used rate its individuals. advantage giving results quite quickly. implementation on actual data obtained from large department very successful solving complicated problems. Indeed, it less than thirty seconds give multiple feasible solutions complex real-life vast space (around 10180 possibilities).