Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1401 résultats — page 56 de 71
We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET ...
référence BibTeXAgrégation des contraintes de ressources en chaque noeud dans un problème de plus court chemin
Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...
référence BibTeX
We propose a network design model for flat networks using hybrid optical/electronic equipments. We describe a set of network components that can be taken in...
référence BibTeX
Cet article de vulgarisation donne un bref aperçu des travaux réalisés en gestion des opérations dans les grands réseaux de transport. On y fait principalem...
référence BibTeX
Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a...
référence BibTeX
Let <i>G</i> be a multigraph containing no minor isomorphic to <i>K</i><sub>3,3</sub> or <i>K</i><sub>5</sub><i>e</i> (where <i>K</i><sub>5</sub><i>e</i> de...
référence BibTeX
The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a...
référence BibTeX
In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a trans...
référence BibTeX
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...
référence BibTeX
This paper examines dynamic advertising and promotion strategies in a marketing channel where the retailer promotes the manufacturer's product, and the manu...
référence BibTeX
Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...
référence BibTeXThe VRP with Pickup and Delivery
This paper presents a survey on the <i>Vehicle Routing Problem with Pickup and Delivery</i> in which a heterogeneous vehicle fleet based at multiple termina...
référence BibTeX
A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...
référence BibTeXThe VRP with Time Windows
This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Probl...
référence BibTeX
This case study analyses the use and sharing of a logistics package, a returnable container, between Canada Post and its large mailing customers. Canada Po...
référence BibTeXRegards sur la découverte
Quatre regards sur la découverte, ceux du psychologue, de l'historien, du sociologue et du cognicien sont évoqués en quelques remarques illustrées d'exemples.
référence BibTeX
Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...
référence BibTeXBoundary Uniqueness of Fusenes
It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...
référence BibTeX
The paper deals with the problem of sustaining over time a coordinated outcome in a two-member channel of distribution. In a dynamic game of pricing and ad...
référence BibTeX
Variable Neighborhood Search is a recent metaheuristic based on the idea of systematic change of neighborhood during both a descent phase and an exploration...
référence BibTeX