Heuristic approach to the passive optical network with fibre duct sharing planning problem

Loggerenberg, SP van; Grobler, Magdalena J.; Terblanché, S.E.

doi:10.5784/31-2-532

Cited by 3 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A heuristic, based on a network flow formulation and presented by Van Loggerenberg, Grobler and Terblanche [5], constructs feasible solutions by limiting the number of paths to improve fibre duct sharing. A disintegration heuristic is proposed [6] in an attempt to reduce computing times by using the output of a centroid, a density-based, and a hybrid clustering algorithm. The computational results are favourable for large problem instances.…”

Section: Related Workmentioning

confidence: 99%

Warm-Start Heuristics for Solving the Passive Optical Network Planning Problem

Luies

Terblanché

Grobler

2018

SAJIE

View full text Add to dashboard Cite

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 warmstarts 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. OPSOMMING 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 ŉ skakelgebaseerde, ŉ padgebaseerde en ŉ saamgestelde lineêre programmering benadering voorgestel. Die resultate toon dat ŉ 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 ŉ woonbuurt in Potchefstroom, Suid-Afrika.

show abstract

Section: Related Workmentioning

confidence: 99%

Warm-Start Heuristics for Solving the Passive Optical Network Planning Problem

Luies

Terblanché

Grobler

2018

SAJIE

View full text Add to dashboard Cite

show abstract

“…Cable installation cost optimization is not considered in the paper. In [4]- [7], the cable installation cost optimization issues are considered. However, the authors have limited the research scope to the problem of selection of the best cable routes from among the predefined ones.…”

Section: Related Workmentioning

confidence: 99%

FTTH Network Optimization

2014

JTIT

View full text Add to dashboard Cite

Fiber To The Home (FTTH) is the most ambitious among optical technologies applied in the access segment of telecommunications networks. The main issues of deploying FTTH are the device price and the installation cost. Whilst the costs of optical devices are gradually decreasing, the cost of optical cable installation remains challenging. In this paper, the problem of optimization that has practical application for FTTH networks is presented. Because the problem is Non-deterministic polynomial-time hard (NP-hard), an approximation algorithm to solve it is proposed. The author has developed the algorithm in a C# program in order to analyze its performance. The analysis confirms that the algorithm gains near-optimal results with acceptable time consumption. Therefore, the algorithm to be applied in a network design tool for FTTH network planning is proposed.

show abstract