Relaxation-discretization algorithm for spatially constrained secondary location assignment - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Relaxation-discretization algorithm for spatially constrained secondary location assignment

Résumé

Agent-based transport models demand that the daily activity patterns of artificial agents are described in great detail. While established choice models for residential locations or work places exist, only few approaches are available to find locations for highly constrained secondary activities such as grocery shopping or recreation. The paper describes a novel data-driven approach of assigning viable locations to such secondary locations while maintaining consistency with homes, work places and other fixed points in an artificial traveller’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.
Fichier non déposé

Dates et versions

hal-03208844 , version 1 (26-04-2021)

Identifiants

Citer

Sebastian Hörl, Kay W Axhausen. Relaxation-discretization algorithm for spatially constrained secondary location assignment. 99th Annual Meeting of the Transportation Research Board (TRB), Jan 2020, Washington, D.C., United States. ⟨10.3929/ethz-b-000378016⟩. ⟨hal-03208844⟩

Collections

TDS-MACS
32 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More