Cuckoo search algorithm for constraint satisfaction and optimization

This paper presents new approach to apply population based Cuckoo search algorithm to a Constraint Satisfaction Problem (CSP). CSP is a powerful paradigm which includes many complex combinatorial optimization problems like scheduling, planning or configuration problems. These problems are defined by a set of variables and a set of constraints. We have considered a real world application Course Timetabling (CTT) problem which is a well-known Constraint Satisfaction Problem. CTT requires scheduling number of subjects, teachers and rooms to pre-specified time slots in order to satisfy several constraints. There are few hard constrains which must satisfy by the feasible solutions and then it will try to optimize the solution by satisfying maximum soft constraints. In this paper CTT problem is solved by Cuckoo search algorithm and compare with heuristic local search techniques Hill Climbing. Our approach for CTT problem is able to solve large problems quickly by returning a roster if it is feasible and the techniques are fundamentally more general than the specific problem studied here.