Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
792 results — page 30 of 40
Regards sur la découverte
Quatre regards sur la découverte, ceux du psychologue, de l'historien, du sociologue et du cognicien sont évoqués en quelques remarques illustrées d'exemples.
BibTeX reference
Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...
BibTeX referenceBoundary Uniqueness of Fusenes
It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...
BibTeX reference
The paper deals with the problem of sustaining over time a coordinated outcome in a two-member channel of distribution. In a dynamic game of pricing and ad...
BibTeX reference
Variable Neighborhood Search is a recent metaheuristic based on the idea of systematic change of neighborhood during both a descent phase and an exploration...
BibTeX reference
In this paper, we prove that the maximum <i>k</i>-club problem defined on an undirected graph is NP-hard. We also give an integer programming formulation f...
BibTeX reference
The definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for struc...
BibTeX reference
This article is a survey of heuristics for the <i>Vehicle Routing Problem</i>. It is divided into two parts: classical and modern heuristics. The first pa...
BibTeX reference
A new local search heuristic, called J-MEANS, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solut...
BibTeX reference
This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single...
BibTeX reference
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from loc...
BibTeX reference
This paper focuses on accelerating strategies used in conjunction with column generation to solve Vehicle Routing and Crew Scheduling problems. We describ...
BibTeX reference
Over the last thirty-five years several heuristics have been proposed for the <i>Vehicle Routing problem</i>. This article reviews the main classical heuris...
BibTeX reference
In recent years several <i>metaheuristics</i> have been proposed for the <i>Vehicle Routing Problem</i>. This article reviews the main metaheuristics for th...
BibTeX reference
The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties ...
BibTeX reference
Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...
BibTeX reference
This paper aims to provide an answer to the still open question, namely who should, if any, lead a marketing channel? To achieve this objective, we conside...
BibTeX reference
Il est généralement reconnu que le processus de découpage électoral doit être à l'abri du gerrymandering et de l'intervention politique. L'utilisation de mé...
BibTeX reference
The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. Th...
BibTeX reference
The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...
BibTeX reference