The proposed numerical solution ensures that in the case that the seed matrix is optimum no changes are made to the
matrix, as was the case in the formulation of Equation 13. In addition, the use of the seed matrix as a starting point for the
search algorithm ensures that the optimum solution resembles the seed matrix as closely as possible while minimizing
the link flow error. In other words, the seed matrix biases the solution towards the seed matrix.