Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1366 results — page 65 of 69
The problem we consider is that of preparing a minimum cost transportation plan by simultaneously solving the following two sub-problems: first the assignm...
BibTeX reference
This paper presents a model for the optimization of productivity in a steel plant comprised of four arc furnaces and three continuous casting machines and su...
BibTeX reference
The vehicle routing problem (VRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of vehicl...
BibTeX reference
The two-dimensional cutting-stock problem consists of laying out a specified list of rectangular pieces on rectangular sheets, in such a way as to minimize t...
BibTeX reference
The vehicle routing problem (VRP) involves the design of a set of minimum cost routes for a fleet of vehicles which services exactly once a set of customers...
BibTeX reference
Schedule compression is a major concern in project management. We propose an extension of the classical crashing model to include the managerial practice of...
BibTeX reference
This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...
BibTeX reference
We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...
BibTeX reference
The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...
BibTeX reference
We present an algorithm that solves the problem of finding the vehicle schedule which minimizes total inconveniences for travel along a fixed path, where se...
BibTeX reference
Le problème classique d'optimisation de la capacité des réseaux de télécommunications s'énonce comme suit: pour un réseau dont la structure, la demande et l...
BibTeX reference
Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...
BibTeX reference
In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...
BibTeX reference
Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...
BibTeX referenceMinimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
We present a dual algorithm to minimize a separable convex function under ratio constraints between variables. This minimization problem occurs when the dep...
BibTeX referenceA Network Approach to a Simultaneous Origin-Destination Assignment and Vehicule Routing Problem
The problem is to elaborate a minimum cost transportation plan by simultaneously solving the following two sub-problems: the assignment of available units at...
BibTeX reference
This paper deals with efficient computation of a certain type of Nash-Cournot equilibria in multi-stage oligopolies. The generic structure analyzed herein r...
BibTeX reference
We consider an oligopolistic industry extracting a non-renewable resource sold in a competitive market. We show, first, that if all players, but one, have i...
BibTeX reference
We present an algorithm that solve the problem of finding the best vehicle time schedule (minimizing total inconveniences) for a fixed path, knowing that vis...
BibTeX reference
This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...
BibTeX reference