Study On Location Allocation Problem Based On Genetic Tabu Search Algorithm

In order to satisfy the higher demands of modern logistics warehousing enterprises on the company's operational efficiency,the location allocation problem in warehouse management has been highly valued by the majority of enterprises.Good location assignment strategies can greatly improve the efficiency of in-out storage of the goods and reduce the operation cost of warehouse.However,also has a lot of factors which affect location allocation efficiency,such as the stability of the rack,safety quality of goods,convenience of goods access.How to deal with the relationship between these factors depends on the degree of attention of enterprises.With the aggravation of the network and accumulation of data in recent years,entrepreneurs pay more and more attention to data mining technology,and it can timely quickly extract information which is useful to decision makers from the vast amounts of data,to obtain commercial value.This paper excavates the relationship between orders and the frequency of storage base on the algorithm of association rules in the data mining,introduced to the one-to-many association rules and the frequency of in-out warehouse to optimize the location allocation model in order to obtain the shortest picking routing,and improve the frequency of loading and unloading and operation efficiency of warehouse.Genetic algorithm was utilized to optimize the model of location allocation because it has the characteristics of high concurrency and strong capability of global search.However,during the experiment,it was found that the algorithm operates with a long time and slow efficiency because of the large amount of data;another problem is that the algorithm is prone to “premature” and is easily trapped in local optimum instead of achieving the goal of the global optimal solution,while these problems can make a good improvement by using tabu search algorithm.Tabu search algorithm is fast,has the characteristic which has a function of “memory”,complete local search algorithm very well,and overcome the shortcomings of genetic algorithm's poor local search capability.Genetic tabu search algorithm with strong global search ability and local search ability can be obtained by combining genetic algorithm with tabu search.The simulation experiments show that the genetic tabu search algorithm is better than the genetic algorithm whether in the time or the optimal solution.