An efficient and general approach for the ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
An efficient and general approach for the joint order batching and picker routing problem
Auteur(s) :
Briant, Olivier [Auteur]
Optimisation Combinatoire [G-SCOP_OC]
Cambazard, Hadrien [Auteur]
Recherche Opérationnelle pour les Systèmes de Production [G-SCOP_ROSP]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Catusse, Nicolas [Auteur]
Recherche Opérationnelle pour les Systèmes de Production [G-SCOP_ROSP]
Ladier, Anne-Laure [Auteur]
Décision et Information pour les Systèmes de Production [DISP]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Optimisation Combinatoire [G-SCOP_OC]
Cambazard, Hadrien [Auteur]
Recherche Opérationnelle pour les Systèmes de Production [G-SCOP_ROSP]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Catusse, Nicolas [Auteur]
Recherche Opérationnelle pour les Systèmes de Production [G-SCOP_ROSP]
Ladier, Anne-Laure [Auteur]
Décision et Information pour les Systèmes de Production [DISP]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Titre de la revue :
European Journal of Operational Research
Pagination :
497-512
Éditeur :
Elsevier
Date de publication :
2020-09
ISSN :
0377-2217
Mot(s)-clé(s) en anglais :
order batching
picker routing
column generation
picker routing
column generation
Discipline(s) HAL :
Sciences cognitives/Informatique
Computer Science [cs]/Operations Research [math.OC]
Computer Science [cs]/Operations Research [math.OC]
Résumé en anglais : [en]
Order picking is the process of retrieving products from inventory. It is mostly done manually by dedicated employees called pickers and is considered the most expensive of warehouse operations. To reduce the picking cost, ...
Lire la suite >Order picking is the process of retrieving products from inventory. It is mostly done manually by dedicated employees called pickers and is considered the most expensive of warehouse operations. To reduce the picking cost, customer orders can be grouped into batches that are then collected by traveling the shortest possible distance.This work presents an exponential linear programming formulation to tackle the joint order batching and picker routing problem. Variables, or columns, are related to the picking routes in the warehouse. Computing such routes is generally an intractable routing problem and relates to the well known traveling salesman problem (TSP). Nonetheless, the rectangular warehouse’s layouts can be used to efficiently solve the corresponding TSP and take into account in the development of an efficient subroutine, called oracle. We therefore investigate whether such an oracle allows for an effective exponential formulation.Experimented on a publicly available benchmark, the algorithm proves to be very effective. It improves many of the best known solutions and provides very strong lower bounds. Finally, this approach is applied to another industrial case to demonstrate its interest for this field of application.Lire moins >
Lire la suite >Order picking is the process of retrieving products from inventory. It is mostly done manually by dedicated employees called pickers and is considered the most expensive of warehouse operations. To reduce the picking cost, customer orders can be grouped into batches that are then collected by traveling the shortest possible distance.This work presents an exponential linear programming formulation to tackle the joint order batching and picker routing problem. Variables, or columns, are related to the picking routes in the warehouse. Computing such routes is generally an intractable routing problem and relates to the well known traveling salesman problem (TSP). Nonetheless, the rectangular warehouse’s layouts can be used to efficiently solve the corresponding TSP and take into account in the development of an efficient subroutine, called oracle. We therefore investigate whether such an oracle allows for an effective exponential formulation.Experimented on a publicly available benchmark, the algorithm proves to be very effective. It improves many of the best known solutions and provides very strong lower bounds. Finally, this approach is applied to another industrial case to demonstrate its interest for this field of application.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-02078547/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02078547/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02078547/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- 2019_An%20efficient%20and%20general%20approach%20for%20the%20JOBPRP.pdf
- Accès libre
- Accéder au document
- 2019_An%20efficient%20and%20general%20approach%20for%20the%20JOBPRP.pdf
- Accès libre
- Accéder au document