Zone merge sequencing in an automated order picking system
研究了自动化订单履行系统中，通过优化各区域向主传送带合并物品的顺序，减少传送带空闲时间，从而缩短订单完成时间，并提出了贪心启发式算法，实验显示可缩短约5%的订单完成时间。
This paper considers the zone automated order fulfilment systems with a number of zones linked by a main conveyor. Each zone has a number of dispensers and a buffer. Each dispenser holds one type of item and dispenses the items for an order into a buffer before the items are merged to the main conveyor. Due to variability of the mix of item types and number of items for each type in successive orders, idle time or open space on the conveyor can occur if the buffers merge the items to the conveyor sequentially. The idle time prolongs the order fulfilment duration. This paper aims to provide a solution to reduce the idle time or open space by optimising the merging sequences among zones. A model is developed to find merging sequences with minimum order fulfilment time. However, the model is strongly NP-hard. A greedy heuristic-based solution approach is thus developed. Experiment performance shows that the presented solution can reduce the order fulfilment time approximately 5% with both empirical data and simulation data. Moreover, the sensitivity analysis is conducted to measure the effect of the solution under the variation of zone numbers and order structures. Although the idle time reduction can be achieved with any number of zones and order structures, it was most significant in certain range of zone numbers and appropriate order structures.