In this paper we present arithmetic real-coded variation operators tailored for time slot and turn optimization on TDMA-scheduled resources with evolutionary algorithms. Our operators implement a heuristic strategy to converge towards the solution space and are able to escape local minima. Furthermore, we explicitly separate the variation of the admitted loads and the turn-length in order to give the designer increased control over the optimization process. Experimental results show that our variation operators have advantages over string-coded binary variation operators which are frequently used to solve continuous optimization problems.
Citation:
Arne Hamann, Rolf Ernst, "TDMA Time Slot and Turn Optimization with Evolutionary Search Techniques," date, vol. 1, pp.312-317, Design, Automation and Test in Europe (DATE'05) Volume 1, 2005