Abstract
Warehouse efficiency has a significant impact on a supply chain’s efficiency. The purpose of this paper is to develop an algorithm that can sequence products to be picked or binned, allocate the products to robots, and optimise the routing of the robots through a warehouse. The algorithm incorporates collision avoidance since the aisle width does not allow two robots to pass each other. Both alternative routing heuristics and metaheuristics for the sequencing and allocation are investigated by means of an empirical analysis conducted on a number of real world problems of different sizes. A return routing heuristic outperformed the s-shape, largest gap and midpoint heuristics with a significant margin. The results for the sequencing and allocation problem showed that an evolutionary strategy algorithm outperformed other benchmarked metaheuristics.
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.
