2020
DOI: 10.1109/access.2020.2975449
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 59 publications
0
7
0
Order By: Relevance
“…erefore, by establishing behavioral patterns, discover inconsistencies between patterns and implement anomaly detection of user behavior [8]. Veeraiyan et al believe that currently, the shortcomings of user behavior anomaly detection methods are: insufficient ability to automatically process large amounts of data [9].…”
Section: Literature Reviewmentioning
confidence: 99%
“…erefore, by establishing behavioral patterns, discover inconsistencies between patterns and implement anomaly detection of user behavior [8]. Veeraiyan et al believe that currently, the shortcomings of user behavior anomaly detection methods are: insufficient ability to automatically process large amounts of data [9].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Information is the result of processing data that can be justified into a form that is beneficial to the recipient. Information systems can be described as a set of processes that process and present information in such a way that it benefits the recipient [15].…”
Section: Research Methods 21 Information Systemmentioning
confidence: 99%
“…For K-means algorithm, the selection of K-values and initial cluster centers is critical to clustering results. To avoid local optimization, we use d γ to limit the distances between initial cluster centers to obtain more dispersed initial clustering centers [15],…”
Section: K-means Algorithmmentioning
confidence: 99%