• Corpus ID: 219530670

Experiments on route choice set generation using a large GPS trajectory set

  title={Experiments on route choice set generation using a large GPS trajectory set},
  author={Rui Yao and Shlomo Bekhor},
  journal={arXiv: Physics and Society},
  • Rui Yao, S. Bekhor
  • Published 22 May 2020
  • Computer Science
  • arXiv: Physics and Society
Several route choice models developed in the literature were based on a relatively small number of observations. With the extensive use of tracking devices in recent surveys, there is a possibility to obtain insights with respect to the traveler's choice behavior. In this paper, different path generation algorithms are evaluated using a large GPS trajectory dataset. The dataset contains 6,000 observations from Tel-Aviv metropolitan area. An initial analysis is performed by generating a single… 

Figures and Tables from this paper

A variational autoencoder approach for choice set generation and implicit perception of alternatives in choice modeling



Evaluation of choice set generation algorithms for route choice models

A route choice data set collected in Boston is described and the ability of several different route generation algorithms to produce paths similar to those observed in the survey is analyzed.


This paper develops and tests innovative models of driver's route choice behavior. The approach taken in this paper is to define choice sets of "labelled" paths. The idea is to transform a large

Behavioral Analysis of Choice of Daily Route with Data from Global Positioning System

Analysis of a GPS-based database of 679 routes, collected by a personal probe system called the activity locator over a period of 2 weeks for a sample of 12 students from the University of Cagliari in Italy, indicates that higher levels of intraindividual variability are found for discretionary trips, whereasHigher levels of interindividual variability, as well as greater deviation from minimum-cost routes, are associated with work or study trips.

Do People Use the Shortest Path? An Empirical Test of Wardrop’s First Principle

It is found that current route choice set generation algorithms do not reveal the majority of paths that individuals took, and these findings may guide future efforts in building better route choice models.

Dynamic Choice Set Generation Based on Global Positioning System Trajectories and Stated Preference Data

A method that generated choice sets for commuters in the Munich, Germany, metropolitan area was explored. The method used Global Positioning System trajectories and interview data from 300 commuters

Calibrated Labeling Method for Generating Bicyclist Route Choice Sets Incorporating Unbiased Attribute Variation

Discrete choice model estimation requires specification of the alternatives considered for each observed choice. In route choice problems based on real-world travel observations, generally only the

Routing Policy Choice Set Generation in Stochastic Time-Dependent Networks

The comparison with a path choice set benchmark also suggests that a routing policy choice set could potentially provide better coverage and capture the adaptive nature of route choice.

Applying Branch-and-Bound Technique to Route Choice Set Generation

An algorithm to solve explicitly the path enumeration problem is proposed. This algorithm is based on the branch-and-bound technique and belongs to the class of deterministic methods along with

Hidden Markov map matching through noise and sparseness

A novel, principled map matching algorithm that uses a Hidden Markov Model (HMM) to find the most likely road route represented by a time-stamped sequence of latitude/longitude pairs, which elegantly accounts for measurement noise and the layout of the road network.