基于新型图论聚类法的物流系统多设施选址策略研究

中国管理科学 ›› 2012, Vol. 20 ›› Issue (6): 149-153.

基于新型图论聚类法的物流系统多设施选址策略研究

赵培忻¹, 张存铨², 赵炳新¹

1. 山东大学管理学院,山东济南 250100;
2. 西弗吉尼亚大学数学系,西弗吉尼亚摩根城 26506-6310

收稿日期:2011-08-20 修回日期:2012-09-05 出版日期:2012-12-29 发布日期:2012-12-28
基金资助:
教育部人文社科青年基金项目(12YJCZH303);中国博士后科学基金项目(2011M501149);山东省博士后创新项目专项资金资助项目(201103061);山东省自然科学基金项目(ZR2010GQ011)

Multi-facility Location Policy based on New Graph Theory Clustering Approach

ZHAO Pei-xin¹, ZHANG Cun-Quan², ZHAO Bing-xin¹

1. School of Management, Shandong University, Jinan 250100, China;
2. Department of Mathematics, West Virginia University, Morgantown 26506-6310, America

Received:2011-08-20 Revised:2012-09-05 Online:2012-12-29 Published:2012-12-28

摘要/Abstract

摘要： 提出了一类基于图论的新型聚类算法并将其应用于物流系统中的多设施选址问题。与其他聚类算法相比,该新型算法聚类效率更高且具有更小的聚类树,从而使得有意义的聚类结果更加清晰。比较算例验证了该算法应用于多设施选址问题的高效性和实用性。

关键词: 物流, 聚类, 多设施选址, 图论

Abstract: A novel clustering approach is proposed and applied to the multi-facility location problem. Compared with most traditional methods, this new algorithm has a distinguished feature: smaller hierarchical tree which significantly reduces further manual efforts for cluster selections. A simulation example for comparison illustrates the effectiveness of the proposed approach.

Key words: logistics, cluster, multi-facility location, graph theor

中图分类号:

C931 O22

赵培忻, 张存铨, 赵炳新. 基于新型图论聚类法的物流系统多设施选址策略研究[J]. 中国管理科学, 2012, 20(6): 149-153.

ZHAO Pei-xin, ZHANG Cun-Quan, ZHAO Bing-xin. Multi-facility Location Policy based on New Graph Theory Clustering Approach[J]. Chinese Journal of Management Science, 2012, 20(6): 149-153.

参考文献

[1] Melo M T, Nickel S, Saldanha-da-Gama F. Facility location and supply chain management: A review[J]. European Journal of Operational Research, 2009, 196: 401-412.
[2] Drezner Z, Hamacher H W. Facility location: apploications and theory[M]. New York:Springer, 2004.
[3] 杨波.多品种随机数学模型的物流配送中心选址问题[J].中国管理科学,2003,11(2): 45-49.
[4] Klose A,Drexl A, Facility location models for distribution system design[J]. European Journal of Operational Research, 2005,162: 4-29.
[5] Revelle C S, Eiselt H A, Daskin M S. A bible- ography for some fundamental problem categories in discrete location science[J]. European Journal of Operational Research,2008,184:817-848.
[6] 刘敬青.物流设施选址研究的评述及展望[J]. 中国储运, 2007,(3):58-60.
[7] Kuehn A, Hamburger M.A heuristic program for location warehouses[J].Management Science, 1963, 6: 643-666.
[8] 蔡希贤,夏士智.物流合理化的数量方法[M].武汉: 华中理工学院出版社, 1985.
[9] 于海生,赵林度.物流网络中多设施选址模型[J].物流技术,2004,1,33-35.
[10] Jain A K, Murty M N, Flynn P J. Data clustering: a review[J]. ACM Computing Surveys, 1999, 31(3), 264-323.
[11] Fasulo D. An analysis of recent work on clustering algorithms. Technical Report UW-CSE-01-03-02,University of Washington, 1999.
[12] Ghosh J. Scalable clustering methods for data mining[M]//Ye N. Handbook of data mining. Lawrence Erlbaum, 2002.
[13] Shi Henghua, He Jingsha, Xu Xin, A clustering algorithm for the placement of measurement nodes in a measurement network[J]. Journal of Computational Information Systems, 2008, 4(6), 2539-2546.
[14] Zahn C T.Graph-theoretic methods for detecting and describing gestalt clusters[J]. IEEE trans Computer, 1971,20:68-86.
[15] 刘锁兰,王江涛,王建国,等.一种新的基于图论聚类的分割算法[J].计算机科学, 2008,135(19):245-247.
[16] Canel C, Khumawal B M, Law J, et al, An algorithm for the capacitated, multi-commodity multi-period facility location problem[J]. Computers & Operations Research, 2001,28(5):411-427.
[17] 孔继利,顾苧,孙欣,等.系统聚类和重心法在多节点配送中心选址中的研究[J].物流技术, 2010, 3, 83-85.
[18] Lee L H, Chew E P. A dynamic joint replenishment policy with auto-correlated demand[J]. European Journal of Operational Research.2005,165: 729-747.
[19] Tsai C Y,Tsai C Y, Huang P W. An association clustering algorithm for can-order policies in the joint replenishment problem[J]. International Journal of Production Economics, 2009,117:30-41.