Improving network migration optimization utilizing memetic algorithms

In this paper we describe the basics of the network migration problem, as well as the solution of the problem using meta heuristics. The class of heuristics described and applied in this paper is called memetic algorithms. Those are explained and results regarding network migration are presented. To evaluate potential algorithm candidates a generic TSP has been implemented and tested. The mapping of the network migration problem to memetic algorithms and to the algorithm library GALib is explained as well. Our main goal is the optimization of network migration costs, by respecting increasing demands over the migration period, while device costs per bit are decreasing. The mapping of the specified problem to the heuristic variants is also of major interest.