Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)

Retour

Cahiers du GERAD

729 résultats — page 8 de 37

This paper addresses the optimization of mineral supply chain operations under metal and material type uncertainties. A mathematical model to simultaneously ...

référence BibTeX
, , et

This paper develops an efficient method to solve a typical combinatorial optimization problem that is frequently encountered when designing high levels of pr...

référence BibTeX

Dans cet article, nous étudions des stratégies pour résoudre le problème de partitionnement d'ensemble (PPE), en particulier les gains en efficacité qui pe...

référence BibTeX
, , et

Various disturbances such as adverse weather conditions may result in delayed or canceled flights and affect the optimized schedules planned for airline crew...

référence BibTeX

Cet article présente une approche structurée pour modéliser des contraintes logiques (expressions qui contiennent des propositions et des opérateurs logiques...

référence BibTeX

We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...

référence BibTeX
, et

The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) i...

référence BibTeX
, , et

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). F...

référence BibTeX
, , et

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic deman...

référence BibTeX
, , , et

Usually several neighborhood structures may be explored within a single local search algorithm. The simplest way is to define a single neighborhood as a unio...

référence BibTeX
, , et

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...

référence BibTeX
, , et

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

référence BibTeX

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...

référence BibTeX
, , , et

In this paper, we present a stochastic two-level optimization model whose upper-level problem depicts a wastewater treatment plant deciding on the size of co...

référence BibTeX
, et

In this paper we present a new rolling horizon approach for solving stochastic mixed complementarity problems (MCPs). Such a scheme allows for decision-depen...

référence BibTeX
, et

This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algor...

référence BibTeX
, , et

The airline crew scheduling problem involves assigning a group of crew members to scheduled flights over a planning horizon (usually a month) while respectin...

référence BibTeX

Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting...

référence BibTeX
, et

Le partage de gâteau est une métaphore très utilisée pour décrire les problèmes où un agent principal doit allouer des ressources de manière juste. De tels p...

référence BibTeX
, , et

Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...

référence BibTeX