A combinatorial heuristic algorithm supporting computer-aided planning of optical fiber networks

Abstract:
Infrastructure systems form the backbone of modern society. The increasing need for fast and reliable data exchange fosters the development of new high-speed optical fiber networks. However, building new infrastructure systems is very expensive; the building cost for optical fiber networks is determined by the cost for cabling and by the cost for trenching. Computer-aided planning aims to reduce the building cost by calculating the optimum paths for optical fiber networks. Common approaches towards computer-aided planning of optical fiber networks are based on the algorithms of Prim and Dijkstra. Each algorithm, as will be illustrated in this paper, is designed to address one single objective – i.e. one cost factor (cabling or trenching). Computer-aided planning, however, requires holistic algorithms taking into account all cost factors to achieve minimum total cost. This paper investigates the performance of a combinatorial heuristic algorithm for computer-aided planning of optical fiber networks. The algorithm is validated using digital map data of an existing residential area. In summary, the proposed approach, as compared to traditional approaches, results in reduced building cost for optical fiber networks. In this study, cost reductions up to 23% have been achieved.