A Large-scale Benchmark Dataset for Commuting Origin-destination Matrix Generation

TL;DR

This paper introduces a large-scale, diverse dataset of commuting origin-destination matrices across over 3,200 U.S. areas, enabling the development of more generalizable models and exploring graph-based approaches for OD matrix generation.

Contribution

It provides the first extensive dataset covering various area types and benchmarks multiple models, highlighting the effectiveness of graph-based methods for OD matrix generation.

Findings

Graph-based models outperform traditional approaches.

The dataset enables better generalization across diverse regions.

A new paradigm using attributed directed graphs shows promising results.

Abstract

The commuting origin-destination~(OD) matrix is a critical input for urban planning and transportation, providing crucial information about the population residing in one region and working in another within an interested area. Despite its importance, obtaining and updating the matrix is challenging due to high costs and privacy concerns. This has spurred research into generating commuting OD matrices for areas lacking historical data, utilizing readily available information via computational models. In this regard, existing research is primarily restricted to only a single or few large cities, preventing these models from being applied effectively in other areas with distinct characteristics, particularly in towns and rural areas where such data is urgently needed. To address this, we propose a large-scale dataset comprising commuting OD matrices for 3,233 diverse areas around the U.S. For each area, we provide the commuting OD matrix, combined with regional attributes including demographics and point-of-interests of each region in that area. We believe this comprehensive dataset will facilitate the development of more generalizable commuting OD matrix generation models, which can capture various patterns of distinct areas. Additionally, we use this dataset to benchmark a set of commuting OD generation models, including physical models, element-wise predictive models, and matrix-wise generative models. Surprisingly, we find a new paradigm, which considers the whole area combined with its commuting OD matrix as an attributed directed weighted graph and generates the weighted edges based on the node attributes, can achieve the optimal. This may inspire a new research direction from graph learning in this field.