Abstract

The proper assignment of storages to stocks prior to their picking is critical to reduce order picking costs. Appropriate storage assignments can also shorten storing time, improve storage utilization, and facilitate inventory management. Three objectives are considered: minimizing the routing length of storing stocks, maximizing the future chance of adjacent stocks to be picked together, and minimizing the storage distance to the access point for popular stocks. This study devises a genetic algorithm to find feasible solutions and uses a method to determine the final storage assignment from a set of Pareto solutions.

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