Abstract
In the Multi-tier Shuttle Warehousing System (MSWS), shuttles are responsible for horizontal movements and lifts are responsible for vertical movements. In this paper, a retrieval task scheduling problem for a tier-captive MSWS under single command cycle is considered. This paper aims to determine the sequence of retrieval tasks to minimize the makespan. A mixed integer programming model is developed for the retrieval task scheduling problem. When the number of tasks is less than 10, the mixed integer programming model can be solved by the GUROBI solver to find the exact solutions within a short period. Moreover, a tabu search algorithm, an ant colony algorithm and a simulated annealing algorithm are designed and applied to solve large size problems with up to 200 tasks. By analyzing experimental results, the ant colony algorithm shows stable and superior performance in solving large size problems.
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.
