Concept

Utility maximization problem

Publications associées (40)

OASIS: An integrated optimisation framework for activity scheduling

Activity-based models offer the potential for a far deeper understanding of daily mobility behaviour than trip-based models. Based on the fundamental assumption that travel demand is derived from the need to do activities, they are flexible tools that aim ...

EPFL2024

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays for DRR were found by Boyer et al., who used a rigorous network calculus approach and characterized the ser ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Optimization and equilibrium problems with discrete choice models

Stefano Bortolomiol

Many transportation markets are characterized by oligopolistic competition. In these markets customers, suppliers and regulators make decisions that are influenced by the preferences and the decisions of all other agents. In particular, capturing and under ...

EPFL2022

Capturing trade-offs between daily scheduling choices

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala

We propose a new modelling approach for daily activity scheduling which integrates the different daily scheduling choice dimensions (activity participation, location, schedule, duration and transportation mode) into a single optimisation problem. The funda ...

ELSEVIER SCI LTD2022

Price-based regulation of oligopolistic markets under discrete choice models of demand

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

We propose a framework to find optimal price-based policies to regulate markets characterized by oligopolistic competition and in which consumers make a discrete choice among a finite set of alternatives. With this framework, we can include general discret ...

EPFL2021

Price-based regulation of oligopolistic markets under discrete choice models of demand

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

We propose a framework to find optimal price-based policies to regulate markets characterized by oligopolistic competition and in which consumers make a discrete choice among a finite set of alternatives. The framework accommodates general discrete choice ...

2021

Integrating advanced discrete choice models in mixed integer linear optimization

Michel Bierlaire, Bernard Gendron

In many transportation systems, a mismatch between the associated design and planning decisions and the demand is typically encountered. A tailored system is not only appealing to operators, which could have a better knowledge of their operational costs, b ...

PERGAMON-ELSEVIER SCIENCE LTD2021

, ,

In this paper, we present a novel activity-based scheduling model that combines a continuous optimisation framework for temporal scheduling decisions (i.e. activity timings and durations) with traditional discrete choice models for non-temporal choice dime ...

2021

, ,

2021

To pool or not to pool: Equilibrium, pricing and regulation

Kenan Zhang

We study a transportation network company (TNC) that offers on-demand solo and pooling e-hail services in an aggregate mobility service market, while competing with transit for passengers. The market equilibrium is established based on a spatial driver–pas ...

2021

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