loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Johan Oxenstierna 1 ; 2 ; Louis van Rensburg 3 ; Peter Stuckey 4 and Volker Krueger 1

Affiliations: 1 Dept. of Computer Science, Lund University, Lund, Sweden ; 2 Kairos Logic AB, Lund, Sweden ; 3 Optisol, 90 Sippy Downs Dr, QLD, Australia ; 4 Faculty of Information Technology, Monash University, Australia

Keyword(s): Storage Location Assignment Problem, Nested Annealing, Hamming Distances.

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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.217.182.45

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Oxenstierna, J.; van Rensburg, L.; Stuckey, P. and Krueger, V. (2023). Storage Assignment Using Nested Annealing and Hamming Distances. In Proceedings of the 12th International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-627-9; ISSN 2184-4372, SciTePress, pages 94-105. DOI: 10.5220/0011785100003396

@conference{icores23,
author={Johan Oxenstierna. and Louis {van Rensburg}. and Peter Stuckey. and Volker Krueger.},
title={Storage Assignment Using Nested Annealing and Hamming Distances},
booktitle={Proceedings of the 12th International Conference on Operations Research and Enterprise Systems - ICORES},
year={2023},
pages={94-105},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011785100003396},
isbn={978-989-758-627-9},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 12th International Conference on Operations Research and Enterprise Systems - ICORES
TI - Storage Assignment Using Nested Annealing and Hamming Distances
SN - 978-989-758-627-9
IS - 2184-4372
AU - Oxenstierna, J.
AU - van Rensburg, L.
AU - Stuckey, P.
AU - Krueger, V.
PY - 2023
SP - 94
EP - 105
DO - 10.5220/0011785100003396
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic