Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
792 results — page 26 of 40
Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...
BibTeX reference
This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...
BibTeX reference
We define two classes of lower bounds using either one or two simplices for the minimization of a concave function over a polytope. For each of them, a pro...
BibTeX reference
It is well known that the set of correlated equilibrium distributions of a noncooperative game is a convex polytope that includes all the Nash equilibrium ...
BibTeX reference
This paper presents a new branching strategy that is applied on the cost of a subproblem during the solution of a large-scale linear program by a column gene...
BibTeX reference
Due to the increasing popularity of automated guided vehicles in modern industry and the valuable investment they require, their design and operational issue...
BibTeX reference
This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing s...
BibTeX reference
This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...
BibTeX reference
We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...
BibTeX reference
We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...
BibTeX referenceThe Network of Logistics Decisions
This paper provides a framework for logistics decision-making by classifying logistics decisions and highlighting the relevant linkages among them. We focus ...
BibTeX reference
Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.
BibTeX reference
We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...
BibTeX reference
In this article, we optimally solve an integrated production and material handling scheduling problem. Traditionally, scheduling problems consider machines a...
BibTeX reference
We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...
BibTeX reference
Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d<sub>i</sub> - d<sub>j</sub></...
BibTeX reference
The paper analyzes a differential game model of a two-member marketing channel. A manufacturer invests in national advertising with the purpose of improving ...
BibTeX referenceDe professeur/chercheur à entrepreneur
Le texte qui suit est l'allocution donnée par le professeur Jacques Desrosiers à la Société Royale du Canada, le jeudi 14 novembre 2002, à l'Université du Qu...
BibTeX reference
This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...
BibTeX referenceRecent Trends in Arc Routing
Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The ...
BibTeX reference