EasyLocal
EasyLocal is an object-oriented framework that can be used as a general tool for the development of local search algorithms in C++ and Java. The basic idea of EasyLocal is to capture the essential features of most local search metaheuristics, and their possible compositions. This allows the user to address the design and implementation issues of new heuristics in a more principled way. Furthermore, the framework can easily be customized by an expert user allowing the development of new metaheuristics, and its architecture fully supports the reuse of code.
- EasyLocal (new) project site The main site of the EasyLocal project
- Old EasyLocal project site The old site, no longer maintained
Educational Timetabling
The educational timetabling problem consists in scheduling a sequence of events (typically lectures or examinations) which involves teachers and students in a prefixed period of time, satisfying a set of constraints of various types. Constraints involve, among others, overlapping of events with common participants, capacity of rooms, and student and teacher workload.
- The Course Timetabling project site The new (2008) Curriculum-based Course Timetabling page The Generalized BAC problem site The Generalized Balanced Academic Curriculum problem page: contains a set of benchmark instances and results
TT-MAS: Multi-agent Distributed Timetabling
TT-MAS is a multi-agent system for distributed course timetabling. We consider the timetabling problem for a set of university departments, in which each department prepares the schedule according to private rules, constraints, and objectives, and relying on own resources. In order to share and/or exchange resources for mutual benefits the system allows the departments to negotiate on a common marketplace and making use of an artificial currency.
- TT-MAS project site Under construction