Skip to Main content Skip to Navigation
Conference papers

A column generation approach for the joint order batching and picker routing problem

Olivier Briant 1 Hadrien Cambazard 2 Diego Cattaruzza 3 Nicolas Catusse 2 Anne-Laure Ladier 4 Maxime Ogier 5
1 G-SCOP_OC [2016-2019] - Optimisation Combinatoire [2016-2019]
G-SCOP [2016-2019] - Laboratoire des sciences pour la conception, l'optimisation et la production [2016-2019]
2 G-SCOP_ROSP [2016-2019] - Recherche Opérationnelle pour les Systèmes de Production [2016-2019]
G-SCOP [2016-2019] - Laboratoire des sciences pour la conception, l'optimisation et la production [2016-2019]
3 INOCS - Integrated Optimization with Complex Structure
Inria Lille - Nord Europe, ULB - Université libre de Bruxelles, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : 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 routess 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. In order to tackle the exponential number of variables, we develop a column generation heuristic with performance guarantee. The pricing problem approximates the distances, and when finding a solution the oracle is used to get the optimal distance of this solution. The performance of the proposed column generation is strengthen using stabilization techniques and a rich column set. 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02317032
Contributor : Maxime Ogier <>
Submitted on : Tuesday, October 15, 2019 - 5:42:49 PM
Last modification on : Wednesday, September 16, 2020 - 11:26:03 AM

Identifiers

  • HAL Id : hal-02317032, version 1

Citation

Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, et al.. A column generation approach for the joint order batching and picker routing problem. VeRoLog 2019 - Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization, Jun 2019, Seville, Spain. ⟨hal-02317032⟩

Share

Metrics

Record views

105