Axe 4 : Aide à la décision prise en temps réel

Retour

Cahiers du GERAD

95 résultats — page 3 de 5

et

This paper investigates the dynamic pricing strategies of firms selling complementary products in a marketing channel. The problem is modelled as a non-coo...

référence BibTeX
et

Partout dans le monde, les pratiques de planification des réseaux électriques sont en mutation dans le but d'intégrer de manière efficace un parc de producti...

référence BibTeX
, et

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring is an assignment of at most `...

référence BibTeX

We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...

référence BibTeX
, et

This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algor...

référence BibTeX
, , et

Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...

référence BibTeX
et

Modern power systems are undergoing a transitional phase, increasingly incorporating variable generation (VG) to harness the economic and environmental benef...

référence BibTeX
, et

Until recently, graph coloring being a computationally difficult problem, completely dynamic channel allocation was not considered in large scale networks. T...

référence BibTeX
, et

Nous caractérisons les prix d'équilibre dans un circuit de distribution sous deux scénarios. Dans le premier scénario, le producteur choisit le prix de trans...

référence BibTeX
, , , et

The <b>VRPTW-ST</b> introduced by Errico et al. (2013) in the form of a chance-constrained model mainly differs from other vehicle routing problems with st...

référence BibTeX
, , , et

In this paper we consider the vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST); in this variant of the classic VRPTW ...

référence BibTeX
, et

Column generation for solving linear programs with a huge number of variables alternates between solving a master problem and a pricing subproblem to add var...

référence BibTeX
, , , et

Given a directed graph with weights on the vertices and on the arcs, a &theta;-improper <i>k</i>-coloring is an assignment of at most <i>k</i> different colo...

référence BibTeX
, et

Column generation for solving linear programs with a huge number of variables alternately solves a (restricted) master problem and a pricing subproblem to ad...

référence BibTeX

Dans cet article, on raconte l'histoire de l'équipe GENCOL et du logiciel d'optimisation du même nom. C'est avant tout le récit d'une collaboration qui se po...

référence BibTeX
, et

This paper presents an efficient approach for realistic modelling of internal transport systems. The weakness of the former methods in tracking the traffic w...

référence BibTeX
, et

This paper presents a new generic architecture for the implementation of an intelligent simulation-based real-time control in large-scale discrete-events sys...

référence BibTeX
, et

The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when s...

référence BibTeX

This paper presents an overview of the column generation method developed at the GERAD research center in Montr&#39;eal for solving large scale vehicle routing ...

référence BibTeX
, et

Column generation algorithms are instrumental in many areas of applied optimization, where linear programs with an enormous number of columns need to be so...

référence BibTeX