Similar to the constrained facility location problem, the passive optical network (PON) planning problem necessitates the search for a subset of deployed facilities (splitters) and their allocated demand points (optical network units) to minimise the overall deployment cost. A mixed integer linear programming formulation stemming from network flow optimisation is used to construct a heuristic based on limiting the total number of interconnecting paths when implementing fibre duct sharing. A disintegration heuristic is proposed based on the output of a centroid, density-based and a hybrid clustering algorithm to reduce the time complexity while ensuring close to optimal results. The proposed heuristics are then evaluated using a large real-world dataset, showing favourable performance.
Disclaimer: This journal is hosted by the Stellenbosch University Library and Information Service on request of the journal owner/editor. The Stellenbosch University Library and Information Service takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.