Concept

Route assignment

Publications associées (112)

A data fusion approach for ride-sourcing demand estimation: A discrete choice model with sampling and endogeneity corrections

Ride-sourcing services offered by companies like Uber and Didi have grown rapidly in the last decade. Understanding the demand for these services is essential for planning and managing modern transportation systems. Existing studies develop statistical mod ...

2023

Ride-sharing with inflexible drivers in the Paris metropolitan area

Patrick Stefan Adriaan Stokkink

In ride-sharing, commuters with similar itineraries share a vehicle for their trip. Despite its clear benefits in terms of reduced congestion, ride-sharing is not yet widely accepted. We propose a specific ride-sharing variant, where drivers are completely ...

SPRINGER2022

Large-scale traffic signal control and multimodal network design

Dimitrios Tsitsokas

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

EPFL2022

Dedicated bus lane network design under demand diversion and dynamic traffic congestion: An aggregated network and continuous approximation model approach

Nikolaos Geroliminis, Mehmet Yildirimoglu

This paper proposes an integrated methodological framework to design a spatially heterogeneous bus route network and time-dependent service headways to serve travel demand that varies over time and space. Travelers choose to use either the transit mode or ...

PERGAMON-ELSEVIER SCIENCE LTD2021

A multi-hop control scheme for traffic management

Kenan Zhang

We propose a multi-hop control scheme (MHCS) that aims to route traffic through a set of designated intermediate checkpoints (ICs). Because travelers are allowed to freely choose routes for each “hop” that connects real (origin and destination) and ICs, MH ...

2021

A Simulation-Based Heuristic to Find Approximate Equilibria with Disaggregate Demand Models

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

Oligopolistic competition occurs in various transportation markets. In this paper, we introduce a framework to find approximate equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models ...

INFORMS2021

Stabilization of city-scale road traffic networks via macroscopic fundamental diagram-based model predictive perimeter control

Nikolaos Geroliminis, Isik Ilber Sirmatel

Traffic control for large-scale urban road networks remains a challenging problem. Aggregated dynamical models of city-scale traffic, based on the macroscopic fundamental diagram (MFD), enable development of model-based perimeter control methods. Involving ...

2021

Operational route choice methodologies for practical applications

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Evanthia Kazagli

This paper focuses on the application of tractable route choice models and presents a set of methods for deriving relevant disaggregate and aggregate route choice indicators, namely link and route flows. Tractability is achieved at the disaggregate level b ...

2020

A disaggregate choice-based approach to find epsilon-equilibria of oligopolistic markets

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

We present a general framework to find epsilon-equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models. Consumer choices are modeled according to random utility theory, and the choice ...

2019

Estimation of regional trip length distributions for the calibration of the aggregated network traffic models

Nikolaos Geroliminis, Sérgio Filipe Assunção Batista

The calibration of trip lengths is an important challenge for multi-regional MFD-based applications, as it can influence the dynamics of regional densities (and speeds). Existing research has not paid significant attention in the topic, giving opportunitie ...

PERGAMON-ELSEVIER SCIENCE LTD2019

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