Stereoscopic Warehouse Cargo Space Allocation And Picking Algorithm

The automated storage and retrieval system plays an important part in automated production systems. As a link in modern logistics, its development has the benefit for the optimization of logistics. The data shows that most of the time is used to store material in whole manufacturing process. So modern enterprise spends a great deal of energy on the optimization of storage aspects improving economic benefits. For many years, according to storage optimization generated a massive research achievements. Especially the research projects about storage designing,resources allocation and optimization scheduling have been research hotspots gradually. Based on previous researches, this paper investigate the problems about the automated storage slotting optimization and the optimization scheduling of order picking, and set the corresponding mathematical models aiming at improving the storage efficiency and guaranteeing shelves stability. Through the intelligent optimization algorithm to solve the problems.The main contents of this paper are as follows:(1) Analyses the principle of automated storage slotting optimization and storage strategy. Analyses the principle of optimization of order picking and the factors of influencing the efficiency of order picking.(2) According to principle of shelves stability and the least time of in-out of automated storage, set the model of automated storage slotting optimization and then optimize the model as a multi-objective optimization problem. Based on the model, using genetic algorithm and put forward a series of measures to improve genetic algorithm aiming at solving this problems, including adding external storage to save the best solution, using crowded degree instead of sharing function to ensure that diversity and so on.(3) According to principle of the least running time of stacker, set the model which similar to TSP of order picking. Using ant colony algorithm and put forward a series of measures to improve this algorithm aiming at solving this problem, including adding changed initialize method and adding changed improve updated information method and limiting choice number and so on.(4) According to the example of practical application, instance of algorithm shows that improving method is more efficient than previous algorithm through using improving method to solve the problems in both cases.