Jacques Desrosiers
RetourCahiers du GERAD
111 résultats — page 5 de 6
This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...
référence BibTeX
We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...
référence BibTeX
The Airline Crew Scheduling Problem can be defined as the problem of finding a set of feasible rotations so that the total cost is minimum and all the fligh...
référence BibTeX
In many cities around the world, public transportation services are requested to provide adapted transportation for handicapped persons and people with rest...
référence BibTeX
The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle routing problem where the service of a customer can begin within th...
référence BibTeX
Because of the transmission of disease producing parasites to man and animals and the nuisance caused by bites from adult black flies, they are the object o...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...
référence BibTeXMinimisation 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...
référence BibTeX
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...
référence BibTeX
This paper presents mathematical formulations for some vehicle routing and scheduling problems with time window constraints and the optimal solution approach...
référence BibTeX
Recently we have witnessed the development of a fast growing body of research focused on vehicle routing and scheduling problem structures with time window c...
référence BibTeXVehicle Routing with Full Loads
This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling sale...
référence BibTeX
This article examines a constrained shortest path problem which occurs in the design by column generation of vehicle routes constructed to satisfy a set of t...
référence BibTeX
The single-vehicle dial-a-ride problem with time window constraints for both pick-up and delivery locations, and precedence and capacity constraints, is solv...
référence BibTeX
Cet article traite d'un problème de plus court chemin sous contraintes. Il s'agit du chemin d'un véhicule complétant un sous-ensemble de demandes de transpo...
référence BibTeX
This paper presents some preliminary results from an ongoing study of the impact of various operating scenarios on the construction and quality of reoutes in...
référence BibTeX