Data Mining with Clustering Algorithms to Reduce Packaging Costs: A Case Study

Research output: Contribution to journalArticle


title = "Data Mining with Clustering Algorithms to Reduce Packaging Costs: A Case Study",
abstract = "Reducing package-related cost is essential for various companies and institutions. Different packages are usually designed separately for each and every product, which results in less cost-effective packaging systems. In this study, a data mining model with three clustering algorithms was developed to modularize a packaging system by reducing the variety of packaging sizes. The three algorithms were k-means clustering, agglomerative hierarchical clustering and self-organizing feature map. The package models with similar shapes and sizes were clustered automatically and replaced by one package model with a size that suited them all. The study also analysed the financial effects including the purchasing and inventory costs of the package material and the transportation cost of the packaged products. The case study was carried out at Ericsson to select the best clustering algorithm of the three and to test the effectiveness and applicability of the proposed model. The results show that the packaging system modularized by the agglomerative hierarchical clustering algorithm is more cost-effective in this case compared with the ones modularized by the other two clustering algorithms and with the one without modularization.",
keywords = "agglomerative hierarchical clustering, case study, k-means clustering, package size, SOFM clustering",
author = "Chuan Zhao and Mats Johnsson and Mingke He",
year = "2017",
month = "5",
day = "1",
doi = "10.1002/pts.2286",
language = "English",
volume = "30",
pages = "173--193",
journal = "Packaging Technology and Science",
issn = "0894-3214",
publisher = "John Wiley & Sons",
number = "5",