Large-Scale Storage/Retrieval Requests Sorting Algorithm for Multi-I/O Depots Automated Storage/Retrieval Systems | Zendy

Yu Bo Song | Zendy; Haibo Mu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Large-Scale Storage/Retrieval Requests Sorting Algorithm for Multi-I/O Depots Automated Storage/Retrieval Systems

Author(s) -

Yu Bo Song,

Haibo Mu

Publication year - 2021

Publication title -

discrete dynamics in nature and society

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.264

H-Index - 39

eISSN - 1607-887X

pISSN - 1026-0226

DOI - 10.1155/2021/6646180

Subject(s) - stacker , sorting , computer science , sequence (biology) , travelling salesman problem , heuristic , process (computing) , scale (ratio) , algorithm , mathematical optimization , artificial intelligence , mathematics , engineering , operating system , mechanical engineering , physics , quantum mechanics , biology , genetics

This paper addresses the sequence sorting problem of large-scale storage/retrieval (S/R) requests in multiple Input/Output (multi-I/O) depots automated storage/retrieval systems (AS/RS), in which the cargoes can enter/leave the system through multi-I/O depots, the stacker can load only one cargo, and the load travel time of stacker is fixed. The problem is to find an optimal sequence for a certain S/R requests sequence, and it is a special kind of traveling salesman problem. In this paper, a heuristic algorithm based on assignment is proposed. In order to eliminate the subloops emerged in the sorting process, the equivalent merging and minimum cost merging methods of subloops are considered, and the proposed algorithm is modified. Experimental results indicate the effectiveness of the proposed algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research