A heuristic approach for the online order batching problem with multiple pickers. (October 2021)
- Record Type:
- Journal Article
- Title:
- A heuristic approach for the online order batching problem with multiple pickers. (October 2021)
- Main Title:
- A heuristic approach for the online order batching problem with multiple pickers
- Authors:
- Gil-Borrás, Sergio
Pardo, Eduardo G.
Alonso-Ayuso, Antonio
Duarte, Abraham - Abstract:
- Abstract: The Online Order Batching Problem with Multiple Pickers (OOBPMP) consists of optimizing the operations related to the picking process of orders in a warehouse, when the picking policy follows an order batching strategy. In this case, this variant of the well-known Order Batching Problem considers the existence of multiple workers in the warehouse and an online arrival of the orders. We study three different objective functions for the problem: minimizing the completion time, minimizing the picking time, and minimizing the differences in the workload among the pickers. We have identified and classified all previous works in the literature for the OOBPMP. Finally, we propose a multistart procedure hybridized with a Variable Neighborhood Descent metaheuristic to handle the problem. We test our proposal over well-known instances previously reported in the literature by empirically comparing the performance of our proposal with previous methods in the state of the art. The statistical tests corroborated the significance of the results obtained. Highlights: Literature review of the Online Order Batching Problem with multiple pickers (OOBPMP). Analysis of the previous methods in the state of the art for the OOBPMP. A new algorithmic proposal based on metaheuristics for the problem. An empirical study of several objective functions to tackle the OOBPMP. The improvement over previous methods in the literature is supported by statistical tests.
- Is Part Of:
- Computers & industrial engineering. Volume 160(2021)
- Journal:
- Computers & industrial engineering
- Issue:
- Volume 160(2021)
- Issue Display:
- Volume 160, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 160
- Issue:
- 2021
- Issue Sort Value:
- 2021-0160-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-10
- Subjects:
- Online Order Batching Problem -- Multiple pickers -- Multistart search -- Variable Neighborhood Descent
Engineering -- Data processing -- Periodicals
Industrial engineering -- Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03608352 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cie.2021.107517 ↗
- Languages:
- English
- ISSNs:
- 0360-8352
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.713000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 18649.xml