Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
806 results — page 38 of 41
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
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 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
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...
BibTeX reference
This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. ...
BibTeX reference
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...
BibTeX reference
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...
BibTeX referenceLocation-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 ...
BibTeX referenceVehicle 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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
Post box collection constitutes a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this opera...
BibTeX reference
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...
BibTeX reference
This paper describes a vehicle flow model for a two-echelon location-routing problem involving deliveries from primary to secondary facilities and from secon...
BibTeX referenceA 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 ...
BibTeX reference