Concept

Representativeness heuristic

Publications associées (44)

Mesoscopic simulator data to perform dynamic origin- destination matrices estimation in urban context

André-Gilles Dumont, Edward Chung, Emmanuel Bert

The aim of this paper is to explore a new approach to obtain better traffic demand (Origin-Destination, OD matrices) for dense urban networks using traffic simulation data. From reviewing existing methods, from static to dynamic OD matrix evaluation, possi ...

2008

A heuristic for global nonlinear optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

The proposed heuristic combines a variable neighborhood search (VNS) framework with a local search performed by a trust-region algorithm. The curvature of the function is exploited to generate the neighborhoods. Numerical results illustrate an excellent be ...

2007

Discrete choice models and heuristics for global nonlinear optimization

Michel Bierlaire

The lecture will consist in two parts. First, recent advances in discrete choice models will be presented and motivated. The estimation of these advanced models involves the maximization of a nonlinear, nonconcave loglikelihood function. The nonconcavity o ...

2007

Dynamic Origin-Destination Matrices Estimation Method for urban Networks

André-Gilles Dumont, Edward Chung, Emmanuel Bert

The aim of this paper is to explore a new approach to obtain better traffic demand (Origin-Destination, OD matrices) in case of dense urban networks. To improve the global process of OD demand estimation, this paper is focussing on a new methodology to exe ...

2007

From material flow analysis to material flow management Part II: the role of structural agent analysis

Claudia Rebeca Binder Signer

This paper presents a heuristic for supporting the transition from material flow analysis to material flow management. The heuristic combines material flow analysis with a newly developed method, structural agent analysis (SAA). The latter is based on Gidd ...

2007

Detecting Intentional Mental Transitions in an Asynchronous BCI

José del Rocio Millán Ruiz, Pierre Ferrez

The inclusion of mental tasks transitions detection (MTTD) has proven a useful tool in guiding the transduction process of a BCI working under an asynchronous protocol. MTTD allows for the extraction of the signal's contextual information in order to infer ...

IDIAP2006

Declining support for environmental policy? Applying economic voting models to referendums

Philippe Thalmann, Nicholas Bornstein

This study examines the personal, institutional and macroeconomic determinants of individual votes on 36 environmental protection proposals put to vote over twenty-one years in Switzerland. It applies a hierarchical model allowing for heterogeneous voter m ...

2006

Disassembly scheduling

Hwa-Joong Kim

This dissertation focuses on disassembly scheduling, which is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts/components over a given planning horizon. The objectiv ...

EPFL2005

Decision-aid methodology for the school bus routing and scheduling problem

Michel Bierlaire, Thomas Liebling

We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...

2005

A Value Ordering Heuristic for Local Search in Distributed Resource Allocation

Boi Faltings, Adrian Petcu

In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achieve desirable properties (increased effectiveness, or better allocations). The specifi ...

2004

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