Abstract

In this article, the results of a series of selected algorithms used during the picking of goods in a warehouse, assuming the order of stacking goods in transport containers is predetermined, are analysed, simulated and evaluated. The importance of the development of this type of algorithms is the possibility of reducing the waiting time of both transport and goods in order to reduce the total cost of the picking process. Afterwards, the results will be analysed by varying the parameters and evaluating the solutions. The aim is to show the results of various picking algorithms when their subsequent stacking order is predetermined, and to use these to identify relationships and define guidelines that could be used to support the design of similar picking algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call