Formulation of a Layout-Agnostic Order Batching Problem

Johan Oxenstierna; Louis Janse van Rensburg; Jacek Malec; Volker Krueger

doi:10.1007/978-3-030-85672-4_16

Formulation of a Layout-Agnostic Order Batching Problem

Johan Oxenstierna, Louis Janse van Rensburg, Jacek Malec, Volker Krueger

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

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 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.

Original language	English
Title of host publication	Optimization and Learning - 4th International Conference, OLA 2021, Proceedings
Editors	Bernabé Dorronsoro, Patricia Ruiz, Lionel Amodeo, Mario Pavone
Publisher	Springer Science and Business Media B.V.
Pages	216-226
Number of pages	11
ISBN (Print)	9783030856717
DOIs	https://doi.org/10.1007/978-3-030-85672-4_16
Publication status	Published - 2021
Event	4th International Conference on Optimization and Learning, OLA 2021 - Virtual, Online Duration: 2021 Jun 21 → 2021 Jun 23

Publication series

Name	Communications in Computer and Information Science
Volume	1443
ISSN (Print)	1865-0929
ISSN (Electronic)	1865-0937

Conference

Conference	4th International Conference on Optimization and Learning, OLA 2021
City	Virtual, Online
Period	2021/06/21 → 2021/06/23

Subject classification (UKÄ)

Control Engineering

Free keywords

Order Batching Problem
Vehicle Routing
Warehouse digitization

Access to Document

10.1007/978-3-030-85672-4_16

Cite this

Oxenstierna, J., van Rensburg, L. J., Malec, J., & Krueger, V. (2021). Formulation of a Layout-Agnostic Order Batching Problem. In B. Dorronsoro, P. Ruiz, L. Amodeo, & M. Pavone (Eds.), Optimization and Learning - 4th International Conference, OLA 2021, Proceedings (pp. 216-226). (Communications in Computer and Information Science; Vol. 1443). Springer Science and Business Media B.V.. https://doi.org/10.1007/978-3-030-85672-4_16

Oxenstierna, Johan ; van Rensburg, Louis Janse ; Malec, Jacek et al. / Formulation of a Layout-Agnostic Order Batching Problem. Optimization and Learning - 4th International Conference, OLA 2021, Proceedings. editor / Bernabé Dorronsoro ; Patricia Ruiz ; Lionel Amodeo ; Mario Pavone. Springer Science and Business Media B.V., 2021. pp. 216-226 (Communications in Computer and Information Science).

@inproceedings{456e55bfd2454d609d93066f9f76a6d3,

title = "Formulation of a Layout-Agnostic Order Batching Problem",

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 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.",

keywords = "Order Batching Problem, Vehicle Routing, Warehouse digitization",

author = "Johan Oxenstierna and {van Rensburg}, {Louis Janse} and Jacek Malec and Volker Krueger",

year = "2021",

doi = "10.1007/978-3-030-85672-4_16",

language = "English",

isbn = "9783030856717",

series = "Communications in Computer and Information Science",

publisher = "Springer Science and Business Media B.V.",

pages = "216--226",

editor = "Bernab{\'e} Dorronsoro and Patricia Ruiz and Lionel Amodeo and Mario Pavone",

booktitle = "Optimization and Learning - 4th International Conference, OLA 2021, Proceedings",

address = "United States",

note = "4th International Conference on Optimization and Learning, OLA 2021 ; Conference date: 21-06-2021 Through 23-06-2021",

}

Oxenstierna, J, van Rensburg, LJ, Malec, J & Krueger, V 2021, Formulation of a Layout-Agnostic Order Batching Problem. in B Dorronsoro, P Ruiz, L Amodeo & M Pavone (eds), Optimization and Learning - 4th International Conference, OLA 2021, Proceedings. Communications in Computer and Information Science, vol. 1443, Springer Science and Business Media B.V., pp. 216-226, 4th International Conference on Optimization and Learning, OLA 2021, Virtual, Online, 2021/06/21. https://doi.org/10.1007/978-3-030-85672-4_16

Formulation of a Layout-Agnostic Order Batching Problem. / Oxenstierna, Johan; van Rensburg, Louis Janse; Malec, Jacek et al.
Optimization and Learning - 4th International Conference, OLA 2021, Proceedings. ed. / Bernabé Dorronsoro; Patricia Ruiz; Lionel Amodeo; Mario Pavone. Springer Science and Business Media B.V., 2021. p. 216-226 (Communications in Computer and Information Science; Vol. 1443).

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

TY - GEN

T1 - Formulation of a Layout-Agnostic Order Batching Problem

AU - Oxenstierna, Johan

AU - van Rensburg, Louis Janse

AU - Malec, Jacek

AU - Krueger, Volker

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

KW - Order Batching Problem

KW - Vehicle Routing

KW - Warehouse digitization

UR - http://www.scopus.com/inward/record.url?scp=85115180662&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-85672-4_16

DO - 10.1007/978-3-030-85672-4_16

M3 - Paper in conference proceeding

AN - SCOPUS:85115180662

SN - 9783030856717

T3 - Communications in Computer and Information Science

SP - 216

EP - 226

BT - Optimization and Learning - 4th International Conference, OLA 2021, Proceedings

A2 - Dorronsoro, Bernabé

A2 - Ruiz, Patricia

A2 - Amodeo, Lionel

A2 - Pavone, Mario

PB - Springer Science and Business Media B.V.

T2 - 4th International Conference on Optimization and Learning, OLA 2021

Y2 - 21 June 2021 through 23 June 2021

ER -

Oxenstierna J, van Rensburg LJ, Malec J , Krueger V. Formulation of a Layout-Agnostic Order Batching Problem. In Dorronsoro B, Ruiz P, Amodeo L, Pavone M, editors, Optimization and Learning - 4th International Conference, OLA 2021, Proceedings. Springer Science and Business Media B.V. 2021. p. 216-226. (Communications in Computer and Information Science). doi: 10.1007/978-3-030-85672-4_16

Formulation of a Layout-Agnostic Order Batching Problem

Abstract

Publication series

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Other files and links

Fingerprint

RobotLab LTH

RobotLab LTH Infrastructure

Cite this

Formulation of a Layout-Agnostic Order Batching Problem

Abstract

Publication series

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Other files and links

Fingerprint

Projects

RobotLab LTH

Equipment

RobotLab LTH Infrastructure

Cite this