Activity patterns in space and time: Calculating representative Hagerstrand trajectories

  • Wilson C
  • 75


    Mendeley users who have this article in their library.
  • 30


    Citations of this article.


Daily activity diaries can be recorded as sequences of characters representing events and their contexts as they unfold during the day. Dynamic programming algorithms as used in bioinformatics have been used by a number of researchers to measure the similarities and differences between travel patterns on the basis of temporal sequencing of events, activity transition, and total activity time. The resultant similarity matrices have been shown to be more effective in classifying sequential patterns than classifications based on alternative similarity indices. The basic algorithms can be amended to include the geographic coordinates of events by a suitable amendment to the definition of distance. This permits quantitative classification of Hagerstrand-type activity trajectories on the basis of both activity and spatial similarity. Such a classification can be used to group similar trajectories and to identify representative trajectories that are analogous to measures of central tendency in univariate statistics, giving more concrete meaning to the concept of the activity pattern than any other method now available. The paper illustrates the effect of considering both events and locations in the classification of daily activity patterns using activity diary data gathered in the town of Reading. The algorithm has been implemented in the Clustal_TXY alignment software package.

Author-supplied keywords

  • Activity trajectories
  • Alignment analysis
  • Optimal matching
  • Travel patterns

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Clarke Wilson

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free