Capitulo de libro
HEURISTICS FOR THE DESIGN OF BI-CONNECTED TELECOMMUNATION NETWORKS
Registro en:
1-56555-251-2
1010803
Institución
Resumen
We focus on the design of telecommunication networks with minimum cost. The cost is made up of two components: distance and route. Given a fixed node distribution, several heuristics are proposed to determine the optimal topology given a set of conditions or restrictions. The heuristics are compared among them and with a Travelling Salesman Problem (TSP) solution, by applying them to problems of different sizes and characteristics. All the proposed heuristics provide solutions with lower costs than the TSP solutions. The use of the proposed heuristics depends on the topology of the network and the weighting factors used to consider the costs.
We focus on the design of telecommunication networks with minimum cost. The cost is made up of two components: distance and route. Given a fixed node distribution, several heuristics are proposed to determine the optimal topology given a set of conditions or restrictions. The heuristics are compared among them and with a Travelling Salesman Problem (TSP) solution, by applying them to problems of different sizes and characteristics. All the proposed heuristics provide solutions with lower costs than the TSP solutions. The use of the proposed heuristics depends on the topology of the network and the weighting factors used to consider the costs.