Relaxation–discretization algorithm for spatially constrained secondary location assignment

8Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Agent-based transport models demand that the daily activity patterns of artificial agents are described in great detail. While choice models for residential locations or workplaces exist, only few approaches are available to find locations for highly constrained secondary activities such as grocery shopping or recreation at high resolution. The paper describes a data-driven approach of assigning viable locations to such secondary locations while maintaining consistency with homes, workplaces and other fixed points in an artificial traveler's daily plan. Two use cases for Switzerland and Île-de-France are presented, which show that the algorithm is able to assign locations while providing realistic distance distributions that are consistent with mode-specific travel times.

Cite

CITATION STYLE

APA

Hörl, S., & Axhausen, K. W. (2023). Relaxation–discretization algorithm for spatially constrained secondary location assignment. Transportmetrica A: Transport Science, 19(2). https://doi.org/10.1080/23249935.2021.1982068

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free