Font Size: a A A

Study On Location Allocation Problem Based On Association Rules

Posted on:2017-02-24Degree:MasterType:Thesis
Country:ChinaCandidate:J P SongFull Text:PDF
GTID:2308330485472199Subject:Data mining
Abstract/Summary:PDF Full Text Request
Location assignment is a multi-objective optimization problem for shelf stability and efficiency. Most of the research on the principle of considering the influence of distribution of goods and goods warehouse hardware efficiency. Research on storage location assignment algorithm considering factors ensure advanced first out, regional balance, bearing uniform, high efficiency, convenient operation, reliable operation and so on. Then the algorithm is optimized to improve the turnover rate and reduce the amount of replenishment. In the network and big data is filled with people’s lives today, but there is a factor must be considered, it is the association between the data.Combined with automated warehouse storage location assignment and data association problem, an analysis on the current situation of Chinese and foreign, is proposed based on association rules of the storage location assignment concept model,the relationship between goods and cargo to 1: n, to ensure a goods can be stored at the same time, in more than one location, while ensuring a same location only store a goods. According to the above concept, the mathematical model of the planning and design of the 1:n concept is defined by integer programming. Using MATLAB software, the mathematical model for analysis and verification, 10 items or 25 of the location allocation scheme simulation, reality, correct programs. But when the amount of data increases, the algorithm running time is too long, the efficiency is too slow.Genetic algorithm is a method of searching the optimal solution by simulating the natural evolution process. In this paper, genetic algorithm is adopted to optimize the concept of algorithm, the MATLAB software is used to optimize the algorithm simulation, and through the increase of data to test the effect of optimization, the results show that the optimized algorithm is significantly improved after running time and efficiency. After that, the concept model is deeply studied, including the determination of the correlation coefficient and the superiority of the 1:n concept. By using MATLAB software simulation, the reasonable limit values of correlation coefficient are obtained by multiple experiments, and the simulation results also show the superiority of 1:n concept in 1:1.
Keywords/Search Tags:Location Assignment, Association Rules, MATLAB, Genetic Algorithm
PDF Full Text Request
Related items