A hybrid DE algorithm with a multiple strategy for solving the terminal assignment problem

Abstract

In the last decades a large amount of interests have been focused on telecommunication network problems. One important problem in telecommunication networks is the terminal assignment problem. In this paper, we propose a Differential Evolution algorithm employing a "multiple" strategy to solve the Terminal Assignment problem. A set of available strategies is established initially. In each generation a strategy is selected based on the amount fitness improvements achieved over a number of previous generations. We use tournament selection for this purpose. Simulation results with the different methods implemented are compared. © Springer-Verlag Berlin Heidelberg 2010.