Patent ID: 8185655
Filing Date: 2012-05-22
Classification: G06F

Abstract:
1. A computer-implemented method of selecting a plurality of routes between two nodes in a telecommunications network from a set of possible routes between the two nodes such that a diversity amongst the plurality of routes is maximized, the method comprising executing computer-executable instructions in a computer system to perform the operations of: determining the set of possible routes between the two nodes in the telecommunications network; modeling a max-min diversity problem for selecting the plurality of routes from the set of possible routes such that a minimum diversity between the plurality of routes is maximized; applying a greedy randomized adaptive search procedure heuristic to the set of possible routes between the two nodes for a number of iterations to generate a set of feasible solutions to the max-min diversity problem; determining a best solution from the set of feasible solutions; applying a path relinking heuristic between a pair of solutions in the set of feasible solutions to generate a first candidate solution; determining if the first candidate solution is better than the best solution; upon determining that the first candidate solution is better than the best solution, replacing the best solution with the first candidate solution; designating the best solution as an approximate solution to the max-min diversity problem; and selecting the plurality of routes based on the approximate solution.