2 citations · 2 across the 5 of their papers we have counts for
5 papers
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…
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 $…
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…
SALSA: Sequential Approximate Leverage-Score Algorithm with Application in Analyzing Big Time Series Data
Ali Eshragh, Luke Yerbury, Asef Nazari +2
We develop a new efficient sequential approximate leverage score algorithm, SALSA, using methods from randomized numerical linear algebra (RandNLA) for large matrices. We demonstra…
Toeplitz Least Squares Problems, Fast Algorithms and Big Data
Ali Eshragh, Oliver Di Pietro, Michael A. Saunders
In time series analysis, when fitting an autoregressive model, one must solve a Toeplitz ordinary least squares problem numerous times to find an appropriate model, which can sever…