A carregar...
Publicação
Swarm optimisation algorithms applied to large balanced communication networks
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 1.55 MB | Adobe PDF |
Orientador(es)
Resumo(s)
In the last years, several combinatorial optimisation problems have arisen in the computer communications networking field. In many cases, for solving these problems it is necessary the use of metaheuristics. An important problem in communication networks is the Terminal Assignment Problem (TAP). Our goal is to minimise the link cost of large balanced communication networks. TAP is a NP-Hard problem. The intractability of this problem is the motivation for the pursuits of Swarm Intelligence (SI) algorithms that produce approximate, rather than exact, solutions. This paper makes a comparison among the effectiveness of three SI algorithms: Ant Colony Optimisation, Discrete Particle Swarm Optimisation and Artificial Bee Colony. We also compare the SI algorithms with several algorithms from literature. Simulation results verify the effectiveness of the proposed algorithms. The results show that SI algorithms provide good solutions in a better running time.
Descrição
Palavras-chave
Computer networks Terminal Assignment Problem Swarm Intelligence Ant Colony Optimisation Discrete Particle Swarm Optimisation Artificial Bee Colony
Contexto Educativo
Citação
Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega Rodríguez, Swarm optimisation algorithms applied to large balanced communication networks, Journal of Network and Computer Applications, Volume 36, Issue 1, 2013, Pages 504-522, ISSN 1084-8045, https://doi.org/10.1016/j.jnca.2012.04.005.
Editora
Elsevier