Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1401 results — page 1 of 71
In the multi-commodity two-echelon vehicle routing problem with time windows (MC-2E-VRPTW), first-echelon vehicles transport goods from depots to satellites...
BibTeX reference
Planners in different industries use optimization software for decision-making. In numerous practical applications, these optimization tools are often not re...
BibTeX referenceThe feasibility of ultra large-scale distributed networks in symmetrical network typologies
This study investigates the feasibility of large-scale distributed networks. The core focus of our research is the impact of multi-hop communication on point...
BibTeX reference
This paper addresses the Integrated Electrical Drill Rig Dispatching and Drilling Coordination Problem (IDRDCP) in open-pit mining operations, combining mach...
BibTeX reference
The routing-and-driving problem for plug-in hybrid electric vehicles (PHEVs) is an extension of the vehicle routing problem with time windows, where routing ...
BibTeX referenceOn the clique decomposition impact to the optimal power flow semidefinite relaxation solve time
Managing intermittent generation in electric power systems with high penetration of renewable sources of energy presents major operational challenges. Faster...
BibTeX reference
Hydrogen is emerging as a crucial energy source in the global effort to reduce dependence on fossil fuels and meet climate goals. Integrating hydrogen into I...
BibTeX referenceBranch-and-Price
Integer (linear) programs are a standard way of formalizing a vast array of optimization problems in industry, services, management, science, and technology....
BibTeX reference
We explore a scaled spectral preconditioner for the efficient solution of sequences of symmetric and positive-definite linear systems. We design the scaled...
BibTeX reference
Penalty methods are a well known class of algorithms for constrained optimization. They transform a constrained problem into a sequence of unconstrained _pe...
BibTeX reference
We develop R2N, a modified quasi-Newton method for minimizing the sum of a \(\mathcal{C}^1\)
function \(f\)
and a lower semi-continuous prox-bounded `(h...
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...
BibTeX reference
Population growth and city sprawl have been driving increasing amounts of traffic congestion in multiple major cities worldwide. In this scenario, developing...
BibTeX referenceTight 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...
BibTeX referenceACAS: 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...
BibTeX reference
Designing efficient evacuation networks is crucial for disaster preparedness, as poorly planned and managed evacuations can increase the time required for ev...
BibTeX reference
The modelling of linear quadratic Gaussian optimal control problems on large complex networks is intractable computationally. Graphon theory provides an appr...
BibTeX reference
Major projects often deviate from their expected budget, schedule, and benefits. Existing techniques to improve the forecasted outcome, such as the Refer...
BibTeX reference
JSOSuite.jl is a new Julia package offering a user-friendly interface for continuous nonlinear optimization. The solvers available cover unconstrained to g...
BibTeX reference
The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...
BibTeX reference