Jittering: A Computationally Efficient Method for Generating Realistic Route Networks from Origin-Destination Data

Abstract

Origin-destination (OD) datasets are often represented as ‘desire lines’ between zone centroids. This paper presents a ‘jittering’ approach to pre-processing and conversion of OD data into geographic desire lines that (1) samples unique origin and destination locations for each OD pair, and (2) splits ‘large’ OD pairs into ‘sub-OD’ pairs. Reproducible findings show that route networks generated from jittered desire lines are more geographically diffuse than route networks generated from ‘unjittered’ (centroid based) desire lines. The approach, implemented in the open source Rust crate odjitter, is a computationally efficient and flexible way to simulate diffuse travel patterns from OD data. Further work is needed to validate the approach and to find optimal settings for sampling and disaggregation.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 12 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.