37 Citations (Scopus)

Abstract

In real-world applications, the k-shortest-paths between a pair of nodes on a network will often be slight variations of one another. This could be a problem for many path-based models, particularly those on capacitated networks where different routing alternatives are needed that are less likely to encounter the same capacity constraints. This paper develops a method to solve for k differentiated paths that are relatively short and yet relatively different from one another but not necessarily disjoint. Our method utilizes the sum of a path's distance plus some fraction of its shared distance with each other path. A minimax algorithm is used to select the path whose largest sum of length, plus shared length vis-à-vis each previously selected path, is as small as possible. We present computational results for the Chinese railway system, comparing the paths generated by a standard k-shortest-path algorithm with those from our new model.

Original languageEnglish (US)
Pages (from-to)298-313
Number of pages16
JournalGeographical Analysis
Volume29
Issue number4
StatePublished - Oct 1997

Fingerprint

routing
railway
German Federal Railways
method

ASJC Scopus subject areas

  • Geography, Planning and Development

Cite this

A minimax method for finding the k best "differentiated" paths. / Kuby, Michael; Zhongyi, Xu; Xiaodong, Xie.

In: Geographical Analysis, Vol. 29, No. 4, 10.1997, p. 298-313.

Research output: Contribution to journalArticle

Kuby, M, Zhongyi, X & Xiaodong, X 1997, 'A minimax method for finding the k best "differentiated" paths', Geographical Analysis, vol. 29, no. 4, pp. 298-313.
Kuby, Michael ; Zhongyi, Xu ; Xiaodong, Xie. / A minimax method for finding the k best "differentiated" paths. In: Geographical Analysis. 1997 ; Vol. 29, No. 4. pp. 298-313.
@article{b0036c1acefd4005815538946e77cb31,
title = "A minimax method for finding the k best {"}differentiated{"} paths",
abstract = "In real-world applications, the k-shortest-paths between a pair of nodes on a network will often be slight variations of one another. This could be a problem for many path-based models, particularly those on capacitated networks where different routing alternatives are needed that are less likely to encounter the same capacity constraints. This paper develops a method to solve for k differentiated paths that are relatively short and yet relatively different from one another but not necessarily disjoint. Our method utilizes the sum of a path's distance plus some fraction of its shared distance with each other path. A minimax algorithm is used to select the path whose largest sum of length, plus shared length vis-{\`a}-vis each previously selected path, is as small as possible. We present computational results for the Chinese railway system, comparing the paths generated by a standard k-shortest-path algorithm with those from our new model.",
author = "Michael Kuby and Xu Zhongyi and Xie Xiaodong",
year = "1997",
month = "10",
language = "English (US)",
volume = "29",
pages = "298--313",
journal = "Geographical Analysis",
issn = "0016-7363",
publisher = "Wiley-Blackwell",
number = "4",

}

TY - JOUR

T1 - A minimax method for finding the k best "differentiated" paths

AU - Kuby, Michael

AU - Zhongyi, Xu

AU - Xiaodong, Xie

PY - 1997/10

Y1 - 1997/10

N2 - In real-world applications, the k-shortest-paths between a pair of nodes on a network will often be slight variations of one another. This could be a problem for many path-based models, particularly those on capacitated networks where different routing alternatives are needed that are less likely to encounter the same capacity constraints. This paper develops a method to solve for k differentiated paths that are relatively short and yet relatively different from one another but not necessarily disjoint. Our method utilizes the sum of a path's distance plus some fraction of its shared distance with each other path. A minimax algorithm is used to select the path whose largest sum of length, plus shared length vis-à-vis each previously selected path, is as small as possible. We present computational results for the Chinese railway system, comparing the paths generated by a standard k-shortest-path algorithm with those from our new model.

AB - In real-world applications, the k-shortest-paths between a pair of nodes on a network will often be slight variations of one another. This could be a problem for many path-based models, particularly those on capacitated networks where different routing alternatives are needed that are less likely to encounter the same capacity constraints. This paper develops a method to solve for k differentiated paths that are relatively short and yet relatively different from one another but not necessarily disjoint. Our method utilizes the sum of a path's distance plus some fraction of its shared distance with each other path. A minimax algorithm is used to select the path whose largest sum of length, plus shared length vis-à-vis each previously selected path, is as small as possible. We present computational results for the Chinese railway system, comparing the paths generated by a standard k-shortest-path algorithm with those from our new model.

UR - http://www.scopus.com/inward/record.url?scp=0031430841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031430841&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031430841

VL - 29

SP - 298

EP - 313

JO - Geographical Analysis

JF - Geographical Analysis

SN - 0016-7363

IS - 4

ER -