A Framework for Alternation of Meta-Heuristic Algorithms

This work presents a new approach based on the alternation of meta-heuristic algorithms solving the problems of combinatorial optimization. In accordance with the described proposal, a framework realizing the alternation have been designed and implemented. The functionality of the framework and the validity of implemented problems have been proved. It has been turned out that proposed approach improves the convergence and the quality of found solutions in many cases. The main advantage of the framework is good scalability and extensibility for other algorithms and problems as well.