Pedestrian travel behavior modeling

被引:65
作者
Hoogendoorn, SP [1 ]
Bovy, PHL [1 ]
机构
[1] Delft Univ Technol, Transportat & Planning Sect, Delft, Netherlands
关键词
route choice; activity scheduling; pedestrians; international conference on travel behavior research; IATBR;
D O I
10.1007/s11067-005-2629-y
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a dynamic mixed discrete-continuous choice approach to modeling pedestrian travel and activity choice behavior in public facilities. The approach views revealed behavior as a manifestation of pedestrians' preferences by assuming that pedestrians choose the alternative that maximizes expected (subjective) utility, while taking into account the uncertainty in expected traffic conditions. The choice dimensions are trajectories between origin and subsequent destinations, areas where activities are performed (multiple vs. fixed destination), execution of discretionary activities, and finally activities completion times and order. The disutility of a trajectory determines the trajectory choice of the traveler. Destination area choice is included in the modeling by determining time-dependent and destination-specific arrival costs. Furthermore, penalties for not executing a planned activity are introduced into the modeling framework. The resulting modeling approach has a clear analogy with stochastic control theory and dynamic programming in continuous time and space. The main innovations presented here is the relaxation of the assumption that routes are discrete sets of travel links. The approach relaxes the need to build a discrete network, while routes (trajectories) are continuous functions in time and space. At the same time, destination choice is included in the modeling framework.
引用
收藏
页码:193 / 216
页数:24
相关论文
共 23 条
  • [1] ABDELGHANY AF, 2003, 82 ANN M TRANSP RES
  • [2] [Anonymous], TRANSPORTATION RES B
  • [3] [Anonymous], 1986, TRANSP PLANN TECHNOL, DOI [10.1080/03081068508717309, DOI 10.1080/03081068508717309]
  • [4] ARENTZE T, 2000, ALBATROS LEARNING BO
  • [5] Beckmann M., 1985, SPATIAL EC DENSITY P
  • [6] Bellman, 1957, DYNAMIC PROGRAMMING
  • [7] Bovy P. H., 2012, Route Choice: Wayfinding in Transport Networks: Wayfinding in Transport Networks
  • [8] CHIOLEK MT, 1978, EKISTICS, V268, P120
  • [9] FLEMING WH, 1993, CONTROLLED MARKOV PR, V25
  • [10] GIPPS OG, 1986, SCHRIFTENREIHE I VER, P35