Clustering of Activity Patterns Using Genetic Algorithms

Abstract

Finding groups of individuals with similar activity patterns (a sequence of activities within a given time period, usually 24 hours) has become an important issue in models of activity-based approaches to travel demand analysis. This knowledge is critical to many activity-based models, and it aids our understanding of activity/travel behavior. This paper aims to develop a methodology for the clustering of these patterns. There is a large number of well-known clustering algorithms, such as hierarchical clustering, or k-means clustering (which belongs to the class of partitioning algorithm). However, these algorithms cannot be used to cluster categorical data, so they do not suit the problem of clustering of activity patterns well. Several other heuristics have been developed to overcome this problem. The k-medoids algorithm, described in this paper, is a modification of the k-means algorithm with respect to categorical data. However, similar to the k-means algorithm, the k-medoids algorithm can converge to local optima. This paper approaches the medoids-based formulation of clustering problem using genetic algorithms (GAs), a probabilistic search algorithm that simulates natural evolution. The main objective of this paper is to develop a robust algorithm that suits the problem of clustering of activity patterns and to demonstrate and discuss its properties.