Warm-start heuristics for solving the passive optical network planning problem

Abstract

The use of automated network planning systems is crucial for reducing the deployment cost and planning time of passive optical telecommunication networks. Mixed integer linear programming is well suited for the purpose of modelling passive optical networks; however, excessive computing times for solving large-scale problem instances render these approaches impractical. In this paper, an arc-based, a path-based, and a composite integer linear programming formulation of the passive optical network planning problem are considered. A reduction in computing times and peak memory usage is obtained by applying multiple heuristics as warm-starts to these problem formulations. Finally, the computational results presented in this paper are based on real-world Geographic Information System data — more specifically, a neighbourhood in Potchefstroom, South Africa

Die gebruik van geoutomatiseerde netwerkbeplanningstelsels is noodsaaklik om die ontplooiingskostes en beplanningstyd van passiewe optiese telekommunikasienetwerke te verminder. Alhoewel gemengde heeltallige lineêre programmering benaderings geskik is vir die modellering van passiewe optiese netwerke, die rekenaarvereistes ten opsigte van verwerkingstyd veroorsaak dat hierdie benaderings onprakties is. In hierdie artikel word ʼn skakelgebaseerde, ʼn padgebaseerde en ʼn saamgestelde lineêre programmering benadering voorgestel. Die resultate toon dat ʼn verbetering in verwerkingstyd asook geheue gebruik is moontlik deur die gebruik van heuristiek wat begin oplossings genereer vir die voorgestelde probleem formulerings. Die resultate in hierdie artikel is gebaseer op werklike Geografiese Inligtingstelsel data, spesifiek data van ʼn woonbuurt in Potchefstroom, Suid-Afrika