Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1368 résultats — page 27 de 69
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 BibTeXAn Exact Method for Solving the Buffer Sizing and Inspection Stations Allocations Problem
An unreliable single part type transfer line with fixed inter machine buffer sizes is considered. In general, imperfect machines operating with imperfect raw...
référence BibTeX
Since the 1970's, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an ...
référence BibTeX
The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many dom...
référence BibTeX
Aircraft maintenance planning is of critical importance to the safe and efficient operations of an airline. It is common to solve the aircraft routing and ma...
référence BibTeX
We consider a class of dynamic games played over an event tree, where the players cooperate to optimize their expected joint payoff. Assuming that the pla...
référence BibTeX
We propose a generalization of the limited-memory Cholesky factorization of Lin and Moré (1999) to the symmetric indefinite case with special interest in sym...
référence BibTeX
In this paper, we present a mixed integer programming model for solving the long-term planning problem of an underground mine. This model establishes the seq...
référence BibTeX