标题: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 更多
通讯作者:Zhao, P
来源:Journal of Computational Information Systems
出版年:2011
卷:7
期:6
页码:1943-1950
关键词: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.
收录类别:EI;SCOPUS
Scopus被引频次:3
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-79959611662&partnerID=40&md5=dfbec26ca65629e8ccbdc6ba695c71c9
TOP