Skip to main content
Skip to "About government"
Language selection
Français
Government of Canada /
Gouvernement du Canada
Search
Search the website
Search
Menu
Main
Menu
Jobs and the workplace
Immigration and citizenship
Travel and tourism
Business and industry
Benefits
Health
Taxes
Environment and natural resources
National security and defence
Culture, history and sport
Policing, justice and emergencies
Transport and infrastructure
Canada and the world
Money and finances
Science and innovation
You are here:
Canada.ca
Library and Archives Canada
Services
Services for galleries, libraries, archives and museums (GLAMs)
Theses Canada
Item – Theses Canada
Page Content
Item – Theses Canada
OCLC number
1431220099
Link(s) to full text
LAC copy
Author
Kucuksari, Zeynep.
Title
Optimal Order Batching for Automated Warehouse Picking.
Degree
Master of Applied Science -- University of Waterloo, 2023
Publisher
[Waterloo, Ontario] : University of Waterloo, 2023
Description
1 online resource
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.
Other link(s)
hdl.handle.net
uwspace.uwaterloo.ca
Date modified:
2022-09-01