The reviewed record of science sign in
Pith

arxiv: 2402.03525 · v1 · pith:U3KJG7HY · submitted 2024-02-05 · cs.LG · cs.AI

Deep Reinforcement Learning for Picker Routing Problem in Warehousing

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:U3KJG7HYrecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords learningpickerproblemreinforcementcomplexityexistingheuristicsmethod
0
0 comments X
read the original abstract

Order Picker Routing is a critical issue in Warehouse Operations Management. Due to the complexity of the problem and the need for quick solutions, suboptimal algorithms are frequently employed in practice. However, Reinforcement Learning offers an appealing alternative to traditional heuristics, potentially outperforming existing methods in terms of speed and accuracy. We introduce an attention based neural network for modeling picker tours, which is trained using Reinforcement Learning. Our method is evaluated against existing heuristics across a range of problem parameters to demonstrate its efficacy. A key advantage of our proposed method is its ability to offer an option to reduce the perceived complexity of routes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.