Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475852 | Computers & Operations Research | 2009 | 7 Pages |
Abstract
In this paper we introduce a method to compute non-dominated bicriteria shortest pairs, each including two disjoint simple paths. The method is based on an algorithm for ranking pairs of disjoint simple paths by non-decreasing order of cost, that is an adaptation of a path ranking algorithm applied to a network obtained from the original one after a suitable modification of the topology. Each path in this new network corresponds to a pair of paths in the former one. Computational results are presented and analysed for randomly generated networks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
João C.N. Clímaco, Marta M.B. Pascoal,