Research On Optimal Scheduling Of Linear Reciprocating Double Shuttle System During AS/RS Storage

With the transformation of modern society and economic development,manufacturing enterprises continue to grow and develop,and the requirements for warehouse management level are becoming higher and higher.As an integral part of warehouse management,automated three-dimensional warehouse is gradually pursued by enterprises,especially the electronics industry.Since the three-dimensional warehouse does not require too much human operation,and can maintain the constant temperature and constant pressure of the warehouse,it has a good protective effect on the storage of electronic and electrical products,so how to quickly tramsport the product from the production line to the automated three-dimensional warehouse,so that Minimizing product storage time is the focus of many scholars and the real industry.This article takes the material handling system as the research object during the storage process of the automated three-dimensional warehouse,and takes the finear track double shuttle as the core.Through analysis and research on it,the product storage time s minimized to solve the practical challenges in enterprise storage management.The paper first elaborated the background,significance and main content of the automated three-dimensional warehouse to be studied;and then reviewed the automated three-dimensional warehouse scheduling,shuttle scheduling and problem-solving methods,and designed genetic algorithms as a method to solve such problems;second,Through the analysis summary of the storage problem of the automated three-dimensional warehouse,the basic constraints of the scheduling problem of the linear reciprocating double shuttle truck storage operation are found:carg)delivery constraints,coordination constraints between the shuttle car and the stacker,and the collision avoidance constraints of the shuttle car;On this basis,an integer programming model under a given transportation sequence is established,with the goal of minimizing the time of material storage.Further,an adaptive genetic algorithm is proposed to solve this problem.The designed algorithm mainly includes chromosome coding:it is coded in a triple structure manner,and the coding includes the transportation sequence,I/O station,R shuttle and storage goods;the initial population:the greedy strategy is used to ensure the excellent characteristics of the chromosome,and the randomly generated Ways to maintain population diversity;genetic operators:selection,crossover,mutation and other operations Finally,taking an electronic enterprise as an example,setting parameters according to relevant data,using commercial software CPLEX tool and Matlab to solve it.The results of the solution show that the integer programming model and genetic algorithm proposed in this paper can effectively solve the problem.Compared with the commercial software CPLEX,the quality and efficiency of the solution are more superior,which reflects the application research value of this paper.