Abstract
This paper studies the co-scheduling problem of the stackers and single rail guided vehicle system in automated storage and retrieval systems. We formulate the problem into a mixed integer linear programming model with the aim of minimizing the total retrieval time. In order to solve the problem, an improved genetic algorithm is proposed, and the properties of the optimal solution are applied to improve the offspring chromosomes. A lower bound of the total retrieval time is developed. The numerical experiment indicates that the proposed algorithm can solve the problem effectively. Compared with the solutions obtained by using first come first served, the total retrieval time obtained by the proposed algorithm is reduced by an average of 8.36%. The average deviation from the lower bound is 2.00%.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
