• Corpus ID: 18299337

A simulated annealing approach to optimal storing in a multi-level warehouse

  title={A simulated annealing approach to optimal storing in a multi-level warehouse},
  author={Alexander Eckrot and Carina Geldhauser and Jan Jurczyk},
We propose a simulated annealing algorithm specifically tailored to optimise total retrieval times in a multi-level warehouse under complex pre-batched picking constraints. Experiments on real data from a picker-to-parts order picking process in the warehouse of a European manufacturer show that optimal storage assignments do not necessarily display features presumed in heuristics, such as clustering of positively correlated items or ordering of items by picking frequency. In an experiment run… 

Figures from this paper

An Efficient Storage Allocation in Warehouse to Minimize Travel Distance of Pickers
Order picking is the most labor-intensive and costly operation in warehouse. Efficient storage assignment rules enormously affect the order picking efficiency. Warehouse managers are concerned about
A simulated annealing algorithm to quantify patterns in astronomical data
We develop an optimization algorithm, using simulated annealing for the quantification of patterns in astronomical data based on techniques developed for robotic vision applications. The


Optimal allocation of goods in a warehouse: Minimizing the order picking costs under real-life constraints
  • Reinhard Kutzelnigg
  • Business
    3rd IEEE International Symposium on Logistics and Industrial Informatics
  • 2011
We optimize the average order picking time in warehouses, that are used in the food industry. However, the logistic process itself is not subject to change. We may influence the allocation of goods
Order batching to minimize total travel time in a parallel-aisle warehouse
This paper addresses the computational complexity of the batching of orders in a parallel-aisle warehouse and develops a branch-and-price optimization algorithm for the problem, model the problem as a generalized set partitioning problem and present a column generation algorithm to solve its linear programming relaxation.
Storage Location Assignment Problem: implementation in a warehouse design optimization tool
This paper focuses on possible improvements of common practices of warehouse storage management taking cue from Operations Research SLAP (Storage Location Assignment Problem), thus aiming to reach an