The Storage Location Assignment Problem An optimized simulated annealing algorithm - solving the storage location assignment problem with correlated batched orders
The main topic of this thesis is the storage location assignment problem, which can also be seen as a traveling salesman problem. The objective is to find the shortest path between items to be picked at a medium-sized warehouse. Orders come in batches consisting of items that will be assembled in-house. Therefore, it is essential to pick up all the items contained in the batch before they are drop
