Research On Optimization Of Package Location Assignment

Automated Storage, as a new storage way appearing in modern logistics technology area, is playing more important roles in the industrial production. The optimized dispatch of storage is the key of high work efficiency of the warehouse. So it is the key point of current researches on the project optimization realm. This paper focuses on the logistics problems of BaoJi tobacco Co., the problem of cargo space optimization is studied seriously.In this paper, as BaoJi tobacco Co. for example, focuses on the problem of cargo optimization. First of all, through the investigation of the automatic warehouse of BaoJi tobacco Co., two shortcomings were found. For the present situation and construction characteristics of the automatic warehouse, the method of optimization of cargo location with least time is put forward.Secondly, the three dimensional mathematical model with the motional parameters of fork-lift truck are evaluated, and some important formals are obtained. The correctness of optimization of cargo assigning during Storage is proved.Thirdly, the optimization of storage is carved to two steps. Firstly, GA is used for searching storage cargo, the proportion of every fork-lift's working hours and the total hours is minimum are guaranteed. Secondly, the cargos are ordered by time size, and then assigned to the corresponding cigarettes according to access to different frequencies. Stock efficiency is optimal at the same time shipping efficiency is guaranteed. Warehouse overall efficiency is guaranteed.Lastly, with the technique of Visual C++, the algorithm function is implemented, nine examples are computed, and Algorithm example shows that this model and method is effective and feasible. In this paper, the optimization algorithm is not only applicable to the warehouse, but also applies to similar SMEs Automated warehouse. The algorithm function offer a new idea and method for optimize of such warehouse.These research methods in this paper have a reference value on the further study of complex operations.