Apply Linear Programming To Slotting Optimization Based On The Greedy Algorithm

As the logistics developing, it has been an important part in modern economy, and the distribution also has been a significant factor to impact the companies growing. So the picking activity as a main process in distribution has become important more and more, therefore the layout of slot, which is a main factor to effect picking activity, has been paid more attention to by the companies.This study create a mathematical model of linear programming based on the route, turnover and coefficient of picking cost to optimize slot in warehouse or distribution center by the greedy algorithm used in the related implementing, according to the study and examination, we know this method can achieve the aim of improving picking efficiency quickly, and it is suitable for the slotting optimization of the more roadway warehouse whose picking process is under the dispatch of lots of shipment with low lot sizes especially.