学习快捷和入围订单履行决定
Learning to shortcut and shortlist order fulfillment deciding
摘要:
随着订单执行选项的增加和决策过程中考虑的业务目标的增加,订单执行决策变得越来越复杂。例如,随着从商店发货的出现,零售商现在有更多的履行节点要考虑,并且现在通常在制定履行决策时考虑许多不同的业务目标。随着复杂性的增加,决策过程的效率可能成为一个真正的问题。在所有可能的订单中找到最佳的履行分配可能成本太高,无法为每个订单完成,特别是在高峰期。在这项工作中,我们探索的可能性,开发规律性的履行决策过程中,以减轻负担的决策系统。通过使用数据采掘,我们的目标是在过去的履行决策,可以用来有效地预测未来的决策最有可能的分配模式。从本质上讲,那些可以以高置信度预测的分配可以用于捷径,或绕过昂贵的决定过程,或者一组最可能的分配可以用于入围-发送一组更小的候选人供履行决定系统考虑。
英文摘要:
With the increase of order fulfillment options and business objectives taken into consideration in the deciding process, order fulfillment deciding is becoming more and more complex. For example, with the advent of ship from store retailers now have many more fulfillment nodes to consider, and it is now common to take into account many and varied business goals in making fulfillment decisions. With increasing complexity, efficiency of the deciding process can become a real concern. Finding the optimal fulfillment assignments among all possible ones may be too costly to do for every order especially during peak times. In this work, we explore the possibility of exploiting regularity in the fulfillment decision process to reduce the burden on the deciding system. By using data mining we aim to find patterns in past fulfillment decisions that can be used to efficiently predict most likely assignments for future decisions. Essentially, those assignments that can be predicted with high confidence can be used to shortcut, or bypass, the expensive deciding process, or else a set of most likely assignments can be used for shortlisting -- sending a much smaller set of candidates for consideration by the fulfillment deciding system.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。