An optimisation method of factory terminal logistics distribution route based on K-means clustering

被引:0
|
作者
Zhang H. [1 ]
机构
[1] Shandong Polytechnic, Management Institute, Shandong, Jinan
关键词
factory end logistics; k-means clustering algorithm; location of distribution centre; logistics distribution route;
D O I
10.1504/ijmtm.2023.131305
中图分类号
学科分类号
摘要
Aiming at the problems of scattered logistics data and low logistics distribution efficiency in the existing factory end logistics distribution route planning methods, a factory end logistics distribution route optimisation method based on K-means clustering is proposed. Firstly, information entropy is introduced to optimise the classical K-means dynamic clustering algorithm to collect the factory end logistics distribution data. Then, a priori clustering insertion algorithm is used to process the redundant data in the collected logistics distribution data. The priority characteristics of logistics distribution nodes and the subset of distribution service requirements are established and the end distribution route planning process is designed. Finally, by setting the starting point of collection and distribution route through the process, determine the data weight in the distribution dataset, the optimal route of factory end logistics distribution to realise optimisation. The results show that this method has low cost and time-consuming less than 0.3 h. Copyright © 2023 Inderscience Enterprises Ltd.
引用
收藏
页码:184 / 198
页数:14
相关论文
共 50 条
  • [1] Feature Selection Algorithm Based on K-means Clustering
    Tang, Xue
    Dong, Min
    Bi, Sheng
    Pei, Maofeng
    Cao, Dan
    Xie, Cheche
    Chi, Sunhuang
    2017 IEEE 7TH ANNUAL INTERNATIONAL CONFERENCE ON CYBER TECHNOLOGY IN AUTOMATION, CONTROL, AND INTELLIGENT SYSTEMS (CYBER), 2017, : 1522 - 1527
  • [2] K-means Clustering Optimization Algorithm Based on MapReduce
    Li, Zhihua
    Song, Xudong
    Zhu, Wenhui
    Chen, Yanxia
    PROCEEDINGS OF THE 2015 INTERNATIONAL SYMPOSIUM ON COMPUTERS & INFORMATICS, 2015, 13 : 198 - 203
  • [3] Research on the spatial distribution of garden landscape based on the optimization of K-means clustering algorithm
    Chen, Yu
    Applied Mathematics and Nonlinear Sciences, 2024, 9 (01)
  • [4] A New Selection Method of K-means Clustering with Initial Clustering Center Point
    Li, Wen-jun
    Zou, Hai-lin
    2ND INTERNATIONAL SYMPOSIUM ON COMPUTER NETWORK AND MULTIMEDIA TECHNOLOGY (CNMT 2010), VOLS 1 AND 2, 2010, : 580 - 582
  • [5] K-means clustering algorithm for data distribution in cloud computing environment
    Pan, Hailan
    Lei, Yongmei
    Yin, Shi
    INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2021, 12 (03) : 322 - 331
  • [6] Optimal Cell Screening Method for Minimizing the Imbalance Based on K-means Clustering Algorithm
    Lee, Pyeong-Yeon
    Han, Dong-Ho
    Kim, Gun-Woo
    Kang, Tae-Woo
    Pack, Sung-Baek
    Kim, Jonghoon
    2018 21ST INTERNATIONAL CONFERENCE ON ELECTRICAL MACHINES AND SYSTEMS (ICEMS), 2018, : 2166 - 2170
  • [7] Service quality evaluation of agricultural cold chain logistics supply chain based on k-means clustering algorithm
    Zhang, YuXi
    International Journal of Manufacturing Technology and Management, 2025, 39 (1-2) : 59 - 73
  • [8] CUDA-based parallel K-means clustering algorithm
    Huo, Yingqiu
    Qin, Renbo
    Xing, Caiyan
    Chen, Xi
    Fang, Yong
    Nongye Jixie Xuebao/Transactions of the Chinese Society for Agricultural Machinery, 2014, 45 (11): : 47 - 53and74
  • [9] The Classification System of Literary Works Based on K-Means Clustering
    Wei, Sanqiang
    Hou, Hongxia
    Sun, Hua
    Li, Wei
    Song, Wenxia
    JOURNAL OF INTERCONNECTION NETWORKS, 2022, 22 (SUPP01)
  • [10] Clustering analysis on E-commerce transaction based on K-means clustering
    1600, Academy Publisher (09): : 443 - 450