A Minimax Method for Finding the k Best “Differentiated” Paths

Kuby, Michael; Xu, Zhongyi; Xie, Xue‐Jun

doi:10.1111/j.1538-4632.1997.tb00966.x

Cited by 40 publications

(21 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In RSA-DSS, dissimilar routes are selected applying MinMax algorithm [26]. It is shown that Min-Max provides better capability in simultaneously considering length and dissimilarity of paths in comparison with other dissimilar routing algorithm.…”

Section: E Operational Problems In Rsa-dssmentioning

confidence: 99%

A Rule-Based Decision Support System in Intelligent Hazmat Transportation System

Asadi

Ghatee

2015

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

This paper develops a new rule-based decision support system (RB-DSS) to find the safest solutions for routing, scheduling, and assignment in Hazmat transportation management. To define the safe program in RB-DSS, the accident frequency and severity are estimated for different scenarios of transportation, and they are used to classify the scenarios by a new structure of decision tree (DT), which is proposed to select branching variables at the primary levels according to the experts' perception. The outputs of the DT are stated in the form of if-then rules trained by a multilayer perceptron neural network to generalize the safe programs for Hazmat transportation. To illustrate the performance of this approach, the UK road accident data set is used.

show abstract

Section: E Operational Problems In Rsa-dssmentioning

confidence: 99%

A Rule-Based Decision Support System in Intelligent Hazmat Transportation System

Asadi

Ghatee

2015

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

show abstract

“…Known effective methods for finding spatially dissimilar paths between two nodes in a transportation network include the Minimax method [34] and p-dispersion [35] but these heuristics suffer from a high computation cost which is undesirable for our setting where precomputation overhead for generating the K candidate routes must be kept small so that the system is able to register new continuous routing queries quickly.…”

Section: A K Candidate Pathsmentioning

confidence: 99%

A continuous query system for dynamic route planning

Malviya¹,

Madden²,

Bhattacharya

2011

2011 IEEE 27th International Conference on Data Engineering

View full text Add to dashboard Cite

Abstract-In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A simple approach to this problem would be to recompute the best path for all queries on arrival of every delay update. However, such a naive approach scales poorly when there are many users who have requested routes in the system. Instead, we propose two new classes of approximate techniques -K-paths and proximity measures to substantially speed up processing of the set of designated routes specified by continuous route planning queries in the face of incoming traffic delay updates. Our techniques work through a combination of precomputation of likely good paths and by avoiding complete recalculations on every delay update, instead only sending the user new routes when delays change significantly. Based on an experimental evaluation with 7,000 drives from real taxi cabs, we found that the routes delivered by our techniques are within 5% of the best shortest path and have run times an order of magnitude or less compared to a naive approach.

show abstract

“…While the underlying strategies for selection of the observed paths may not be known, comparison of the spatial forms of the paths may yield insights toward those strategies and behaviors. One approach to characterizing the spatial correspondence among paths is to determine the extent to which the arcs and nodes in both paths are shared or exactly correspond with one another (Huber ; Kuby, Zhongyi, and Xiaodong ; Akgun, Erkut, and Batta ). On one hand, two paths connecting a pair of nodes have an exact correspondence if they share the same ordered set of arcs and nodes.…”

Section: Introductionmentioning

confidence: 99%

Measuring Spatial Correspondence among Network Paths

Matisziw

Demir

2015

Geographical Analysis

View full text Add to dashboard Cite

Measuring the spatial correspondence among geographic features is an important component of many analyses such as those seeking to identify similar or dissimilar features, explore the extent to which change has taken place, and explain the processes influencing spatial change. In networked systems, the paths providing connectivity between pairs of nodes are often the geographic features among which spatial correspondence is to be assessed. That is, given a set of paths between a pair of nodes, the extent to which they share portions of the network and spatially deviate from one another can provide insight on the factors underlying the use of a system. While methods for measuring the spatial correspondence among specific types of network paths have been devised, this article proposes a methodology for measuring the spatial correspondence among the topology of network paths of any type, including those involving redundant use of network space. By basing comparisons upon the topologic relationships among the paths, the proposed approach better accounts for average spatial deviation as well as the asymmetric spatial relationship between pairs of paths, enabling greater stability and consistency in the analysis of their spatial characteristics. The developed methodology is applied to evaluate variability in spatial correspondence among a set of network paths to demonstrate its utility.

show abstract

A Minimax Method for Finding the k Best “Differentiated” Paths

Cited by 40 publications

References 32 publications

A Rule-Based Decision Support System in Intelligent Hazmat Transportation System

A Rule-Based Decision Support System in Intelligent Hazmat Transportation System

A continuous query system for dynamic route planning

Measuring Spatial Correspondence among Network Paths

Contact Info

Product

Resources

About