Walk less, pick more: choosing optimal batches of orders in a warehouse
| dc.contributor.author | Sigvardsson, Martin | |
| dc.contributor.author | Persson, Christian | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.examiner | Seger, Carl-Johan | |
| dc.contributor.supervisor | Damaschke, Peter | |
| dc.date.accessioned | 2020-09-21T07:52:31Z | |
| dc.date.available | 2020-09-21T07:52:31Z | |
| dc.date.issued | 2020 | sv |
| dc.date.submitted | 2020 | |
| dc.description.abstract | Most warehouses employ a picker-to-parts strategy, where humans (termed pickers) traverse the warehouse to collect items. It is common for pickers to collect items for several orders at once. Such a set of orders is called a batch. Two optimization problems arise from this strategy. The picker routing problem refers to finding routes through the warehouse to minimize the distance traveled. The batching problem refers to selecting a combination of orders that minimizes the distance traveled. These problems are the focus of this thesis. To solve the optimization problems in the context of a real-world warehouse, a graph model representing a warehouse was created. In addition, a model was created for representing orders and batches as sets of nodes in such a graph. Additionally, a collection of algorithms was designed to solve the optimization problems. The models and the algorithms were implemented in code in the form of a library for the C# programming language. The library is accompanied by a suite of tests to help verify the correctness of the implementations. Furthermore, a suite of benchmarks was created based on real-world warehouse data supplied by the company Ongoing Warehouse. These benchmarks were used to evaluate the models and algorithms in terms of quality and runtime. Based on the evaluation, a recommendation was presented to Ongoing Warehouse of algorithms to use for integration into their warehouse management system. | sv |
| dc.identifier.coursecode | DATX05 | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/301743 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | Technology | |
| dc.subject | warehouse | sv |
| dc.subject | optimization | sv |
| dc.subject | picker routing | sv |
| dc.subject | order batching | sv |
| dc.subject | travelling salesperson problem | sv |
| dc.subject | benchmarks | sv |
| dc.subject | C# | sv |
| dc.title | Walk less, pick more: choosing optimal batches of orders in a warehouse | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H |
Ladda ner
Original bundle
1 - 1 av 1
Hämtar...
- Namn:
- CSE 20-77 Persson Sigvardsson.pdf
- Storlek:
- 1.91 MB
- Format:
- Adobe Portable Document Format
- Beskrivning:
- Walk less, pick more: choosing optimal batches of orders in a warehouse
License bundle
1 - 1 av 1
Hämtar...
- Namn:
- license.txt
- Storlek:
- 1.14 KB
- Format:
- Item-specific license agreed upon to submission
- Beskrivning: