Branch-Cut-and-Price algorithm for an Operational Storage Location Assignment Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Branch-Cut-and-Price algorithm for an Operational Storage Location Assignment Problem

Résumé

The Storage Location Assignment Problem in warehousing have been seldomly tackled by exact methods when considering the exact demand over a time horizon (e.g. the set of orders with different items to retrieve). In this presentation we present a novel extended formulation of the problem that is independant from both: i. the warehouse layout and ii. The picker routing policy. These two aspects are convexified in the subproblems. This formulation is solved by a column-generation algorithm with decomposed pricing problems, embedded in a Branch-Cut-and-Price. Several polynomial and exponential families of valid inequalities are derived to enhance the resolution framework. Preliminary results show a major improvement of the dual bound between a compact mixed-integer formulation and the extended one. The results of the Branch-Cut-and-Price algorithm are competitive compared to commercial solvers. Further work is ongoing to further speed-up the solution method.
Fichier principal
Vignette du fichier
ROADEF_2022.pdf (207.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03595258 , version 1 (03-03-2022)

Identifiants

  • HAL Id : hal-03595258 , version 1

Citer

Thibault Prunet, Nabil Absi, Valeria Borodin, Diego Cattaruzza. Branch-Cut-and-Price algorithm for an Operational Storage Location Assignment Problem. ROADEF 2022 - 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595258⟩
93 Consultations
83 Téléchargements

Partager

Gmail Facebook X LinkedIn More