Abstract
A put wall is a hardware composed of containers that is usually used as a sorting station. In this study, the order picking operations, including order batching and picker routing, in a put wall based picking system is studied. Put walls usually have limited capacity and can accommodate only a part of received orders at a time. Hence, scheduling of the orders on the put wall should be considered along with the order batching and picker routing. For this, a mathematical formulation for order batching and picker routing in a put wall based picking system is proposed. To solve the problem, two genetic algorithms (GAs) with random shuffling and inverse–insert–swap mutation operators, a list-based simulated annealing (LBSA) and a hybrid GA–LBSA are proposed. To show the effectiveness of the proposed methods, their results are compared against the best solutions found by Gurobi 7.0. It is found that while for smaller size problems LBSA is a better choice in terms of solution quality, when CPU time is considered, depending on the problem size, GA and GA–LBSA might be the better options.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
