Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
