Publication

Activity pattern modeling: A path choice approach

Michel Bierlaire, Antonin Danalet
2014
Discussion par affiche
Résumé

In Switzerland, the largest railway stations are called "RailCities" by the Swiss Railways. It emphasizes their transformation into place to live and perform several different activities, similar to a small-scale city. Similar concerns than in urban areas are increasing: escalating costs of new infrastructure, increasing concerns regarding traffic congestion, scarcity of land use. Pedestrian demand management strategies would allow to modify individual travel behavior. The activity-based approach models the interactions shaping the activity participation patterns. Traveling is seen as a derived demand from the need to pursue activities. Several models have been proposed. Activity scheduling model in an entire-day framework is a mix of rule-based algorithm, duration models and discrete choice structures. The biggest drawback of most of these models is the postulated rules: they are structured on home and tours from home, with models applied sequentially according to priorities of activity types. Very often, the large dimensionality of the problem (activity types, continuous time, number of episodes in the day) implies aggregation (broad periods of time, mandatory vs non mandatory, primary vs secondary) or hierarchy of dimensions. We are developing a modeling framework based on path choice. The activity-episode sequence is seen as a path in an activity network. The sequence is not home-based nor tour-based, so that the model can be applied in different contexts, both urban and pedestrian. The large dimensionality is managed through an importance sampling based on Metropolis-Hastings algorithm for the generation of the choice set. The time is discretized in regular intervals. The utility of an activity-episode sequence is the sum of individual trips and activities, including the time-of-day preferences and the satiation effects. First estimation results are presented based on data from WiFi traces.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.