Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1415 résultats — page 29 de 71
This paper focuses on the resolution of the capacitated minimum cost flow problem on a network comprising <i>n</i> nodes and <i>m</i> arcs. We present a met...
référence BibTeX
Les communautés éloignées sont typiquement isolées des réseaux de production, transport et distribution d'électricité. C'est ainsi qu'elles doivent compter s...
référence BibTeX
Les problèmes d'écoulement de puissance optimaux sous contraintes de sécurité (EPOCS) et les problèmes d'ordonnancement des groupes de production sous contra...
référence BibTeX
The Mesh Adaptive Direct Search (MADS) algorithm is designed for blackbox optimization problems subject to general inequality constraints. Currently, MADS do...
référence BibTeXSystem-of-systems approach to air transportation design using nested optimization and direct search
Aircraft sizing, route network design, demand estimation and allocation of aircraft to routes are different facets of the air transportation optimization pro...
référence BibTeX
Nous présentons une approche efficace pour l'évaluation du risque de contrepartie et le calcul de l'ajustement CVA pour le risque de crédit dans le cas de dé...
référence BibTeX
We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of...
référence BibTeX
This paper presents a new method for solving the short-term unit commitment and loading problem of a hydropower system. Dynamic programming is used to comput...
référence BibTeX
The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...
référence BibTeX
Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literatur...
référence BibTeX
Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer ...
référence BibTeX
A preconditioned variant of the Golub and Kahan (1965) bidiagonalization process recently proposed by Arioli (2013) and Arioli and Orban (2013) allows us to ...
référence BibTeXImproved primal simplex: A more general theoretical framework and an extended experimental analysis
In this article, we propose a general framework for an algorithm derived from the primal simplex that guarantees a strict improvement in the objective after ...
référence BibTeX
The dust suppression of hauling roads in open-pit mines is done by periodically spraying water from a water truck. The objective of this article is to presen...
référence BibTeX
Finding communities in complex networks is a topic of much current research and has applications in many domains. On the one hand, criteria for doing so hav...
référence BibTeX
This paper presents the first direct implementation of the positive edge criterion using COIN-OR's CLP, where it has been combined with the Devex pivot rule....
référence BibTeX
Commercial piracy and counterfeiting are widespread phenomena in different businesses, ranging from software and video games to luxury fashion products. Th...
référence BibTeX
Typical challenges of simulation-based design optimization include unavailable gradients and unreliable approximations thereof, expensive function evaluation...
référence BibTeX
This article describes the problem in which the edges of a network represent customers, and a quantity of material is delivered to them so that each one achi...
référence BibTeXBuffer Dimensioning and Control Stations Positioning with a Space Partitioning-Tabu Search Approach
We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production li...
référence BibTeX