Print Email Facebook Twitter Comparison of Heuristic Methods for the Design of Edge Disjoint Circuits Title Comparison of Heuristic Methods for the Design of Edge Disjoint Circuits Author Phillipson, F. Publication year 2015 Abstract In this paper heuristics are studied for the design of edge disjoint circuits. We formulate the Edge Disjoint Circuits Problem (EDCP) in the context of a telecommunication network design problem: the roll-out of Fibre to the Cabinet. This problem setting can be represented by a graph. A small subset of the vertices are cabinets and one vertex is the central office. The objective is to minimize the sum of the circuit costs to connect all street cabinets to the central office, while satisfying capacity restrictions and edge disjointness within each circuit. In the studied graphs inexpensive paths are present with available ducts, which complicate the analysis considerably. The problem is NP-hard, so an insertion heuristic is developed. After the construction of an initial solution, local search is used to improve the solution. Finally, the performance of the insertion heuristic is compared to a cluster first - route second heuristic. The insertion heuristic clearly shows better performance for almost all types of instances that were studied while taking just a bit more time Subject ICTPNS - Performance of Networks & ServicesTS - Technical SciencesInfrastructuresTelecommunicationInformation SocietyTelecommunicationsOperations researchOptical Fibre NetworksNetwork DesignEdge Disjoint CircuitsCombinatorial OptimizationFiber to the cabinet (FttCab) To reference this document use: http://resolver.tudelft.nl/uuid:644a5b2f-6edc-428d-9aca-54d22233eec7 DOI https://doi.org/10.1016/j.comcom.2015.01.001 TNO identifier 521399 Source Computer Communications, XX, XX Bibliographical note Published online: 13 January 2015 (accepted manuscript) Document type article Files To receive the publication files, please send an e-mail request to TNO Library.