Cet article identifie pour chaque fonction logistique les décisions à prendre et propose une séquence organisée de façon à constituer un processus décisionn...

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution appro...

Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...

In recent years, several advances have been made towards the solution of stochastic vehicle routing problems (SVRPs). In particular, the Integer <i>L</i>-Sh...

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacita...

This article describes a method for solving the crew rostering problem in air transportation. This problem consists of constructing personalized schedules ...

This paper describes the Preferential Bidding Problem solved in the airline industry to construct personalized monthly schedules for pilots and officers. T...

This article describes the results of a study aimed at improving linen delivery operations in a large teaching hospital in Montreal. Improvements over the p...

We propose a common solution approach for different crew scheduling problems arising at the planning and operational levels in the airline industry. Specifi...

This paper introduces a strong valid inequality, the 2-path cut, to produce better lower bounds for the Vehicle Routing Problem with Time Windows (VRPTW). ...

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a fl...

The need for an integrating framework for vehicle routing and crew scheduling problems has been apparent for some time. While several attempts have been ma...

Consider a set <i>L</i> of potential locations for <i>p</i> facilities and a set <i>U</i> of locations of given users. The <i>p</i>-median problem is to loc...

<i>Extensive facilities</i> are structures that are too large to be considered as single points. In the first part of this paper we propose integer program...

We study the set of lower bounds which have been proposed for the numbering of a complete graph. We first show that the computation of most of them can be ...

This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...

Good heuristic solutions for large Multisource Weber problems can be obtained by solving related <i>p</i>-median problems in which potential locations of th...