Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1423 résultats — page 11 de 72
Nous représentons une chaîne d'approvisionnement en boucle fermée composée d'un fabricant et d'un détaillant comme un jeu dynamique joué sur un arbre d'évén...
référence BibTeX
Nous étudions un jeu séquentiel à deux étapes dans un duopole de produits substituables en considérant que les firmes peuvent poursuivre un double objectif...
référence BibTeX
Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...
référence BibTeX
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
We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...
référence BibTeXVessel service planning in seaports
Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...
référence BibTeXStochastic dual dynamic programming for multi-echelon lot-sizing with component substitution
This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...
référence BibTeX
Generation expansion planning (GEP) is a classical problem that determines an optimal investment plan for existing and future electricity generation technolo...
référence BibTeXConstrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
This work introduces the StoMADS-PB algorithm for constrained stochastic blackbox optimization, which is an extension of the mesh adaptive direct-search (MAD...
référence BibTeX
This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm with the Cross-Entropy (CE) method for non smooth constrained optimizat...
référence BibTeXA branch-price-and-cut algorithm for the two-echelon vehicle routing problem with time windows
In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises i...
référence BibTeX
Le Neuvième atelier de résolution de problèmes industriels de Montréal, qui eut lieu du 19 au 23 août 2019, fut organisé conjointement par le CRM et l'Instit...
référence BibTeX
We propose a new stochastic variance-reduced damped L-BFGS algorithm, where we leverage estimates of bounds on the largest and smallest eigenvalues of the He...
référence BibTeX
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...
référence BibTeX
Data acquisition and recording in the form of databases are routine operations. The process of collecting data, however, may experience irregularities, res...
référence BibTeX
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
We consider a deterministic two-player linear-state differential game, where Player 1 uses piecewise continuous controls, while Player 2 implements impulse...
référence BibTeXAn oligopoly game of CDR strategy deployment in a steady-state net-zero emission climate regime
In this paper, we propose a simple oligopoly game model to represent the interactions between coalitions of countries in deploying Carbon Dioxide Removal ...
référence BibTeX
The design of key nonlinear systems often requires the use of expensive blackbox simulations presenting inherent discontinuities whose positions in the varia...
référence BibTeX
We study a new variant of the vehicle routing problem, which arises in hospital-wide scheduling of physical therapists. Multiple service locations exist for...
référence BibTeX