Back to search

University of Waterloo

Optimal Order Batching for Automated Warehouse Picking

Abstract

dc:description.abstract

With the unexpected increase in demand and the need to minimize human interaction during the Covid-19 pandemic, companies have been forced to accelerate the transition from traditional to robotic mobile fulfillment systems. The key to a successful warehouse management system, whether traditional or automated, is an efficient order-picking process. In this study, we focus on the order batching problem, where items and orders are grouped into batches for simultaneous picking in automated warehouses that use autonomous picking carts. We propose five different mathematical models, including a generalized quadratic assignment model. We focus on the latter as it provides the best results and propose a Lagrangian relaxation to obtain lower bounds and an iterative Simulated Annealing (SA) algorithm that generates an initial solution using a K-means clustering algorithm. We carry out testing using an open-source dataset to assess the iterative SA algorithm in minimizing congestion and travel distance in an automated warehouse. We find that it finds solutions of good quality as measured by Lagrangian relaxation and is capable of solving large realistic instances. The solutions successfully minimize travel distance and reduce congestion by limiting path intersections.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kucuksari, Zeynep
Advisor dc:contributor.advisor
  • Elhedhli, Samir

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/19869

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Kucuksari, Zeynep. Optimal Order Batching for Automated Warehouse Picking. University of Waterloo, 2023. http://hdl.handle.net/10012/19869