activity
20182026
most citedDeep Reinforcement Learning for Picker Routing Problem in Warehousing

2 citations · 5 across the 14 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

math.OC2024

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data

Elizabeth Harris, Ali Eshragh, Bishnu Lamichhane +2

The Minimum Volume Covering Ellipsoid (MVCE) problem, characterised by observations in dimensions where , can be computationally very expensive in the big data reg…

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.OC20242 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…

math.ST2024

Optimal Experimental Design for Partially Observable Pure Birth Processes

Ali Eshragh, Matthew P. Skerritt, Bruno Salvy +1

We develop an efficient algorithm to find optimal observation times by maximizing the Fisher information for the birth rate of a partially observable pure birth process involving $…

cs.LG20242 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…