Infrastructures intelligentes (télécommunications, transport public, villes intelligentes)

Retour

Cahiers du GERAD

332 résultats — page 5 de 17

, , et

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...

référence BibTeX
, , et

Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a...

référence BibTeX
et

In this paper, we investigate team optimal control of a population of heterogeneous LQ (Linear Quadratic) agents. The population consists of finite distinct...

référence BibTeX
, , , et

Cet article traite la prise en compte d'incertitudes lors de la résolution de conflits. Plus particulièrement, nous considérons les incertitudes dues aux err...

référence BibTeX
, , et

Nous présentons un modèle déterministe pour le problème de détection et de résolution de conflits entre aéronefs. Les aspects liés à la dynamique des avions,...

référence BibTeX
, et

We consider a multi-agent system with linear stochastic individual dynamics, and individual linear quadratic ergodic cost functions. The agents partially o...

référence BibTeX
et

Decentralized sequential hypothesis testing refers to a generalization of Wald's sequential hypothesis testing setup in which multiple decision makers make ...

référence BibTeX
, et

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring is an assignment of at most `...

référence BibTeX
et

The fundamental limits of remote estimation of Markov processes under communication constraints are presented. The remote estimation system consists of a sen...

référence BibTeX
, , et

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). F...

référence BibTeX
, , et

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic deman...

référence BibTeX
, , , et

Usually several neighborhood structures may be explored within a single local search algorithm. The simplest way is to define a single neighborhood as a unio...

référence BibTeX

In this paper we investigate the options of a network operator faced with the requirement of reducing its carbon footprint, expressed in terms of a global en...

référence BibTeX
, , et

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

référence BibTeX
, et

This paper proposes an incentive mechansim for transmission expansion planning. The mechansim is a bilevel program. The upper level is a profit-maximizing tr...

référence BibTeX
, et

Robust optimization (RO) is a powerful mean to handle optimization problems where there is a set of parameters that are uncertain. The effectiveness of the m...

référence BibTeX
, et

Studies of traffic dynamics rely either on macroscopic models considering the traffic as a fluid, or on microscopic models of drivers' behavior. The connec...

référence BibTeX
et

The problem of optimal real-time transmission of a Markov source under constraints on the expected number of transmissions is considered, both for the discou...

référence BibTeX
, et

The packet delay variation, commonly called delay jitter, is an important quality of service parameter in IP networks especially for real-time applications. ...

référence BibTeX
, et

Jitter buffering is a key component in multimedia and real-time services. A jitter buffer is used at the receiver side to control packet rate and to compensa...

référence BibTeX