Formulation of a Layout-Agnostic Order Batching Problem
(2021) 4th International Conference on Optimization and Learning, OLA 2021 In Communications in Computer and Information Science 1443. p.216-226- Abstract
To date, research on warehouse order-batching has been limited by reliance on rigid assumptions regarding rack layouts. Although efficient optimization algorithms have been provided for conventional warehouse layouts with Manhattan style blocks of racks, they are limited in that they fail to generalize to unconventional layouts. This paper builds on a generalized procedure for digitization of warehouses where racks and other obstacles are defined using two-dimensional polygons. We extend on this digitization procedure to introduce a layout-agnostic minisum formulation for the Order Batching Problem (OBP), together with a sub-problem for the OBP for a single vehicle, the single batch OBP. An algorithm which optimizes the single batch OBP... (More)
To date, research on warehouse order-batching has been limited by reliance on rigid assumptions regarding rack layouts. Although efficient optimization algorithms have been provided for conventional warehouse layouts with Manhattan style blocks of racks, they are limited in that they fail to generalize to unconventional layouts. This paper builds on a generalized procedure for digitization of warehouses where racks and other obstacles are defined using two-dimensional polygons. We extend on this digitization procedure to introduce a layout-agnostic minisum formulation for the Order Batching Problem (OBP), together with a sub-problem for the OBP for a single vehicle, the single batch OBP. An algorithm which optimizes the single batch OBP iteratively until an approximate solution to the OBP can be obtained, is discussed. The formulations will serve as the fundament for further work on layout-agnostic OBP optimization and generation of benchmark datasets. Experimental results for the digitization process involving various settings are presented.
(Less)
- author
- Oxenstierna, Johan LU ; van Rensburg, Louis Janse ; Malec, Jacek LU and Krueger, Volker LU
- organization
- publishing date
- 2021
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Order Batching Problem, Vehicle Routing, Warehouse digitization
- host publication
- Optimization and Learning - 4th International Conference, OLA 2021, Proceedings
- series title
- Communications in Computer and Information Science
- editor
- Dorronsoro, Bernabé ; Ruiz, Patricia ; Amodeo, Lionel and Pavone, Mario
- volume
- 1443
- pages
- 11 pages
- publisher
- Springer Science and Business Media B.V.
- conference name
- 4th International Conference on Optimization and Learning, OLA 2021
- conference location
- Virtual, Online
- conference dates
- 2021-06-21 - 2021-06-23
- external identifiers
-
- scopus:85115180662
- ISSN
- 1865-0937
- 1865-0929
- ISBN
- 9783030856717
- DOI
- 10.1007/978-3-030-85672-4_16
- project
- RobotLab LTH
- language
- English
- LU publication?
- yes
- id
- 456e55bf-d245-4d60-9d93-066f9f76a6d3
- date added to LUP
- 2021-10-04 15:40:40
- date last changed
- 2024-04-20 12:26:49
@inproceedings{456e55bf-d245-4d60-9d93-066f9f76a6d3, abstract = {{<p>To date, research on warehouse order-batching has been limited by reliance on rigid assumptions regarding rack layouts. Although efficient optimization algorithms have been provided for conventional warehouse layouts with Manhattan style blocks of racks, they are limited in that they fail to generalize to unconventional layouts. This paper builds on a generalized procedure for digitization of warehouses where racks and other obstacles are defined using two-dimensional polygons. We extend on this digitization procedure to introduce a layout-agnostic minisum formulation for the Order Batching Problem (OBP), together with a sub-problem for the OBP for a single vehicle, the single batch OBP. An algorithm which optimizes the single batch OBP iteratively until an approximate solution to the OBP can be obtained, is discussed. The formulations will serve as the fundament for further work on layout-agnostic OBP optimization and generation of benchmark datasets. Experimental results for the digitization process involving various settings are presented.</p>}}, author = {{Oxenstierna, Johan and van Rensburg, Louis Janse and Malec, Jacek and Krueger, Volker}}, booktitle = {{Optimization and Learning - 4th International Conference, OLA 2021, Proceedings}}, editor = {{Dorronsoro, Bernabé and Ruiz, Patricia and Amodeo, Lionel and Pavone, Mario}}, isbn = {{9783030856717}}, issn = {{1865-0937}}, keywords = {{Order Batching Problem; Vehicle Routing; Warehouse digitization}}, language = {{eng}}, pages = {{216--226}}, publisher = {{Springer Science and Business Media B.V.}}, series = {{Communications in Computer and Information Science}}, title = {{Formulation of a Layout-Agnostic Order Batching Problem}}, url = {{http://dx.doi.org/10.1007/978-3-030-85672-4_16}}, doi = {{10.1007/978-3-030-85672-4_16}}, volume = {{1443}}, year = {{2021}}, }