Joint Distribution Center Location Problem for Restaurant Industry Based on Improved K-Means Algorithm With Penalty

被引：9

作者：

Zhou, Yuyang ^{[1
]}

Xie, Ruxin ^{[1
]}

Zhang, Tianhui ^{[2
]}

Holguin-Veras, Jose ^{[3
]}

机构：

[1] Beijing Univ Technol, Beijing Key Lab Traff Engn, Beijing 100124, Peoples R China

[2] Beijing Univ Technol, Beijing Dublin Int Coll, Beijing 100124, Peoples R China

[3] Rensselaer Polytech Inst, Dept Civil & Environm Engn, Ctr Excellence Sustainable Urban Freight Syst COE, Troy, NY 12180 USA

来源：

IEEE ACCESS | 2020年 / 8卷 / 08期

关键词：

Receivers; Supply chains; Transportation; Industries; Clustering algorithms; Linear programming; Urban freight; joint distribution center; location selection; improved K-means algorithm; penalty; freight survey; HUB LOCATION; APPROXIMATION ALGORITHM; PROFIT ALLOCATION; COST ALLOCATION; ACCESSIBILITY; NETWORKS;

D O I：

10.1109/ACCESS.2020.2975449

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The location of joint distribution center (JDC) is of great importance in urban freight system. This work aims to minimize the total cost, including the fixed cost, the transportation cost, and the penalty cost for the missed deliveries, considering the joint distribution willingness (JDW) of restaurant and the coverage radius of JDC. The integer programming model is formulated to select the optimal location of JDC and opens no more than k-JDCs. To solve the problem, an improved K-means (I-K-means) algorithm combining local search with penalty is proposed. The delivery problems obtained by freight survey from 114 restaurants in Beijing, China are taken as a case study. The formulation in this paper can reduce the cost of deliveries in restaurant industry, decrease the number of freight vehicles on road, and promote the joint distribution mode in urban freight system.

引用

页码：37746 / 37755

页数：10

共 50 条

[21] Research on Improved K-Means Algorithm Based on Hadoop
Wei Xiaojing
Li Yuanbo
[J]. 2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE), 2017, : 593 - 598
[22] An Improved Parallelization of K-means Algorithm based on HADOOP
Guo, Yizhuo
[J]. 2018 INTERNATIONAL SYMPOSIUM ON POWER ELECTRONICS AND CONTROL ENGINEERING (ISPECE 2018), 2019, 1187
[23] Quantitative Strategies Based on an Improved K-means Algorithm
Wang, Xinyu
Xue, Lian
Yu, Ruiyu
Wu, Yike
Yu, Qunfang
[J]. PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON MANAGEMENT, EDUCATION, INFORMATION AND CONTROL (MEICI 2017), 2017, 156 : 655 - 658
[24] An Improved K-means Clustering Algorithm Based on Dissimilarity
Wang Shunye
[J]. PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 2629 - 2633
[25] Improved Initial Clustering Center Selection Method for k-means Algorithm
Xie, Qingqing
Jiang, He
Han, Bing
Wang, Dongyuan
[J]. 2018 EIGHTH INTERNATIONAL CONFERENCE ON INSTRUMENTATION AND MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2018), 2018, : 1092 - 1095
[26] Location recommendation algorithm based on K-means and matrix factorization
Li, Bin
Zhou, Xu
Mei, Fang
Pan, Shuai-Ning
[J]. Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2019, 49 (05): : 1653 - 1660
[27] An Improved K-means Clustering Algorithm
Wang Yintong
Li Wanlong
Gao Rujia
[J]. 2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
[28] Improved K-means clustering algorithm
Zhang, Zhe
Zhang, Junxi
Xue, Huifeng
[J]. CISP 2008: FIRST INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOL 5, PROCEEDINGS, 2008, : 169 - 172
[29] An improved K-means clustering algorithm
Huang, Xiuchang
Su, Wei
[J]. Journal of Networks, 2014, 9 (01) : 161 - 167
[30] A K-means Clustering Algorithm Based on the Distribution of SIFT
Lv, Hui
Huang, Xianglin
Yang, Lifang
Liu, Tao
Wang, Ping
[J]. 2013 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST), 2013, : 1301 - 1304

← 1 2 3 4 5 →