A comparative study between a genetic algorithm and a simulated annealing algorithm for solving the order batching problem
Optimizing warehouse automation requires finding efficient routes for pickingup items. Dividing the orders into batches is a realistic requirement for warehouses to have. This problem, known as the order batching problem, is an NP-hard problem. This thesis implements and compares two meta-heuristics...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för elektroteknik och datavetenskap (EECS)
2019
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254929 |