Hybrid Evolutionary Approaches to Terminal Assignment in Communications Networks

Evolutionary Swarm based algorithms to minimise the link cost in Communication Networks

“…Each concentrator is limited in the amount of traffic that it can accommodate. For that reason, each terminal must be assigned to one node of the set of concentrators, in such a way that any concentrator does not overstep its capacity [3][4][5].…”

“…TAP is a NP-hard optimisation problem [3][4][5] and to deal with its difficulty many researchers proposed in the last decades, several optimisation algorithms to solve TAP (see Section 3). Nowadays, we observe an increasing size and consequently an increasing complexity of communication networks, and for that reason finding an optimal solution for TAP continues to be a hard task.…”

“…Salcedo-Sanz et al [44] proposed to solve TAP with Groups Encoding. Yao et al [5] proposed Hybrid GAs and compared the concentrator and terminal-based representations. Bernardino et al [9] proposed a Hybrid GA (HGA) with a repair procedure and compared the HGA with the TS.…”

“…SI algorithms are also bio-inspired techniques involving the study of collective behaviour in decentralised given set of concentrators. TAP is a NP-hard combinatorial optimisation problem [3][4][5].…”

“…Several heuristics have been used to optimise TAP: Local Search (LS) methods [6][7][8][9], EAs [3][4][5][9][10][11][12][13][14][15][16][17][18], SI techniques [19,20], among others. Note however, that this paper presents the first attempt (to the authors' knowledge) to use evolutionary swarm based algorithms to optimise TAP.…”