SIMULATION OF RE-ARRANGEMENT AND HEALING IN ROBOTIC COMPACT BIN-STORAGE SYSTEM

Abstract

This paper proposes a simulation-based optimization method for the Robotic Compact Bin-Storage System (RCBSS). Storage Location Assignment Problem (SLAP) and Order Picking Problem (OPP) on the RCBSS are studied. Four different performance criteria are investigated in the re-arrangement and healing approach. These criteria are picking time, loading time, time spent for re-arrangement, and simulation duration. The simulation results show that the re-arrangement and healing approach effectively minimize the total cost and efficiency, and the designed algorithm efficiently solves the model. This study is expected to minimize the turnaround time, ordering delays, station occupancy time, and robot congestion. It also increases system throughput and customer satisfaction. The study results show that the re-arrangement approach provides much more favourable results for the RCBSS.