A comparison of two zone-visitation sequencing strategies in a distribution centre

Abstract

The environment of this study is modelled after a distribution centre in Taiwan. One unique characteristic of this environment is that the picking area has been divided into different zones. A picker often has to visit more than one zone to pick all the items in an order. This environment has one important restriction - no more than one picker can simultaneously be in the same zone. This paper focuses on one problem of this environment, i.e. finding the best zone-visitation sequence a picker can follow. Two zone-visitation sequencing strategies - the fixed zone-visitation sequencing strategy and the dynamic zone-visitation sequencing strategy - are proposed and studied for the problem. Both strategies incorporate a two-phase optimization process. An initial starting solution is found using a nearest-neighbour type generative algorithm NPZF, then a simulated annealing improvement algorithm SA brings this solution towards optimality. This ensures that each strategy is represented by good exemplars of their class. Simulation experiments are conducted to evaluate the performance of the proposed strategies in three performance measures - total travel distance of pickers (TTD), total required system Time to complete the picking operations (TRST), and total picking time of pickers (TPT). The simulation results show that the fixed strategy is about 20.9% better than the dynamic strategy in TTD, but about 17% less effective than the dynamic strategy in TRST and TPT. This indicates that the dynamic strategy will be a better strategy if one can prevent the possible physical fatigue experienced by pickers due to the greater travel distance.