ORDER-PICKING: LARGEST GAP ROUTING POLICIY WITH COI-BASED STORAGE POLICY

The paper compares the performance of Largest gap routing policy with different types of COI-based storage in order-picking process, based on the simulation results for many different situations. After determining the best combination, the performance of Largest gap routing policy is compared with two other well-known heuristic routing policies – ; S-shape and Return policy. The preference regions for those three routing policies are given, depending on the shape of a warehouse, skeweness of a COI-based ABC curve and number of picks per tour.