Deep Reinforcement Learning for Picker Routing Problem in Warehousing

George Dunn, Hadi Charkhgard, Ali Eshragh, Sasan Mahmoudinazlou, Elizabeth Stojanovski
2/5/2024
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dunn2024deep,
  title  = {Deep Reinforcement Learning for Picker Routing Problem in Warehousing},
  author = {George Dunn and Hadi Charkhgard and Ali Eshragh and Sasan Mahmoudinazlou and Elizabeth Stojanovski},
  year   = {2024},
  eprint = {2402.03525},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.03525v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.03525.svg)](https://codeofpaper.com/paper/2402.03525)

Discussion