.png){kind=icon}
.png){kind=icon}
Return
Relaxation-discretization algorithm for spatially constrained secondary location assignment
.png){kind=icon}
OA
AI
DOI：10.1080/23249935.2021.1982068.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 ile-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.
Keywords:
Transport
simulation
secondary
location
assignment
data-driven
synthetic
population
Journal
IF:
3.1
Papers:
927
Citations:
2.2K