KIVA仓库中多站点的联合订单分配与拣选站调度
Joint order assignment and picking station scheduling in KIVA warehouses with multiple stations
AI总结：
针对KIVA仓库多站点问题，提出联合订单分配与拣选站调度的数学模型及模拟退火束搜索算法，显著减少货架访问次数。
摘要：
我们考虑在机器人辅助的KIVA仓库中，将订单分配到多个站点，并对每个站点内相互关联的订单与货架处理流程进行排序的问题。该问题涉及的各种决策紧密相关且必须实时求解，为便于处理，通常被分开解决。然而，利用订单分配与拣选站调度之间的协同作用有利于提高拣选效率。我们开发了一个考虑这种协同作用的综合数学模型，以最小化货架访问总次数。为解决这一棘手问题，我们提出了一种基于模拟退火和束搜索的高效算法。计算研究表明，与基于规则的贪心策略和独立的拣选站调度方法相比，我们提出的方法在解质量上更优，分别节省了超过三分之一的货架访问次数和五分之一的货架访问次数。
英文摘要：
We consider the problem of allocating orders to multiple stations and sequencing the interlinked order and rack processing flows in each station in the robot-assisted KIVA warehouse. The various decisions involved in the problem, which are closely associated and must be solved in real time, are often tackled separately for ease of treatment. However, exploiting the synergy between order assignment and picking station scheduling benefits picking efficiency. We develop a comprehensive mathematical model that takes the synergy into consideration to minimize the total number of rack visits. To solve this intractable problem, we develop an efficient algorithm based on simulated annealing and beam search. Computational studies show that our proposed approach outperforms the rule-based greedy policy and the independent picking station scheduling method in terms of solution quality, saving over one-third and one-fifth of rack visits compared with the former and latter, respectively.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
