A Java library for Constraint-Based Local Search: Application to the master thesis defense timetabling problem

Constraint-Based Local Search (CBLS) is an architecture for local search that uses constraints and objectives to control the local search. CBLS has many advantages in designing and implementing local search programs such as compositionality, modularity and reusability. We implement in this paper a Java library for CBLS. The implemented library will then be applied to the resolution of a combinatorial optimization problem arising in the education management in most of Vietnamese universities: the master thesis defense timetabling problem. Experimental results show the modelling flexibility and the efficiency of the constructed library. Our constructed library will be released as open source.