Person

Gunnar Flötteröd

This person is no longer with EPFL

Related publications (50)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A model of risk-sensitive route-choice behaviour and the potential benefit of route guidance

Gunnar Flötteröd

In this paper, we present a simulation-based investigation of the potential benefit of route-guidance information in the context of risk-sensitive travelers. We set up a simple two-route scenario where travelers are repeatedly faced with risky route-choice ...

2011

Bayesian demand calibration for dynamic traffic simulations

Michel Bierlaire, Gunnar Flötteröd

We present an operational framework for the calibration of demand models for dynamic traffic simulations, where calibration refers to the estimation of a structurally predefined model's parameters from real data. Our focus is on disaggregate simulators tha ...

2011

Simulation-based dynamic traffic assignment is not a black box

Gunnar Flötteröd

The dynamic traffic assignment (DTA) problem is to find the state of a transportation system where demand (travel behavior) and supply (network performance) are mutually consistent. The difficulty of solving this problem with mathematical rigor led to the ...

2011

Choice set generation for iterated DTA simulations

Michel Bierlaire, Gunnar Flötteröd

We apply the Metropolis-Hastings algorithm to efficiently sample from arbitrary paths distributions in a general network. Paths can be generalized into all-day travel plans through, e.g., an appropriate network expansion. The Metropolis-Hastings algorithm ...

2011

Non-unique flows in macroscopic first-order intersection models

Gunnar Flötteröd

Currently, most intersection models embedded in macroscopic Dynamic Network Loading (DNL) models are not well suited for urban and regional applications. This is so because so-called internal intersection supply constraints, bounding flows due to crossing ...

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling cycle-free paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all p ...

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and he ...

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Simulation based Population Synthesis

Michel Bierlaire, Gunnar Flötteröd, Bilal Farooq

Microsimulation of transportation and land use evolution require base year, individual characteristics and disaggregate locations of the households and persons living in the study area. On the other hand at best, the census and travel survey, which are the ...

2011

Behavioral calibration and analysis of a large-scale travel microsimulation

Gunnar Flötteröd, Yu Chen

This article reports on the calibration and analysis of a fully disaggregate (agent-based) transport simulation for the metropolitan area of Zurich. The agent-based simulation goes beyond traditional transport models in that it equilibrates not only route ...

2010