EasyLocal++ is a framework for modeling and solving combinatorial optimization problems through local search metaheuristics. The framework (currently at version 3.0) is entirely written in C++ (C++11) and makes broad use of template metaprogramming to achieve strong separation of concerns and performance. For instance, to solve a problem, it is sufficient to implement methods to compute the problem-specific cost function and to enumerate the problem-specific local search moves. The framework takes care of calling these hook methods to solve the problem using one of the implemented heuristics (e.g. simulated annealing, tabu search, hill climbing, ...).
The project is currently maintained by the SaTT (Scheduling and Time Tabling) group of the University of Udine.