A Commodity Warehouse Allocation Model Based on Hypergraph Embedding
The rapid development of e-business(EB for short)requires EB companies to respond to consumer requirements quickly,in order to improve their efficiency of customer services,more and more EB companies have deployed distributeddistribution center systems.A main problem with using this system is that improper commodity warehouse allocation may result in a large number of orders being divided into multiple sub-orders,which not only causes inconvenience to customers,but also increases more operating costs to companies.Addressing to this problem,a commodity warehouse allocation model aimed at minimizing the total number of split orders is proposed.The model is based on a hypergraph representation of historic orders,where each vertex corresponds to a distinct goods appearing in the orders,and each hyperedge describes a co-occurrence relation of goods in a same orders.The spectrum decomposition on the Laplace matrix of the hypergraph is performed to obtain the embedding representations of the goods,then a constrained clustering algorithm is proposed and is applied to the above embeddings to generate the allocation results.The comprehensive simula-tions is conducted to evaluate the proposed model,where LDA(Latent Dirichlet Allocation)with variant parameter settings is used to simulate different ordering behaviors,and the proposed model as well as some other comparison models is applied to generate the allocation results from the data.All experimental results show the superior of our model.
万方数据
维普
