a new adjustment of the branch and price algorithm for university course timetabling

In 2005 avella and vasil’ev [2] presented an efficient cutting plane algorithm for solving an integer binary programming formulation of the university course timetabling problem (uctp). here, we present a new and efficient adjustment of the branch and price algorithm for solving the same formulation of uctp. in every iteration of the branch and price algorithm, the column generation algorithm is used for solving the linear programming relaxation. for the first time, in this paper the set packing constraints of the uctp formulation are chosen as the specially structured constraints of the column generation algorithm. then, a new efficient two phase heuristic method is presented for solving the set packing problem. the resulting adjusted column generation is used within a branch and price algorithm and a comparison is performed with the cutting plane algorithm presented by avella and vasil’ev. the numerical results show that the computing time of the presented branch and price algorithm is always less than that of branch and cut algorithm. moreover, the number of subproblems and master problems of the presented branch and price algorithm depends on the structure of the problem. finally, for all test instances the number of variables is very large that justifies the use of the branch and price algorithm for solving the problem.