Heuristic algorithms for the optimisation of telecommunication networks

The aim of this paper is to study the use of heuristic algorithms for the optimisation of telecommunication networks. In a geographical area a cross connection point (CCP) is given together with several distribution points (DP). There are certain connections allowed between the CCP and the DPs depending on given rules (constraints), which results in a potential telecommunication network for the considered geographical area. The optimisation problem is: "How can all subscribers be connected to the network by travelling from the CCP through all DPs with a minimum of costs for cables and underground rooms?"