Study on a storage location strategy based on clustering and association algorithms

In this paper, we study the improvement of a storage location strategy through the use of big data technology, including data collection, cluster analysis and association analysis, to improve order picking efficiency. A clustering algorithm is used to categorize the types of goods in orders. Classification is performed based on the turnover of goods, value, sales volume, favorable commodity ratings, whether free shipping is provided and whether cash on delivery is supported. An association algorithm is used to determine the relationships among goods by studying the habits of consumers who buy them. A method for improving the class-based storage strategy is proposed. The picking distance of the improved storage strategy is compared with that of the traditional strategy via simulation experiments. The picking efficiency is shown to be enhanced by the improved strategy.

[1]  Qing Wang,et al.  Distance metric optimization driven convolutional neural network for age invariant face recognition , 2018, Pattern Recognit..

[2]  Houfeng Wang,et al.  Model approach to grammatical evolution: theory and case study , 2016, Soft Comput..

[3]  Brij Bhooshan Gupta,et al.  Robust injection point-based framework for modern applications against XSS vulnerabilities in online social networks , 2018, Int. J. Inf. Comput. Secur..

[4]  Jun Cai,et al.  Enhancing network capacity by weakening community structure in scale-free network , 2017, Future Gener. Comput. Syst..

[5]  Hui Wang,et al.  A new dynamic firefly algorithm for demand estimation of water resources , 2018, Inf. Sci..

[6]  Stephen C. Graves,et al.  Optimal Storage Assignment in Automatic Warehousing Systems , 1976 .

[7]  Zhaoquan Cai,et al.  Towards secure and flexible EHR sharing in mobile health cloud under static assumptions , 2017, Cluster Computing.

[8]  Nagiza F. Samatova,et al.  Solving the maximum duo-preservation string mapping problem with linear programming , 2014, Theor. Comput. Sci..

[9]  Mohammed Bouhorma,et al.  Pedagogical Indexed Arabic Text in Cloud E-Learning System , 2017, Int. J. Cloud Appl. Comput..

[10]  Li Zhou,et al.  Study on the estimation of blocking rate in wide-aisle picking system , 2019, Soft Comput..

[11]  Marco Maggini,et al.  A semi-supervised document clustering algorithm based on EM , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[12]  Jin Li,et al.  Multi-resource scheduling and power simulation for cloud computing , 2017, Inf. Sci..

[13]  Jin Li,et al.  Model approach to grammatical evolution: deep-structured analyzing of model and representation , 2016, Soft Computing.

[14]  Guy L. Scott,et al.  Feature grouping by 'relocalisation' of eigenvectors of the proximity matrix , 1990, BMVC.

[15]  Weiwei Lin,et al.  An Ensemble Random Forest Algorithm for Insurance Big Data Analysis , 2017, IEEE Access.

[16]  René de Koster,et al.  Class-based Storage With a Finite Number of Items , 2015 .

[17]  Wei Xiong,et al.  Inapproximability results for the minimum integral solution problem with preprocessing over ℓ∞ℓ∞ norm , 2013, Theor. Comput. Sci..

[18]  Jin Li,et al.  Design and theoretical analysis of virtual machine placement algorithm based on peak workload characteristics , 2017, Soft Comput..

[19]  Ikram El Azami,et al.  XML OLAP cube in the cloud: Towards the DWaaS , 2016, 2016 International Conference on Engineering & MIS (ICEMIS).

[20]  S. M. Hatefi,et al.  Multi-criteria ABC inventory classification with mixed quantitative and qualitative criteria , 2014 .

[21]  Yu Xue,et al.  Efficient business process consolidation: combining topic features with structure matching , 2016, Soft Comput..