Algorithms for clustering data
Algorithms for clustering data
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Hierarchial concentrator location problem
Computer Communications
Hierarchical optimization: an introduction
Annals of Operations Research - Special issue on hierarchical optimization
Radio Network Planning and Optimisation for Umts
Radio Network Planning and Optimisation for Umts
Topological optimization of the large-scale data transmission networks
Automation and Remote Control
Lower and upper bounds for a two-level hierarchical location problem in computer networks
Computers and Operations Research
An ACO algorithm to design UMTS access network using divided and conquer technique
Engineering Applications of Artificial Intelligence
International Journal of Autonomous and Adaptive Communications Systems
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
| Hi-index | 0.01 |
This paper deals with the problem of cost-optimal hierarchical topology planning for telecommunications access networks. The generalized problem is computationally hard and only its substantially simplified variants have been studied before. We propose a heuristic algorithm relying on iterative problem decomposition, clustering methods and local optimization. The main idea of the approach is to combine clustering and local optimization operators and to apply the combined operators iteratively within the levels of the hierarchy. By an extensive empirical analysis it is shown that the presented method efficiently solves the underlying optimization problem for instances of practical size, furthermore, it is robust to handle flexibility in the problem statement and in the cost function.