Hyperpath or Shortest Path: An Evaluation Method and a Case Study with GPS Probe Data
نویسندگان
چکیده
Because of travel time uncertainty in traffic networks, the shortest path determined with a priori information may consist of links for which there are long delays and the path may not be optimal. Adaptive routing would suggest more reliable guidance by providing alternative links for en-route switching in the case of traffic congestion and a risk-averse hyperpath particularly provides an alternative method of adaptive route guidance. To evaluate hyperpath routing in terms of behavioral reality, we propose a method based on the cosine similarity index that takes advantages of huge quantities of route choice data. As an empirical study, we use taxi GPS probe data collected for about four years in Tokyo and compare hyperpath routing with the popular shortest-path routing in terms of reality of driver behavior. The empirical results indicate that hyperpath routing is closer to the real route choice than shortest-path routing.
منابع مشابه
Auction Algorithms for Shortest Hyperpath Problems Auction Algorithms for Shortest Hyperpath Problems
The auction{reduction algorithm is a strongly polynomial version of the auction method for the shortest path problem. In this paper we extend the auction{reduction algorithm to diierent types of shortest hyperpath problems in directed hypergraphs. The results of preliminary computational experiences show that the auction{reduction method is comparable to other known methods for speciic classes ...
متن کاملCompact Representation of GPS Trajectories over Vectorial Road Networks
Many devices nowadays record traveling routes, of users, as sequences of GPS locations. With the growing popularity of smartphones, millions of such routes are generated each day, and many routes have to be stored locally on the device or transmitted to a remote database. It is, thus, essential to encode the sequences, to decrease the volume of the stored or transmitted data. In this paper we s...
متن کاملFinding the K shortest hyperpaths using reoptimization
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an ...
متن کاملBicriterion shortest hyperpaths in random time-dependent networks
In relevant application areas, such as transportation and telecommunications, there has recently been a growing focus on dynamic networks, where arc lengths are represented by time-dependent discrete random variables. In such networks, an optimal routing policy does not necessarily correspond to a path, but rather to an adaptive strategy. Finding an optimal strategy reduces to a shortest hyperp...
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کامل