Construction of Community Logistics Distribution Network Based on K-Means Algorithm

Abstract:

The paper take the distribution radius and carry capacity as constraint conditions, the author uses two-stage K-means algorithm to cluster community service shops, and determines the distribution region of distribution centers, and constructs a suitable model for distribution center’s locating. Basing on the clustering result, the incompatible two kinds items, i.e. fresh items and the items shopped online, are united in a model to be solved. Since bottom-up approach is used to build distribution network step by step, a multi-objective programming is converted into two relatively independent single goal programming, so the network’s optimization result is of good controllability, and the algorithm’s complexity is greatly reduced. Finally, take 100 communities fresh items as examples to implement algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 641-642)
• Pages: 1271-1274
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.641-642.1271
• Online since: September 2014
• Authors: Mei Li*, Jian Zhang, Xiao Peng Zhou
• Keywords: Algorithm K-Means, Community Logistics, Logistics Distribution Network

References

[1] Yanning Jiang, Shuchi Hao, Jianzhou Gong, Tao Zhou. [J] Commercial Times, 2011(12): 24-26. In Chinese.

[2] Boyou Yuan. [J] Logistics Technology, 2009, 28(10): 4-6. In Chinese.

[3] Qian He. Based on the Area of Urban Logistics System Research Thesis Community Service. [D]. Southwest Jiaotong University, 2008. In Chinese.

[4] Dong Wang, Huanye Sheng, Xiaoming Sun, Lifeng Xi. [J] Port Economy, 2003(2): 48-49. In Chinese.

[5] Lai, Wong. Green logistics management and performance: Some empirical evidence from Chinese manufacturing exporters[J]. 2012, 40(3): 267-282.

DOI: 10.1016/j.omega.2011.07.002

[6] Manzini, Accorsi. The new conceptual framework for food supply chain assessment[J]. 2013, 115(2): 251-263.

DOI: 10.1016/j.jfoodeng.2012.10.026