Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Topological Design of Two-Level Telecommunication Networks with Modular Switches
Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Cost-optimal topology planning of hierarchical access networks
Computers and Operations Research
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
CISIM '07 Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications
An Approach for Web Services Composition Based on QoS and Discrete Particle Swarm Optimization
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02
An Improved Discrete Particle Swarm Optimization Algorithm for TSP
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
Topology Design of Hierarchical Hybrid Fiber-VDSL Access Networks with ACO
AICT '08 Proceedings of the 2008 Fourth Advanced International Conference on Telecommunications
Survivable Topology Design of Hybrid Fiber-VDSL Access Networks with a Novel Metaheuristic
AICT '09 Proceedings of the 2009 Fifth Advanced International Conference on Telecommunications
| Hi-index | 0.00 |
As one of the most efficient access solutions, VDSL technology is becoming a highlight in the next generation fixed access networks. This paper addresses the topology design of hierarchical hybrid fibre-VDSL access networks, which is verified as an NP-hard problem. An effective strategy with two binary models is proposed to find a cost-effective and survivable network topology with adaptive metaheuristic-based algorithms in a short time. An enhanced discrete binary particle swarm optimisation (DBPSO) is developed and successfully implemented for this network planning problem, both for clustering and positioning. In terms of numerical results, the performance of the enhanced DBPSO is compared with some related approaches to simulated annealing, tabu search, genetic algorithms, ant colony optimisation and Yin Yang optimisation.