This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...

This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...

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...

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 ...

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...

Due to the increasing popularity of automated guided vehicles in modern industry and the valuable investment they require, their design and operational issue...

This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing s...

This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...

We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...

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 ...

This paper provides a framework for logistics decision-making by classifying logistics decisions and highlighting the relevant linkages among them. We focus ...

Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...

In this article, we optimally solve an integrated production and material handling scheduling problem. Traditionally, scheduling problems consider machines a...

We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...

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_i - d_j</...

The paper analyzes a differential game model of a two-member marketing channel. A manufacturer invests in national advertising with the purpose of improving ...

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...

This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...