Concept

Route assignment

Publications associées (112)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Network design of a transport system based on accelerating moving walkways

Michel Bierlaire, Riccardo Scarinci, Iliya Dimitrov Markov

Pollution, congestion and urbanistic considerations are leading to a change in the use of private vehicles in dense city centers. More frequently, the last-mile is covered with systems such as public transport, car sharing and bike sharing as well as an in ...

Pergamon-Elsevier Science Ltd2017

A discounted recursive logit model for dynamic gridlock network analysis

Yuki Oyama

Emerging sensing technologies such as probe vehicles equipped with Global Positioning System (GPS) devices on board provide us real-time vehicle trajectories. They are helpful for the understanding of the cases that are significant but difficult to observe ...

2017

Dynamical Efficiency in congested road networks

Leonardo Bellocchi

The main topological properties of a transportation network can be characterized using different criteria such as structure, the degree distribution of nodes, connectivity and some clustering aspects. Efficiency is a property of a network that identifies t ...

2017

Understanding how users navigate in a network is of high interest in many applications. We consider a setting where only aggregate node-level traffic is observed and tackle the task of learning edge transition probabilities. We cast it as a preference lear ...

2017

, ,

We propose a novel algorithm for the capacitated passenger assignment problem in public transportation where exogenous priority lists define the order in which passengers are assigned. Separating explicitly theses rules from the assignment procedure allows ...

Pergamon-Elsevier Science Ltd2017

Demand information is an input for a great deal of operations research models. Assumed as given in many problem instances addressed in the literature, demand data are difficult to generate. In this tutorial, we provide an introduction to disaggregate deman ...

2017

Revisiting the Route Choice Problem: A Modeling Framework Based on Mental Representations

Michel Bierlaire, Gunnar Flötteröd, Evanthia Kazagli

We present a new approach for modeling and analyzing route choice behavior. It is motivated by the need to reduce the complexity of the state-of-the-art choice models. It is inspired by the simplifications done by the travelers, using representations of th ...

Elsevier Sci Ltd2016

Network design of a transport system based on accelerating moving walkways

Michel Bierlaire, Riccardo Scarinci, Iliya Dimitrov Markov

2016

Revisiting the Route Choice Problem: A Modeling Framework Based on Mental Representations

Michel Bierlaire, Evanthia Kazagli

We present a new approach for modeling and analyzing route choice behavior. It is motivated by the need to reduce the complexity of the state-of-the-art models. It is inspired by the simplifications actually done by the people, using representations of the ...

2015

Revisiting the Route Choice Problem: A Modeling Framework Based on Mental Representations

Michel Bierlaire, Evanthia Kazagli

2015