PERTANIKA JOURNAL OF SCIENCE AND TECHNOLOGY

 

e-ISSN 2231-8526
ISSN 0128-7680

Home / Regular Issue / JST Vol. 31 (2) Mar. 2023 / JST-3448-2022

 

Modified K-Means Clustering for Demand-Weighted Locations: A Thailand’s Convenience Store Franchise - Case Study

Chartchai Leenawong and Thanrada Chaikajonwat

Pertanika Journal of Science & Technology, Volume 31, Issue 2, March 2023

DOI: https://doi.org/10.47836/pjst.31.2.02

Keywords: Centroid calculation, clustering, Davies–Bouldin index, demand-based, distance metrics, distribution center, K-means, location problem

Published on: 20 March 2023

This research applies and modifies K-means clustering analysis from Data Mining to solving the location problem. First, a case study of Thailand’s convenience store franchise in locating distribution centers (DCs) is conducted. Then, the final centroids are served at suggested DC locations. Besides the typical distance, Euclidean, used in K-means, Manhattan, and Chebyshev, is also experimented with. Moreover, due to the stores’ different demands, a modification of the centroid calculation is needed to reflect the center-of-gravity effects. For the proposed centroid calculation, the above three distance metrics incorporating the demands as weights give rise to another three approaches and are thus named Weighted Euclidean, Weighted Manhattan, and Weighted Chebyshev, respectively. Besides the optimal locations, the effectiveness of these six clustering approaches is measured by the expected total distribution cost from DCs to their served stores and the expected Davies–Bouldin index (DBI). Concurrently, the efficiency is measured by the expected number of iterations to the final clusters. All these six clustering approaches are then implemented in the case study of locating eight DCs to distribute to 260 convenience stores in Eastern Thailand. The results show that though all approaches yield locations in close proximity, the Weighted Chebyshev is the most effective one having both the lowest expected distribution cost and lowest expected DBI. In contrast, Euclidean is the most efficient approach, with the lowest expected number of iterations to the final clusters, followed by Weighted Chebyshev. Therefore, the DC locations from Weighted Chebyshev could, ultimately, be chosen for this Thailand’s convenience store franchise.

  • Aggarwal, C. C., & Reddy, C. K. (Eds.). (2014). Data clustering algorithms and applications. CRC Press.

  • Chen, H. (2019). Location problem of distribution center based on Baumer Walvar model: Taking Jiaji logistics as an example. Open Journal of Business and Management, 7(2), 1042-1052. https://doi.org/10.4236/ojbm.2019.72070

  • Dantrakul, S., Likasiri, C., & Pongvuthithum, R. (2014). Applied p-median and p-center algorithms for facility location problems. Expert Systems with Applications, 41(8), 3596-3604. https://doi.org/10.1016/j.eswa.2013.11.046

  • Davies, D. L., & Bouldin, D. W. (1979). A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1(2), 224-227. https://doi.org/10.1109/TPAMI. 1979.4766909

  • Drezner, Z., Scott, C., & Song, J. S. (2003). The central warehouse location problem revisited. IMA Journal of Management Mathematics, 14(4), 321-336. https://doi.org/10.1093/imaman/ 14.4.321

  • Farahani, R. Z., & Hekmatfar, M. (Eds.). (2009). Facility location: Concepts, models, algorithms and case studies. Springer Science & Business Media.

  • Gultom, S., Sriadhi, S., Martiano, M., & Simarmata, J. (2018). Comparison analysis of K-means and K-medoid with Euclidean distance algorithm, distance, and Chebyshev distance for big data clustering. In IOP Conference Series: Materials Science and Engineering (Vol. 420, No. 1, p. 012092). IOP Publishing. https://doi.org/10.1088/1757-899X/420/1/012092

  • Hakimi, S. L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3), 450-459. https://doi.org/10.1287/opre.12.3.450

  • Langley, C. J., Novack, R. A., Gibson, B., & Coyle, J. J. (2020). Supply chain management: A logistics perspective. Cengage Learning.

  • Ministry of Foreign Affairs. (2017). Tourism industry in Thailand. Netherlands embassy in Bangkok. https://www.rvo.nl/sites/default/files/2017/06/factsheet-toerisme-in-thailand.pdf

  • Sharma, A., & Jalal, A. S. (2017). Clustering based hybrid approach for facility location problem. Management Science Letters, 7(12), 577-584. https://doi.org/10.5267/j.msl.2017.8.007

  • Singh, A., Yadav, A., & Rana, A. (2013). K-means with three different distance metrics. International Journal of Computer Applications, 67(10), 13-17. https://doi.org/10.5120/11430-6785

  • Sinwar, D., & Kaushik, R. (2014). Study of Euclidean and Manhattan distance metrics using simple K-means clustering. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 2(5), 270-274.

  • Surawattananon, N., Reancharoen, T., Prajongkarn, W., Chunanantatham, S., Simakorn, Y., & Gultawatvichai, P. (2021). Revitalising Thailand’s tourism sector. Bank of Thailand. https://www.bot.or.th/Thai/MonetaryPolicy/EconomicConditions/AAA/250624_WhitepaperVISA.pdf

  • Wang, M. (2018). The research of strategy for the 7-eleven convenience store in Thailand (Masters dissertation). Siam University, Thailand. https://e-research.siam.edu/wp-content/uploads/2019/08/IMBA-2018-IS-The-Research-of-Strategy-for-the-7-Eleven-Convenience-Store_compressed.pdf

  • Yang, L., Ji, X., Gao, Z., & Li, K. (2007). Logistics distribution centers location problem and algorithm under fuzzy environment. Journal of Computational and Applied Mathematics, 208(2), 303-315. https://doi.org/10.1016/j.cam.2006.09.015

ISSN 0128-7680

e-ISSN 2231-8526

Article ID

JST-3448-2022

Download Full Article PDF

Share this article

Related Articles