Connecting Points to a Set of Line Segments in Infrastructure Design Problems
conference paper
Connecting points to the nearest point belonging to a set of lines is an interesting problem that arises in many practical problems, especially Infrastructure Design Problems. In this paper an algorithm is presented for this problem. This algorithm is based on enumeration. To test the performance we define and explain several heuristic approaches. The algorithms is then, in comparison to the other approaches, tested on a real application coming from the telecommunication sector: the planning of FttX.
TNO Identifier
536936
Source title
Proceedings of the 21th IEEE European Conference on Network and Optical Communications, Lisbon, Portugal, 1-3 June 2016
Pages
5 p.
Files
To receive the publication files, please send an e-mail request to TNO Repository.