arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.04567eess.SYcs.SY
收藏

一种模拟驱动的分拣中心作业调度优化算法

A simulation driven optimization algorithm for scheduling sorting center operations

Supratim Ghosh, Aritra Pal, Prashant Kumar, Ankush Ojha, Aditya Paranjape, Souvik Barat, Harshad Khadilkar

摘要:

物流企业中的包裹分拣操作旨在通过分拣中心实现包裹的高吞吐量。这些分拣中心由大型圆形传送带组成,传入的包裹被放置在其上,多个臂被称为斜槽,用于按目的地分拣包裹,然后包装到滚筒笼中并装载到出站卡车上。现代分拣系统需要用复杂的算法和软件来补充其硬件创新,以将目的地和劳动力映射到特定的滑道。虽然最先进的系统采用固定映射操作,但我们提出了一种优化方法,该方法在每次轮班前运行,并使用目的地需求和劳动力可用性的实时预测,以最大限度地提高吞吐量。我们使用仿真来提高性能和鲁棒性的优化解决方案的随机环境中,通过闭环调整的优化参数。

英文摘要:

Parcel sorting operations in logistics enterprises aim to achieve a high throughput of parcels through sorting centers. These sorting centers are composed of large circular conveyor belts on which incoming parcels are placed, with multiple arms known as chutes for sorting the parcels by destination, followed by packing into roller cages and loading onto outbound trucks. Modern sorting systems need to complement their hardware innovations with sophisticated algorithms and software to map destinations and workforce to specific chutes. While state of the art systems operate with fixed mappings, we propose an optimization approach that runs before every shift, and uses real-time forecast of destination demand and labor availability in order to maximize throughput. We use simulation to improve the performance and robustness of the optimization solution to stochasticity in the environment, through closed-loop tuning of the optimization parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑