Abstract
We investigate the optimal scheduling of retrieval jobs for double-deep type Automated Storage and Retrieval Systems (AS/RS) in the Flexible Manufacturing System (FMS) used in modern industrial production. Three types of evolutionary algorithms, the Genetic Algorithm (GA), the Immune Genetic Algorithm (IGA), and the Particle Swarm Optimization (PSO) algorithm, are implemented to obtain the optimal assignments. The objective is to minimize the working distance, that is, the shortest retrieval time travelled by the Storage and Retrieval (S/R) machine. Simulation results and comparisons show the advantages and feasibility of the proposed methods.
Highlights
Optimization has shown itself to be one of the most important problems of engineering design and scientific analysis and has been widely studied in the manufacturing industry [1,2,3,4,5,6,7,8]
We investigate the optimal scheduling of retrieval jobs for double-deep type Automated Storage and Retrieval Systems (AS/RS)
Since Automated Storage and Retrieval Systems (AS/RS) have been used as a part of manufacturing systems [1,2,3,4,5,6,7,8, 13,14,15,16,17,18,19] and function as important links in the supply chain, many researchers have discussed the applications of optimization to such systems
Summary
Optimization has shown itself to be one of the most important problems of engineering design and scientific analysis (e.g., see [1,2,3,4,5,6,7,8,9,10,11,12]) and has been widely studied in the manufacturing industry [1,2,3,4,5,6,7,8]. In order to make the double-deep type AS/RS more effective, we have to optimize the storage location and the job scheduling for storage and retrieval. We systematically propose a formula for the AS/RS traveled distance calculation and are the first to use evolutionary algorithms to optimize retrieval jobs scheduling problems for the double-deep type AS/RS. The formula for calculating M can be represented as follows: M. where Xr , Xc , and Xd are center distance between two adjacent cells in a row, column, and depth, respectively, p is the place of the cargo that we want to retrieve; q is the nearest empty place that we can put the cargo; pr and qr are distances between the locations “p” and “q” row-wise; pc and qc are distances between the locations “p” and “q” column-wise; pd and qd are distance between the locations “p” and “q” depthwise. Where Z is total distance travelled by the S/R machine; w is the maximum load capacity (i.e., maximum number of cargos) of the forklift truck each time
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
