Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1409 résultats — page 2 de 71
Nous développons R2N, une méthode quasi-Newton modifiée pour minimiser la somme d'une fonction \(\mathcal{C}^1\)
\(f\)
et d'une fonction \(h\)
semi-con...
In this report, we present our winning solution to the 16th AIMMS-MOPTA Optimization Modeling Competition on whether a fully renewable energy grid would bene...
référence BibTeXTight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...
référence BibTeXACAS: A comprehensive framework for automatic abstract screening in systematic literature reviews
When performing a Systematic Literature Review (SLR), the Abstract Screening Process (ASP) can be a very consuming and laborious task, especially when rese...
référence BibTeX
Designing efficient evacuation networks is crucial for disaster preparedness, as poorly planned and managed evacuations can increase the time required for ev...
référence BibTeX
La modélisation des problèmes de contrôle optimal linéaire, quadratique et gaussien sur de grands réseaux complexes est difficile à calculer. La théorie des ...
référence BibTeX
Les grands projets s'écartent souvent de leur budget, de leur calendrier et de leurs bénéfices attendus. Les techniques existantes pour améliorer les prévisi...
référence BibTeX
JSOSuite.jl est un nouveau package Julia offrant une interface conviviale pour l'optimisation non linéaire continue. Les solveurs disponibles sont ceux de l'...
référence BibTeX
The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...
référence BibTeX
Over the past years, Robotic Process Automation (RPA) has emerged as a significant tool to enhance productivity across various industries by automating repet...
référence BibTeX
The increasing penetration of renewable electricity generation as well as the implementation of demand response programs has led to new challenges in the ope...
référence BibTeX
Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is enco...
référence BibTeX
Governments are motivated to subsidize profit-driven firms that manufacture zero-emission vehicles to ensure they become price-competitive. This paper intr...
référence BibTeX
Nous étendons les analyses de complexité traditionnelles des méthodes de régions de confiance pour l'optimisation sans contrainte, possiblement non convexe....
référence BibTeX
We consider a provider of electric vehicle charging that operates a network of charging stations and uses time-varying pricing to maximize profit and reduce ...
référence BibTeX
The water pump scheduling problem is an optimisation model that determines which water pumps will be turned on or off at each time period over a given time h...
référence BibTeX
This work introduces a _partitioned optimization framework_ (POf) to ease the solving process for optimization problems for which fixing some variables to a...
référence BibTeX
This paper addresses the limitations of current satellite payload architectures, which are predominantly hardware-driven and lack the flexibility to adapt to...
référence BibTeX
This paper tackles a complex variant of the unit commitment (UC) problem at Hydro-Quebec, referred to as the transient stability constrained unit commitmen...
référence BibTeX
Cet article propose une nouvelle étape à ajouter à chaque itération de la Méthode de Recherche Directe Direct Search Method (DSM) en anglais) pour renfor...
référence BibTeX