Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Terminal assignment in a communications network using genetic algorithms
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
A tabu search for the survivable fiber optic communication network design
Computers and Industrial Engineering
Heuristic algorithms for the terminal assignment problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Journal of Global Optimization
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Computers and Operations Research
A discrete particle swarm optimization algorithm for uncapacitated facility location problem
Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Computers and Industrial Engineering
Solving terminal allocation problem using simulated annealing arithmetic
WSEAS TRANSACTIONS on SYSTEMS
Evolutionary codings and operators for the terminal assignment problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Discrete differential evolution algorithm for solving the terminal assignment problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Solving ring loading problems using bio-inspired algorithms
Journal of Network and Computer Applications
Using the bees algorithm to assign terminals to concentrators
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Computers and Industrial Engineering
Efficient load balancing using the bees algorithm
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
A hybrid DE algorithm with a multiple strategy for solving the terminal assignment problem
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
Hi-index | 0.00 |
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.