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 条

[1] APPROXIMATION ALGORITHM FOR SPHERICAL k-MEANS PROBLEM WITH PENALTY
Wu, Chenchen
Lv, Wei
Wang, Yujie
Xu, Dachuan
[J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2022, 18 (04) : 2277 - 2287
[2] Tobacco Distribution Based on Improved K-means Algorithm
Zheng, Bin
Tang, Fa-zhe
Yang, Hua-long
[J]. PROCEEDINGS OF 2009 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATION, LOGISTICS AND INFORMATICS, 2009, : 724 - +
[3] RETRACTED: Research on Location of Logistics Distribution Center Based on K-Means Clustering Algorithm (Retracted Article)
Wang, Ping
Chen, Xianjun
Zhang, Xuebin
[J]. SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
[4] An Improved K-means Algorithm with Meliorated Initial Center
Chen Guang-ping
Wang Wen-peng
[J]. PROCEEDINGS OF 2012 7TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION, VOLS I-VI, 2012, : 150 - 153
[5] K-means Clustering Algorithm with improved Initial Center
Zhang Chen
Xia Shixiong
[J]. WKDD: 2009 SECOND INTERNATIONAL WORKSHOP ON KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2009, : 790 - 792
[6] Research on Selection of Initial Center Points Based on Improved K-means Algorithm
Jiang, Dongyang
Zheng, Wei
Lin, Xiaoqing
[J]. PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 1146 - 1149
[7] An Improved Initialization Center K-means Clustering Algorithm Based on Distance and Density
Duan, Yanling
Liu, Qun
Xia, Shuyin
[J]. ADVANCES IN MATERIALS, MACHINERY, ELECTRONICS II, 2018, 1955
[8] Improved initial clustering center selection algorithm for K-means
Chen Lasheng
Li Yuqiang
[J]. 2017 SIGNAL PROCESSING: ALGORITHMS, ARCHITECTURES, ARRANGEMENTS, AND APPLICATIONS (SPA 2017), 2017, : 275 - 279
[9] Research of Distribution Center Location Problem Based on Improved Genetic Algorithm
Yang, Shu-xia
Cui, Dan
[J]. 3RD INTERNATIONAL CONFERENCE ON EDUCATION REFORM AND MODERN MANAGEMENT, 2016, 2016, : 146 - 150
[10] A GENERALIZED k-MEANS PROBLEM FOR CLUSTERING AND AN ADMM-BASED k-MEANS ALGORITHM
Ling, Liyun
Gu, Yan
Zhang, Su
Wen, Jie
[J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (06) : 2089 - 2115

← 1 2 3 4 5 →