Stéphane Alarie

Retour

Cahiers du GERAD

12 résultats — page 1 de 1

, , et

In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated in...

référence BibTeX
, et

We consider computationally expensive blackbox optimization problems and present a method that employs surrogate models and concurrent computing at the searc...

référence BibTeX
, , , et

This work reviews blackbox optimization applications over the last twenty years, addressed using direct search optimization methods. Emphasis is placed on...

référence BibTeX
, , , et

In the area of hydraulic power generation, there is a great deal of interest in two interdependent domains: operation and maintenance. This interdependence...

référence BibTeX

In derivative-free and blackbox optimization, the objective function is often evaluated through the execution of a computer program seen as a blackbox. It ...

référence BibTeX
, , et

Dealing with computationally-intensive calibration processes is still common in distributed hydrological modelling despite the computing power growth. Comput...

référence BibTeX
, , et

This is a two-part work. In Part I, low-cost and representative reduced-fidelity models of two versions of the HYDROTEL hydrological model are constructed, u...

référence BibTeX
, , , et

The parallel space decomposition of the Mesh Adaptive Direct Search algorithm (PSD-MADS proposed in 2008) is an asynchronous parallel method for constrained ...

référence BibTeX
, , et

The calibration of hydrological models is here formulated as a Blackbox optimization problem where the only information available to the optimization algorit...

référence BibTeX
, , , et

Accurate measurements of snow water equivalent (SWE) is an important factor in managing water resources for hydroelectric power generation. SWE over a catchm...

référence BibTeX
et

This paper deals with dispatching systems in open-pit mines. It illustrates the different strategies that exist for solving the dispatching problem and ana...

référence BibTeX

We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin r...

référence BibTeX