Maximizing CLTV from new fibre deployments at shortest route within an optimal budget
Given an undirected graph with non-negative edge weights and a subset of vertices, usually referred to as terminals, the Steiner tree problem in graphs requires a tree of minimum weight that contains all terminals.
Connecting OLTs to the FDTs can be viewed as a Steiner tree problem. Other known algorithms are super slow and their runtime scales exponentially in their input size.
This can be difficult because there are so many possibilities to try. The diagram below shows a few possible ways to connect four points. And these are just a few examples on a very small problem!
To first achieve a digital mapping of the road network, we:
Next we applied an Artificial Neural Network (ANN) supported random tree search algorithm (AlphaGo) to optimize the fibre cables routing layout.