Cahiers du GERAD
Recherche
Liste chronologique
3212 résultats — page 121 de 161
The 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 paper presents a mixed 0-1 linear programming model for the metropolitan area network (MAN) expansion problem. The model includes the location of new...
référence BibTeX
We propose an overall reconstruction of the traditional genetic algorithm method so that its inherent weaknesses such as slow convergence can be overcome. ...
référence BibTeX
Logistics and transportation decision support systems rely on models of travel distance for evaluating scenarios and estimating costs. This paper presents a...
référence BibTeX
We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel...
référence BibTeX
This article examines arc routing problems from the "dual" perspective of node routing. It first attempts to explain why and how an arc routing problem shou...
référence BibTeX
We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is de...
référence BibTeX
Snow removal and disposal are important and expensive winter operations in many cities. When a large amount of snow accumulates in an urban area and impedes...
référence BibTeX
This paper deals with the inventory control problem for production system in which the produced items are supposed to be deteriorating with fixed rates. The...
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 BibTeX
In the set of bicolored trees with given numbers of black and of white vertices we describe those for which the largest eigenvalue is extremal (maximal or m...
référence BibTeX
In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of ca...
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
Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interferen...
référence BibTeX
A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a p...
référence BibTeX
Eugène est un modèle dynamique de programmation linéaire mixte qui constitue un outil d'aide à la décision efficace pour les décideurs impliqués dans la pla...
référence BibTeX