Smart infrastructure (telecommunications, public transport, smart cities)
BackCahiers du GERAD
338 results — page 3 of 17
The value of randomized strategies in distributionally robust risk averse network interdiction games
Conditional Value at Risk (CVaR) is widely used to account for the preferences of a risk-averse agent in the extreme loss scenarios. To study the effectiven...
BibTeX reference
Given a set \(\mathcal{R}\)
of m disjoint finite regions in the 2-dimensional plane, all regions having polygonal boundaries, and given a set `(\mathc...
The crew pairing problem is generally modelled as a set partitioning problem where the flights have to be partitioned in pairings. A pairing is a sequence of...
BibTeX referenceSpectral properties of threshold graphs
In this paper we study the spectral properties of the threshold graphs. In particular, we give lower and upper bounds for the largest and smallest eigenvalue...
BibTeX reference
Free-Floating Carsharing (FFCS) systems are a promising concept to reduce the traffic volume in cities. However, spatial and temporal mismatches of supply an...
BibTeX reference
The energy of a graph \(G\)
, denoted by \({\cal E}(G)\)
, is defined as the sum of the absolute values of all eigenvalues of \(G\)
. In this paper we stu...
Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be non-elementary and which is ...
BibTeX reference
Deploying applications having many processes in a multi-cloud environment is challenging. The cloud manager has goals such as minimizing power consumption, w...
BibTeX reference
Graphon-based control has recently been proposed and developed to solve control problems for dynamical systems on networks which are very large or growing w...
BibTeX reference
In this paper we study the linear quadratic regulation (LQR) problem for dynamical systems coupled over large-scale networks and obtain locally computable l...
BibTeX reference
We present a progressive approximation algorithm for the exact solution of several classes of interdiction games in which two non-cooperative players (namely...
BibTeX referenceHyperNOMAD: Hyperparameter optimization of deep neural networks using mesh adaptive direct search
The performance of deep neural networks is highly sensitive to the choice of the hyperparameters that define the structure of the network and the learning pr...
BibTeX reference
We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...
BibTeX reference
This paper considers a dynamic Emergency Medical Services (EMS) network design problem and introduces two novel two-stage stochastic programming formulatio...
BibTeX reference
Multi-agent reinforcement learning has made significant progress in recent years, but it remains a hard problem. Hence, one often resorts to developing lea...
BibTeX reference
Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...
BibTeX referenceA game theoretic analysis for community microgrid: Architecture, formulation and optimization
Microgrid, a promising component of smart grid, will potentially yield a free electricity market. This paper proposes a novel construction for a community mi...
BibTeX reference
The airline crew scheduling problem involves determining schedules for airline crew members such that all the scheduled flights over a planning horizon (usua...
BibTeX reference
We consider a class of dynamic collective choice models with social interactions, whereby a large number of non-uniform agents have to individually settle ...
BibTeX reference
Given a directed graph \(G=(V,A)\)
, capacity and cost functions on \(A\)
, a root \(r\)
, a subset \(T \subset V\)
of terminals, and an integer \(k\)
...