Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Storage Assignment using Nested Annealing and Hamming Distances

Oxenstierna, Johan LU orcid ; van Rensburg, Louis Janse ; Stuckey, Peter J. and Krueger, Volker LU orcid (2023) 12th International Conference on Operations Research and Enterprise Systems, ICORES 2023 p.94-105
Abstract
The assignment of products to storage locations significantly impacts the efficiency of warehouse operations. We propose a multi-phase optimizer for a Storage Location Assignment Problem (SLAP) where solution quality is based on a distance estimate of future-forecasted order picking. Candidate assignments are first sampled using a Markov Chain accept/reject method. Future-forecasted pick-rounds are then modified according to the candidate assignments and solved as Traveling Salesman Problems (TSP). The model is graph-based and generalizes to any obstacle layout in 2D. Due to the intractability of the SLAP, methods are proposed to speed up search for strong solution candidates. These include usage of fast function approximation to find... (More)
The assignment of products to storage locations significantly impacts the efficiency of warehouse operations. We propose a multi-phase optimizer for a Storage Location Assignment Problem (SLAP) where solution quality is based on a distance estimate of future-forecasted order picking. Candidate assignments are first sampled using a Markov Chain accept/reject method. Future-forecasted pick-rounds are then modified according to the candidate assignments and solved as Traveling Salesman Problems (TSP). The model is graph-based and generalizes to any obstacle layout in 2D. Due to the intractability of the SLAP, methods are proposed to speed up search for strong solution candidates. These include usage of fast function approximation to find potentially strong samples, as well as restarts from local minima. Results show that these methods improve performance and that total travel distance can be reduced by as much as 30% within 8 hours of CPU-time. We share a public repository with SLAP ins tances and corresponding benchmark results on the generalizable TSPLIB format. (Less)
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
Proceedings of the 12th International Conference on Operations Research and Enterprise Systems
pages
94 - 105
publisher
SciTePress
conference name
12th International Conference on Operations Research and Enterprise Systems, ICORES 2023
conference location
Lisbon, Portugal
conference dates
2023-02-19 - 2023-02-21
external identifiers
  • scopus:85172767944
ISBN
978-989-758-627-9
DOI
10.5220/0011785100003396
language
English
LU publication?
yes
id
87f74cef-2c31-4ff3-9a04-3062076de719
date added to LUP
2023-10-30 12:18:11
date last changed
2023-11-21 23:50:44
@inproceedings{87f74cef-2c31-4ff3-9a04-3062076de719,
  abstract     = {{The assignment of products to storage locations significantly impacts the efficiency of warehouse operations. We propose a multi-phase optimizer for a Storage Location Assignment Problem (SLAP) where solution quality is based on a distance estimate of future-forecasted order picking. Candidate assignments are first sampled using a Markov Chain accept/reject method. Future-forecasted pick-rounds are then modified according to the candidate assignments and solved as Traveling Salesman Problems (TSP). The model is graph-based and generalizes to any obstacle layout in 2D. Due to the intractability of the SLAP, methods are proposed to speed up search for strong solution candidates. These include usage of fast function approximation to find potentially strong samples, as well as restarts from local minima. Results show that these methods improve performance and that total travel distance can be reduced by as much as 30% within 8 hours of CPU-time. We share a public repository with SLAP ins tances and corresponding benchmark results on the generalizable TSPLIB format.}},
  author       = {{Oxenstierna, Johan and van Rensburg, Louis Janse and Stuckey, Peter J. and Krueger, Volker}},
  booktitle    = {{Proceedings of the 12th International Conference on Operations Research and Enterprise Systems}},
  isbn         = {{978-989-758-627-9}},
  language     = {{eng}},
  pages        = {{94--105}},
  publisher    = {{SciTePress}},
  title        = {{Storage Assignment using Nested Annealing and Hamming Distances}},
  url          = {{http://dx.doi.org/10.5220/0011785100003396}},
  doi          = {{10.5220/0011785100003396}},
  year         = {{2023}},
}