Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 60 of 69
We study the problem of finding a shortest collision-free path for a point car-like robot maneuvering around polygonal obstacles in a room bounded by a poly...
BibTeX reference
The paper is concerned with sustainable cooperation in a vertical two-member channel of distribution over an infinite planning horizon. Sustainable intertem...
BibTeX reference
We study the problem of minimizing the peak load in single-command cycle shared storage policies. The peak load is the maximum of the daily material handlin...
BibTeX reference
Diverses classes de modèles permettant la génération de solutions pour des problèmes d'implantations d'usines sont décrits. La description de chacune des c...
BibTeX reference
We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of th...
BibTeX reference
Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex <i>s</i> to a vertex <i>t</i> with the smallest possible range of a...
BibTeX reference
In this paper a new approach for the facility layout problem is presented. This approach combines genetic algorithms with linear programming to design the ...
BibTeX reference
We consider the problem of minimizing, over a fixed horizon, the peak load in single-command cycle dedicated storage policies. The daily load is the expecte...
BibTeX reference
The multi-depot vehicle scheduling problem with time windows consists of scheduling a fleet of vehicles to cover a set of tasks at minimum cost. Each task i...
BibTeX referenceProbabilistic Satisfiability
A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...
BibTeX reference
Extension of input-output functions for generating units allows simultaneous solution of the static unit commitment and economic dispatch problems by dynami...
BibTeX reference
Let <i>G =</i> (<i>V,E</i>) be an undirected graph and <i>c</i> any vector in Z<sub>+</sub><sup><i>V</i>(<i>G</i>)</sup>. Denote by <img src="chi.gif" alig...
BibTeX reference
In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertic...
BibTeX reference
The problem of assigning locomotives to train-segments is very important for railway companies, in view of the high cost of operating locomotives. The prob...
BibTeX reference
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time window...
BibTeX referenceCrew Pairing at Air France
In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...
BibTeX reference
We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph...
BibTeX reference
The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...
BibTeX referenceMixed Graph Colorings
A mixed graph <i>G<sub><img src="theta.gif"></sub></i> contains both undirected edges and directed arcs. A <i>k</i>-coloring of <i>G<sub><img src="theta.g...
BibTeX reference
The majority of vehicle routing and crew scheduling problems studied up to date in the literature can be formulated by means of a unified model introduced b...
BibTeX reference