Cahiers du GERAD
Search
Chronological list
3212 results — page 121 of 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...
BibTeX reference
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...
BibTeX referenceThe 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...
BibTeX reference
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...
BibTeX reference
We propose an overall reconstruction of the traditional genetic algorithm method so that its inherent weaknesses such as slow convergence can be overcome. ...
BibTeX reference
Logistics and transportation decision support systems rely on models of travel distance for evaluating scenarios and estimating costs. This paper presents a...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of ca...
BibTeX referenceRegards 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.
BibTeX reference
Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interferen...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference