Abstract
This article addresses an integrated warehouse order picking problem. The company HappyChic is specialized in men’s ready-to-wear. A central warehouse is dedicated to supplying, every day, the shops of one brand. We focus on the picking area of this warehouse which relies on human picking system. For each picking wave (period of a working day), a set of customer orders has to be prepared. An order is a set of product references, with quantities, i.e., the numbers of items required. The problem consists in jointly deciding: (1) the division of orders into several boxes, respecting weight and size constraints; (2) the batching of boxes into trolleys, that implicitly defines the routing into the picking area. The objective function aims to minimize the total distance. To deal with the large size instances of HappyChic in short computation times, we design a heuristic method based on the split and dynamic programming paradigms. The results are very convincing: the total covered distance decreases by more than 20%. Moreover, we propose an adaptation of the algorithm to prepare homogeneous boxes with respect to classes of products. The logistic department of HappyChic is convinced by results obtained in this research work, and the warehouse management system is currently being updated in order to integrate the proposed algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Beasley, J.: Route first-cluster second for vehicle routing methods. Omega 2(4), 403–408 (1983)
de Koster, R., Le-Duc, T., Roodbergen, K.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182(2), 481–501 (2007)
Ecommerce europe.: https://www.ecommerce-europe.eu/ (2017). Accessed 24 Oct 2017
Gademann, N., van de Velde, S.: Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans. 37(1), 63–75 (2005). https://doi.org/10.1080/07408170590516917
Marchet, G., Melacini, M., Perotti, S.: Investigating order picking system adoption: a case-study-based approach. Int J. Logist. Res. Appl. 18(1), 82–98 (2015)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)
Scholz, A., Wäscher, G.: Order batching and picker routing in manual order picking systems: the benefits of integrated routing. Central Eur. J. Oper. Res. 25(2), 491–520 (2017)
Valle, C.A., Beasley, J.E., da Cunha, A.S.: Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262(3), 817–834 (2017). https://doi.org/10.1016/j.ejor.2017.03.069
Acknowledgements
The authors warmly thank the HappyChic project team for this fruitful collaboration: Anne Grosset, Céline Brasseur, Emilie Delannoye, Elisabete Dierkens and Bruno Valleret. Thanks are also due to the referees for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bué, M., Cattaruzza, D., Ogier, M., Semet, F. (2019). A Two-Phase Approach for an Integrated Order Batching and Picker Routing Problem. In: Dell'Amico, M., Gaudioso, M., Stecca, G. (eds) A View of Operations Research Applications in Italy, 2018. AIRO Springer Series, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-030-25842-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-25842-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25841-2
Online ISBN: 978-3-030-25842-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)