Finding non-dominated bicriteria shortest pairs of disjoint simple paths

Authors:
João C. N. Clímaco;Marta M. B. Pascoal
Affiliations:
Faculty of Economics, University of Coimbra, Avenida Dias da Silva, 165, 3004-512 Coimbra, Portugal and Instituto de Engenharia de Sistemas e Computadores - Coimbra, Rua Antero de Quental, 199, 30 ...;Instituto de Engenharia de Sistemas e Computadores - Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal and Department of Mathematics, University of Coimbra, Apartado 3008, 3001-454 C ...
Venue:
Computers and Operations Research
Year:
2009

Citing 2
Cited 1

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing

Risk approaches for delivering disaster relief supplies

OR Spectrum

Quantified Score

Hi-index	0.01

Visualization

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.