SciELO - Scientific Electronic Library Online

 
vol.29 issue3A systematic review of 3PLs' entry into reverse logisticsEvaluating the suitability of Alumide® tooling for injection moulding of different polymers author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • On index processSimilars in Google

Share


South African Journal of Industrial Engineering

On-line version ISSN 2224-7890
Print version ISSN 1012-277X

Abstract

LUIES, R.; TERBLANCHE, S.E.  and  GROBLER, M.J.. Warm-start heuristics for solving the passive optical network planning problem. S. Afr. J. Ind. Eng. [online]. 2018, vol.29, n.3, pp.261-270. ISSN 2224-7890.  http://dx.doi.org/10.7166/29-3-2065.

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.

        · abstract in Afrikaans     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License