Product allocation problem for an AS/RS with multiple in-the-aisle pick positions
Product allocation problem for an AS/RS with multiple in-the-aisle pick positions
复制标题
DOI：
10.1080/0740817x.2015.1027458
复制
发表时间：
2015-07
期刊：
影响因子：
--
通讯作者：
F. Ramtin;Jennifer A. Pazour
中科院分区：
文献类型：
--
作者：
F. Ramtin;Jennifer A. Pazour
具有多个过道内拣货位置的自动化仓储/检索系统是一种广泛应用于配送中心的半自动案例级订单履行技术。我们研究了在不同的运营策略、需求概况和形状因素下，产品挑库位置分配对预期吞吐量的影响。我们开发了复杂度为O(nlog(N))的高效算法，提供最小化期望行程时间的任务。此外，对于不同的运营策略、形状配置和需求曲线，我们探索了挑选位置的产品最优配置的结构，并量化了使用简单、实用的配置策略与最优配置之间的差异。最后，通过使用连续的需求曲线来近似最优配流的期望行程时间，并假设过道上有无限多个拣货位置，我们得到了闭合形式的解析行程时间模型。我们说明，这些连续模型在估计离散货架的行程时间方面效果很好，并使用它们来寻找最优设计配置。
An automated storage/retrieval system with multiple in-the-aisle pick positions is a semi-automated case-level order fulfillment technology that is widely used in distribution centers. We study the impact of product to pick position assignments on the expected throughput for different operating policies, demand profiles, and shape factors. We develop efficient algorithms of complexity O(nlog(n)) that provide the assignment that minimizes the expected travel time. Also, for different operating policies, shape configurations, and demand curves, we explore the structure of the optimal assignment of products to pick positions and quantify the difference between using a simple, practical assignment policy versus the optimal assignment. Finally, we derive closed-form analytical travel time models by approximating the optimal assignment's expected travel time using continuous demand curves and assuming an infinite number of pick positions in the aisle. We illustrate that these continuous models work well in estimating the travel time of a discrete rack and use them to find optimal design configurations.