activity
20202026
most citedAverage-reward model-free reinforcement learning: a systematic review and literature mapping

17 citations · 21 across the 9 of their papers we have counts for

collaborators

9 papers

math.OC2026

Exact formulations for rectangular-warehouse single-picker routing with scattered storage in single-block and two-block layouts

George Dunn

Order picking travel dominates much of warehouse effort, and exact routing is especially valuable when storage is scattered so pick locations are not fixed in advance. We address t…

math.OC2026

Modified Dynamic Programming Algorithms for Order Picking in Single-Block and Two-Block Rectangular Warehouses

George Dunn, Elizabeth Stojanovski, Bishnu Lamichhane +2

Recent research has shown that optimal picker tours in rectangular warehouses exhibit deterministic travel patterns within each aisle, and that certain previously considered traver…

math.OC2025

Double Traversals in Boundary Subaisles: Implications for Two-Block Layouts

George Dunn, Elizabeth Stojanovski, Bishnu Lamichhane +2

The order picking problem seeks the shortest warehouse route that visits all required item locations. Strict conditions are known for single-block rectangular layouts under which o…

math.OC2025

Deterministic Structure of Vertical Configurations in Minimal Picker Tours for Rectangular Warehouses

George Dunn, Elizabeth Stojanovski, Bishnu Lamichhane +2

The picker routing problem seeks the shortest tour through a warehouse that visits every item in a given pick-list and returns to the depot. For rectangular warehouses, dynamic pro…

math.OC2025

Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks

George Dunn, Hadi Charkhgard, Ali Eshragh +1

Order picking is a process that involves collecting items from their respective locations within a warehouse. There exist dynamic programming algorithms for finding the minimal pic…

math.OC2024

A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse

George Dunn, Hadi Charkhgard, Ali Eshragh +1

The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dyna…

math.OC2024★ 2 cited

Deep Reinforcement Learning for Dynamic Order Picking in Warehouse Operations

Sasan Mahmoudinazlou, Abhay Sobhanan, Hadi Charkhgard +2

Order picking is a pivotal operation in warehouses that directly impacts overall efficiency and profitability. This study addresses the dynamic order picking problem, a significant…

cs.LG2024★ 2 cited

Deep Reinforcement Learning for Picker Routing Problem in Warehousing

George Dunn, Hadi Charkhgard, Ali Eshragh +2

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 freque…

cs.LG2020★ 17 cited

Average-reward model-free reinforcement learning: a systematic review and literature mapping

Vektor Dewanto, George Dunn, Ali Eshragh +2

Reinforcement learning is important part of artificial intelligence. In this paper, we review model-free reinforcement learning that utilizes the average reward optimality criterio…