A general framework for the integration of complex choice models into mixed integer optimization
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.
When using random utility models for a route choice problem, choice set generation and correlation among alternatives are two issues that make the modelling complex. In this paper, we propose a modelling approach where the path overlap is captured with a s ...
The emergence of Intelligent Transportation Systems and the associated technologies has increased the need for complex models and algorithms. Namely, real-time information systems, directly influencing transportation demand, must be supported by detailed b ...
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal is to implement the efficient solution, maximizing the total utility across ...
We propose a discrete choice framework for pedestrian dynamics, modelling short term behavior of individuals as a response to the presence of other pedestrians. We use a dynamic and individual-based spatial discretization, representing the physical space. ...
When using random utility models for a route choice problem, choice set generation and correlation among alternatives are two issues that make the modeling complex. In this paper we discuss different models capturing path overlap. First, we analyze several ...
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (pLPs) and solved explicitly offline. Several algorithms have recently been proposed in the literature that solve these pLPs in a fai ...
The role of discrete choice models in decision-making support has significantly grown during the past 20 years. This is particularly true in the context of marketing and transportation, where it is critical to understand and forecast choice behavior in a d ...
Generalised extreme value models provide an interesting theoretical framework to develop closed-form random utility models. Unfortunately, few instances of this family are to be found as operational models in practice. The form of the model, based on a gen ...
We present behavioral models designed to capture the response of drivers to real-time traffic information. In 2003, we have conducted a survey in Switzerland in order to collect both Revealed Preferences (RP) and Stated Preferences (SP) about choice decisi ...
