标题：A new clustering algorithm for can-order policies in joint replenishment problem
作者：Zhao, Peixin ;Zhang, Cunquan ;Zhang, Xin
作者机构：[Zhao, Peixin ] School of Management, Shandong University, Jinan 250100, China;[Zhang, Xin ] Foundation Department, Shandong College of Electronic Tec 更多
来源：Journal of Computational Information Systems
关键词：Can-order policy; Cluster; Joint replenishment problem
摘要：A novel clustering algorithm is proposed and applied to the multi-item replenishment processing. This new algorithm has two distinguished features: non-binary hierarchical tree and the feature of overlapping clustering. A non-binary hierarchical tree is much smaller than the binary-trees constructed by most traditional algorithms and, therefore, it clearly highlights meaningful clusters which significantly reduce further manual efforts for cluster selections. The feature of overlapping clustering provides a better replenishment strategy for some single item that shares inventory patterns with more than one cluster. A simulation example for comparison illustrates the effectiveness of the proposed algorithm. Copyright © 2011 Binary Information Press.