Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481899 | European Journal of Operational Research | 2007 | 10 Pages |
Abstract
In transmission networks an important routing problem is to find a pair of link disjoint paths which optimises some performance measure. In this paper the problem of obtaining the most reliable pair of link disjoint paths, assuming the reliability of the links are known, is considered. This is a non-linear optimisation problem. It is further introduced the constraint that the length of the paths should not exceed a certain number of links, which makes the efficient resolution of the problem more complex.In this paper two variants of a novel exact algorithm for finding the most reliable pair of link disjoint paths with lengths constraints, are presented. Also a computational study on the performance of the variants, is described.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Teresa Gomes, José Craveirinha,