François Soumis
BackCahiers du GERAD
170 results — page 8 of 9
The development of truck dispatching systems has during recent years taken two directions. One has been systems using mathematical optimization and powerfu...
BibTeX reference
In this paper we develop a stochastic, dynamic network equilibrium model of airline passenger transportation. The model explicitly incorporates the behavior...
BibTeX reference
CREW-OPT is a new software module in the HASTUS family of scheduling software. CREW-OPT produces optimal or near-optimal crew schedules for small problems (...
BibTeX referenceThéorie du dimensionnement d'un réseau hiérarchique de télécommunications avec contraintes de budget
Le problème classique de dimensionnement d'un réseau de télécommunications se formule en général comme suit: étant donné un réseau, une matrice de trafic et...
BibTeX reference
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 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
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 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
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
We propose a measure of the reliability of a telecommunication network based on the expected value of the lost call traffic due to failures in the network. ...
BibTeX reference
The urban transit crew scheduling problem arises in mass transit corporations who have to create minimal cost bus driver schedule respecting both the collect...
BibTeX reference
This paper presents mathematical formulations for some vehicle routing and scheduling problems with time window constraints and the optimal solution approach...
BibTeX reference