Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1401 résultats — page 68 de 71
In this paper we analyze the problem of finding the trading area for a facility on a linear market. Given the objective of maximizing profit, we first build...
référence BibTeX
This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. ...
référence BibTeX
In this paper, an extension of the classical scheduling problem is considered. It is assumed that tasks are processed on parallel processors, available at d...
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 BibTeXLocation-Routing Problems
Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in ...
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
Hydraulic turbine runners are used in electricity generation. These consist of a cylinder around which are welded, at regular spacings, a number of blades w...
référence BibTeX
In this paper the authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how...
référence BibTeX
Post box collection constitutes a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this opera...
référence BibTeX
A qualitative model is proposed by the economic analysis of the power exchange between two utilities. The model combines an infinite horizon optimal control...
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
This paper describes a vehicle flow model for a two-echelon location-routing problem involving deliveries from primary to secondary facilities and from secon...
référence BibTeXA Branch-and-Bound Algorithm for the Asymetrical Distance Constrained Vehicle Routing Problem
The aim of this paper is to develop an exact algorithm for the asymmetrical distance constrained vehicle routing problem. The problem is solved by means of ...
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
This paper describes an exact algorithm for a general class of asymmetrical vehicle routing problems. Vehicle routes start and end at a central depot. Visi...
référence BibTeX
Let n facilities be located on a bounded linear market and assume that demand for a homogenous commodity is uniformly distributed along that market. Initial...
référence BibTeX
This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian cirnui...
référence BibTeXAn Optimal Flow Circulation Algorithm for the Asymmetrical Multiple Travelling Salesman Problem
This paper describes an exact algorithm for the asymmetrical multiple travelling salesman problem. The problem is solved by branch and bound and a flow circ...
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 deals with the optimal location of post boxes in an urban or in a rural environment. The problem consists of selecting sites for post boxes which...
référence BibTeX