Abstract
In this work, we first propose an NP-hard combinatorial problem, that is, the storage and retrieve (S/R) machine travel path optimization for batch order picking (BOP). Successful solving this problem is valuable to many application areas such inventory items in logistics and work-in-process storage in manufacturing systems. And then, we investigate the feasibility of using ant colony optimization (ACO) meta-heuristics to address the proposed problem. Simulation tests are executed separately based on two ACO algorithms. Finally, the S/R machine operating performance measure index such as total travel distance and total travel time are employed to evaluate the experimental results achieved by different ACO algorithms. Experimental case study demonstrates the effectiveness and applicability of the selected ACO approaches to our proposed BOP problem.
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.
