Abstract
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 meta-heuristics. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
