基于共同配送的配送中心选址及成本分摊问题研究
|
摘要
物流被认为是降低物资消耗,提高劳动生产率之后的“第三利润源泉”。物流的重要性逐渐被社会所认识到。但企业各自为战的配送活动导致了较高的物流配送成本,对城市交通造成了巨大的压力,同时对环境造成了一定的影响。如何整合社会资源以提升物流作业效率、降低物流成本,已经成为目前物流现代化目标中关键的课题之一。
共同配送能够增大配送作业的规模,实现物流资源的快速整合,提高物流资源的利用率,降低配送作业成本,是一种合理化的先进配送形式。从微观的角度看,企业可以达到配送作业的经济规模,提高物流作业效率,降低企业营运成本;不需要投入大量资金、设备、土地和人力等,可以节省企业资源;企业可以扩大市场范围,建立共存共荣的环境。从社会的角度来讲,共同配送可以减少社会车流总量,改善交通运输状况;提高车辆装载率,节省物流处理空间和人力资源,提升商业物流环境进而改善整体社会生活品质。所以,共同配送受到政府和企业的重视。但是,共同配送的开展并非一帆风顺,亟需理论上的指导。研究表明,影响共同配送开展的一个很重要的因素就是共同配送成本如何在参与企业之间实现合理的分摊,而共同配送中心的选址问题也直接影响到合作后的成本消耗状况,能否解决这两个问题将直接影响到共同配送的开展。
本文在分析总结前人研究成果的基础上,阐述了共同配送的基本理论,分析了开展共同配送的动机和共同配送的优势以及产生优势的机理,探讨了共同配送的三种实现方式。指出共同配送在开展之初有两个重要问题:一个是如何在共同配送联盟中选择配送中心,另一个是参与共同配送各方如何分配因实行共同配送后产生的成本(费用)的分摊。配送中心作为共同配送运作的基础设施,是构成共同配送活动的神经枢纽,对实施共同配送发挥着重要作用。本文先讨论了共同配送中心的分类,然后分析了配送中心选址的方法,给出一个选址算例,应用MATLAB进行求解。在探讨成本分摊问题时,文章先给出了共同配送成本分摊的原则,然后引入了一次分摊法、二次分摊法、夏普利值法、纳什谈判法和基于权重的群体不满意度函数,分析了各种成本分摊方法的优缺点,给出了共同配送成本分摊模型与方法的具体应用的一个算例,并对计算结果进行了比较分析。最后,对本文的工作进行了总结,并展望下一步的研究。
Logistics has been regarded as the third profit source after reducing the consumption of production and raising labor productivity. The importance of logistics has been realized by the society gradually. Since many enterprises carry out distribution separately, it has caused high cost of distribution, immense pressure on city traffic and certain effects on environment. Low efficiency of the integration restricted to improve logistic potential power. Consequently, how to integrate social resources to improve logistic operational efficiency, decrease operation cost, has became one of the most important question for discussion in Logistics modernization.
Common-Distribution is an effective way to integrate social resources, it causes big scale of distribution, realizes the rapid integration of logistics resources, raises usage rate of logistics resources and reduces the cost of distribution. Form the microcosmically viewing, participant companies could gain scale economic, increase operation efficiency, and reduce operational cost. Participant companies can save lots of resources, because they do not need much capital, equipment, land and manpower. They also gain development and expansion by concentrating on core-business. Common-distribution expanding market bound, breaking close selling net, facilitates establish concomitant, co-prosperity environment. From the macroscopically viewing, implementing common-distribution can bring our a lot of benefit, such as reducing total social traffic flux, allaying the possibility of jam in downtown because of unloading, ameliorating commercial logistic condition. So, government and enterprises are paying more and more attention to common-distribution. However, there are a lot of difficulties in carrying out common distribution and a lot of enterprises feel perplexed to the development. Studies have shown that there are two important factors that affect the development of common distribution are the allocation cost of among the enterprises and how to integrate the DCs which belong to all members in the cooperation alliances. The development of common distribution depends on whether the problems can be solved.
Firstly, the paper elaborates the concept, connotation and characteristics based on the achievements of predecessors, analyses the mechanism by which the benefits are caused, and also discusses the function to achieve Common-Distribution. Secondly, we have discussed the categories of DCs in Common-Distribution, analyzed the methods to solve DC location problem. The paper has given an answer to the problems by founding distribution location mathematical models and using MATLAB simulation. Then, the paper has given out principles of cost allocation and introduced five methods. An example has been given and verified the reasonability of the model. Finally, an overview of author’s work and prospect of the research have been presented.
共同配送能够增大配送作业的规模,实现物流资源的快速整合,提高物流资源的利用率,降低配送作业成本,是一种合理化的先进配送形式。从微观的角度看,企业可以达到配送作业的经济规模,提高物流作业效率,降低企业营运成本;不需要投入大量资金、设备、土地和人力等,可以节省企业资源;企业可以扩大市场范围,建立共存共荣的环境。从社会的角度来讲,共同配送可以减少社会车流总量,改善交通运输状况;提高车辆装载率,节省物流处理空间和人力资源,提升商业物流环境进而改善整体社会生活品质。所以,共同配送受到政府和企业的重视。但是,共同配送的开展并非一帆风顺,亟需理论上的指导。研究表明,影响共同配送开展的一个很重要的因素就是共同配送成本如何在参与企业之间实现合理的分摊,而共同配送中心的选址问题也直接影响到合作后的成本消耗状况,能否解决这两个问题将直接影响到共同配送的开展。
本文在分析总结前人研究成果的基础上,阐述了共同配送的基本理论,分析了开展共同配送的动机和共同配送的优势以及产生优势的机理,探讨了共同配送的三种实现方式。指出共同配送在开展之初有两个重要问题:一个是如何在共同配送联盟中选择配送中心,另一个是参与共同配送各方如何分配因实行共同配送后产生的成本(费用)的分摊。配送中心作为共同配送运作的基础设施,是构成共同配送活动的神经枢纽,对实施共同配送发挥着重要作用。本文先讨论了共同配送中心的分类,然后分析了配送中心选址的方法,给出一个选址算例,应用MATLAB进行求解。在探讨成本分摊问题时,文章先给出了共同配送成本分摊的原则,然后引入了一次分摊法、二次分摊法、夏普利值法、纳什谈判法和基于权重的群体不满意度函数,分析了各种成本分摊方法的优缺点,给出了共同配送成本分摊模型与方法的具体应用的一个算例,并对计算结果进行了比较分析。最后,对本文的工作进行了总结,并展望下一步的研究。
Logistics has been regarded as the third profit source after reducing the consumption of production and raising labor productivity. The importance of logistics has been realized by the society gradually. Since many enterprises carry out distribution separately, it has caused high cost of distribution, immense pressure on city traffic and certain effects on environment. Low efficiency of the integration restricted to improve logistic potential power. Consequently, how to integrate social resources to improve logistic operational efficiency, decrease operation cost, has became one of the most important question for discussion in Logistics modernization.
Common-Distribution is an effective way to integrate social resources, it causes big scale of distribution, realizes the rapid integration of logistics resources, raises usage rate of logistics resources and reduces the cost of distribution. Form the microcosmically viewing, participant companies could gain scale economic, increase operation efficiency, and reduce operational cost. Participant companies can save lots of resources, because they do not need much capital, equipment, land and manpower. They also gain development and expansion by concentrating on core-business. Common-distribution expanding market bound, breaking close selling net, facilitates establish concomitant, co-prosperity environment. From the macroscopically viewing, implementing common-distribution can bring our a lot of benefit, such as reducing total social traffic flux, allaying the possibility of jam in downtown because of unloading, ameliorating commercial logistic condition. So, government and enterprises are paying more and more attention to common-distribution. However, there are a lot of difficulties in carrying out common distribution and a lot of enterprises feel perplexed to the development. Studies have shown that there are two important factors that affect the development of common distribution are the allocation cost of among the enterprises and how to integrate the DCs which belong to all members in the cooperation alliances. The development of common distribution depends on whether the problems can be solved.
Firstly, the paper elaborates the concept, connotation and characteristics based on the achievements of predecessors, analyses the mechanism by which the benefits are caused, and also discusses the function to achieve Common-Distribution. Secondly, we have discussed the categories of DCs in Common-Distribution, analyzed the methods to solve DC location problem. The paper has given an answer to the problems by founding distribution location mathematical models and using MATLAB simulation. Then, the paper has given out principles of cost allocation and introduced five methods. An example has been given and verified the reasonability of the model. Finally, an overview of author’s work and prospect of the research have been presented.
引文
①杭中茂.整合物流资源,加快发展现代物流[J].江南论坛,2002,6:31-32
①徐天亮.运输与配送[M].北京:中国物资出版社,2002,第1版
②运输省流通对策本部:共同运输系统导入推进纲要.[R].日本
①北冈正敏.物流系统シスリ厶计设のすすめ方[M].日本:中央经济社,1990,第1版
②《中华人民共和国标准·物流术语》.2001
③王之泰.现代物流学[M].北京:北京物资学院出版社,2001,第1版
④崔介何.物流学[M].北京:北京大学出版社,2003,第1版
⑤李京文,徐寿波.物流学及其应用[M].北京:人民交通出版社,1987,第1版
⑥何明珂.现代物流与配送中心:推动流通创新的趋势[M].北京:人民交通出版社,1997,第1版
⑦国内贸易部行业管理一司人事部人事考试中心组编.商业经济专业知识与实务.1999
①刘培松.连锁营销[M].湖南出版社,1999,第1版
②何景华.共同配送——配送物流发展的新趋势[J].世界海运,2001,5
③李建华,顾穗珊.物流成本及其管理模式的研究[J].吉林大学社会科学学报,2004,1:88-94
①牛东来.日本零售业物流启示录之五——共同配送[J].商场现代化,2005,2:24-25
②宋华.日本7-11—为顾客提供最大的便利[M].北京:中国人民大学出版社,2000,第1版
③花房陵(著),聂永有(译).物流构造(日)[M].上海:文匯出版社,2002,第1版
①Lisa H. Harrington. Strategic Alliances: Road to the future [J]. Inbound logistics,1992,Vol.12,No.8. 20-23
②Rosabeth Moss Kanter. Collaborative Advantage: The Art of Alliances [J]. Harvard Business Review,1994,Vol.72,No.4,100-106
③吕一林.美国沃尔玛—世界零售第一[M].北京:中国人民大学出版社,2000,第1版
①江宏.联华便利物流中心:构建高效合理的物流系统[J].物流技术与应用,2002,(4):19-23
②汤浅和夫(日).物流管理入门[M].北京:中国铁道出版社,1986,第2版
③MinH, Cooper. A Comparative Review of Analytical Studies on Freight Consolidation and Backhauling [J]. Logistics and Transportation Review,1990,26 (2):149-169
①M.Grazia Speranza, Paul Stahly, New Trend In Distribution logistics[M],北京:清华大学出版社,2003,第1版
②王之泰.现代物流管理[M].北京:中国工人出版社,2001,第1版
③孙宏岭.高效率配送中心的设计与经营[M].北京:中国物资出版社,2002,第1版
④孙明贵.物流管理学[M].北京:北京大学出版社,2002,第1版
①赫渊晓.现代物流配送管理[M].广州:中山大学出版社,2001,第1版.
②张悦来.关于共同配送的思考[J].商品储运与养护,2001,(2):19-22
③Weber A. Uber den Standort der Industrien[M]. Teil: Reine Theories des standorts. Verlag J.C. B. Mohr, Tübingen, 1909
④Hotelling H. Stability in Competition[J]. Economic Journal, 1929, 39(1): 41-57
⑤Hakimi S L. Optimum distribution of switching centers in a communication network and some relatedgraph theoretic problems[J]. Operations Research, 1965, 13(1): 462-475
①Weiszfeld E. Sur le point pour lequel la somme des distances de n points donnés est mini mum [J]. Tohoku Mathematical Journal, 1937, 43(1): 355-386
②Wesolowsky G O. The Weber Problem: History and Perspectives [J]. Location Science, 1993, 1(1): 5-23
③Rosing K E. An optimal method for solving the (generalized) multi-Weber problem[J]. European Journal of Operational Research, 1992b, 58(3): 414-426
①鲁晓春,詹菏生.关于配送中心重心法选址的研究[J].北方交通大学学报. 2000.12
②周梅华.论集约化商品配送中心的选择[J].中国矿业大学学报. 2000,11
③高学东,李宗元.物流中心选址模型及一种启发式算法[J].运筹与管理. 1994,11
④保罗.A.萨缪尔森,威廉.D.诺德豪斯.高鸿业等译.经济学[M].北京:中国发展出版社. 1994,第12版
①郑立群,吴育华,夏庆等.同质成本分配方法及其公理性质研究[J].天津大学学报,2001,34 (5):591-595
②陈伟,查迎春.关于成本分摊的合作博弈方法[J].运筹与管理. 2004,4
①何明珂,石一兵.在我国食品流通领域实施集约化共同配送的有关问题[J].北京商学院学报,1995,(6):58-60
①高鸿业.西方经济学[M].北京:中国人民大学出版社,1996,第1版
①平狄克,鲁宾费尔德.微观经济学[M].北京:中国人民大学出版社,1997,第1版
②李学伟,曾建平,卢勃.中国物流交易模式理论[M].北京:清华大学出版社;北京交通大学出版社,2004,第1版
③陈菲琼.企业知识联盟—理论与实证研究[M].北京:商务印书馆,2003,第1版
①郭耀煌等,运筹学原理与方法[M].西南交通大学出版社,1994,第1版
①蔡临林.物流系统规划——建模及实例分析[M].北京:机械工业出版社,2003,第1版
①许淑君,马士华.从委托-代理理论看我国供应链企业间的合作关系[J].计算机集成制造系统,2000,(12):16-19
①王国成,黄韬.现代经济博弈论:市场经济中的竞争与对策[M].经济科学出版社,1996,第1版
[1] Lisa H. Harrington,Strategic Alliances: Road to the future [J]. Inbound logistics,1992,Vol.12
[2] Rosabeth Moss Kanter,Collaborative Advantage: The Art of Alliances[J]. Harvard Business Review.1994,Vol.72
[3]王之泰.现代物流学[M].北京:北京物资学院出版社,1998,第1版
[4]汤浅和夫[日],靳伟,薛宝田等.物流管理入门[M].北京:中国铁道出版社,1986,第1版
[5]徐天亮.运输与配送[M].北京:中国物资出版社,2002,第1版
[6]日道综合研究所编著.物流手册[M].北京:中国物资出版社,1990,第1版
[7]运输省流通对策本部:共同运输系统导入推进纲要.[R].日本
[8]花房陵(著),聂永有(译).物流构造(日)[M].上海:文匯出版社,2002,第1版
[9]《中华人民共和国标准·物流术语》.2001
[10]吕一林.美国沃尔玛——世界零售第一[M].北京:中国人民大学出版社,2000,第1版
[11]崔介何.物流学[M].北京:北京大学出版社,2003,第1版
[12]李京文,徐寿波.物流学及其应用[M].北京:人民交通出版社,1987,第1版
[13]何明珂.现代物流与配送中心:推动流通创新的趋势[M].北京:人民交通出版社,1997,第1版
[14]国内贸易部行业管理一司人事部人事考试中心组编.商业经济专业知识与实务.1999
[15]孙明贵.物流管理学[M].北京:北京大学出版社,2002,第1版
[16]江宏.联华便利物流中心:构建高效合理的物流系统[J].物流技术与应用,2002,(4):19-23
[17]保罗.A.萨缪尔森,威廉.D.诺德豪斯.经济学[M].高鸿业等译.北京:中国发展出版社,1994,第1版
[18]许淑君,马士华.从委托-代理理论看我国供应链企业间的合作关系[J].计算机集成制造系统,2000,(12):16-19
[19]宋华.日本7-11—为顾客提供最大的便利[M].北京:中国人民大学出版社,2000,第1版
[20] MinH, Cooper. A Comparative Review of Analytical Studies on Freight Consolidation and Backhauling [J]. Logistics and Transportation Review, 1990, 26 (2)
[21] M.Grazia Speranza, Paul Stahly, New Trend In Distribution logistics[M],北京:清华大学出版社,2003
[22] Drezner Z. The planer two-center and two-median problems [J]. Transportation Science, 1984, 18(1): 351-361
[23] Krarup J, Pruzan P M. Selected families of location problems [J]. Annals of Discrete Mathematics, 1979, 5(1): 327-387
[24] Weiszfeld E. Sur le point pour lequel la somme des distances de n points donnés est mini mum [J]. Tohoku Mathematical Journal, 1937, 43(1): 355-386
[25] Klamroth K. Planar Weber location problems with line barriers [J]. Optimization, 2001, 49(1): 517-527
[26] Erkut E, Neuman S. Analytical models for location undesirable facilities [J]. European Journal of Operational Research, 1989, 40(1):275-291
[27] Goldengorin B, Ghosh D, Sierksma G. Branch and peg algorithms for the simple plant locatio problem[J]. Computers & Operations Research, 2003, 30(7): 967-981
[28] Rosing K E. An Optimal Method for solving the (generalized) Multi-Weber Problem [J]. European Journal of Operational Research, 1992b, 58(3): 414-426
[29] Chen P C, Hansen P, Jaumard B, et al. Solution of the Multi-Source Weber and Conditional Weber Problems by d.-c. Programming [J]. OperationResearch, 1998, 46(4):548-562.
[30] Christofides N, Beasley J E. A Tree-Search Algorithm for the p-median problem [J]. European Journal of Operational Research, 1982, 10 (1):196-204
[31] Hanjoul P, Peeters D. A Comparison of two Dual-Based Procedures for Solving the P-Median Problem [J]. European Journal of Operational Research, 1985, 20(1): 387-396
[32] Beasley J E. Lagrange a heuristics for location problems [J]. European Journal of Operational Research, 1993, 65(1): 383-399
[33] Klose A. Das Kombinatorische p-median-Modell und Erweiterungen zur Bestimmung optimaler Standorte[D]. Dissertation Nr. 1464, Hochschule St. gallen, Dufourstrasse 50, Ch-90000 St. Gallen, 1993
[34] Dobson G, Karmarkar US. Competitive location on a network [J]. Operations Research, 1987, 35(1):565-574
[35] Hakimi S L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems [J]. Operations Research, 1965, 13(1): 462-475
[36] Efroymson M A, Ray T L. A Branch-and-Bound Algorithm for Plant Location [J]. Operations Research, 1996, 14(5):361-368
[37] Erlenkotter D. A dual-based procedure for incapacitated facility location [J]. Operations Research, 1978, 26(1): 992-1009
[38] Ryu C, Guignard M. An Exact algorithm for the simple plant location problem with an aggregate capacity constraint [R]. Working paper 92-04-09, Decision Sciences Department, University of Pennsylvania, The Wharton School
[39] Min H, Jayaraman V, Srivastava R. Combined location-routing problems: A synthesis and future research directions [J]. European Journal of Operational Research, 1998, 108(1):1-15
[40] Perl J. A unified warehouse location-routing analysis [D]. PhD Dissertation, Department of Civil Engineering, Northwestern University, Evanston, IL, 1983
[55] Schhilling DA, Jayaraman V, Barkhi R. A review of covering problems in facility location [J], 1993, 1(1): 25-55
[41]马云峰.网络选址中基于时间满意的覆盖问题研究[D].华中科技大学,2005 [42] LBillera,D Heath,J Raanan. International telephone billing rates: A novel application of non atomic game theory [J].Operations Research, 1978, 26(6):956-965
[43] J Roemer, J Silvestre. The proportional solution for economies with both private and public ownership [J]. Journal of Economic Theory, 1993, 59: 426-444
[44] Yu C W, David A K, Wong Y K. The use of game theory in transmission embedded cost allocation. 2000 International Conference on Advances in Power System Control, Operation and Management. Hong Kong (China), 2000, 1: 139-143
[45] BakirtzisAG... Aumann-Shapley transmission congestion pricing. IEEE Power Engineering Review, 2001, 21(3):67-69
[46] Lo K L, Lozano C A, Gers O J M. Game theory application for determining wheeling charges. Proceedings International Conference on Electronic Utility Deregulation and Restructuring and Power Technologies. London (UK), 2000, 308-313
[47]曹卫华,郭正.最优化技术方法及MATLAB的实现[M].化学工业出版社,2005,第1版
[48]鲁晓春,詹菏生.关于配送中心重心法选址的研究[J].北方交通大学学报. 2000,(12)
[49]袁庆达,陈旭梅,基于“服务型”物流战略的P-Center选址问题研究[J].西南交通大学学报,2001,(3)
[50]高学东,李宗元.物流中心选址模型及一种启发式算法[J].运筹与管理,1994,(11)
[51]姜大立,杜文.易腐物品物流配送中心选址的遗传算法[J].西南交通大学学报,1998,33,(4)
[52]王战权.配送中心选址的遗传算法研究[J].实用物流技术,2001,(3)
[53]刘海燕,李宗平,物流配送中心选址模型[J].西南交通大学学报,2000,(3)
[54]郑立群,吴育华,夏庆等.同质成本分配方法及其公理性质研究[J].天津大学学报,2001,34(5):591-595
[56]陈伟,查迎春.关于成本分摊的合作博弈方法[J].运筹与管理,2004,(4)
[57]叶志坚,杜文,向秋.共同配送问题中的费用分担[J].系统工程理论方法应用,2004,(03)
[58]丁浩,李电声.城市物流配送中心选址方法的研究[J].华中科技大学学报,2004,21, (1):50-54
[59]高鸿业.西方经济学[M].北京:中国人民大学出版社,2001,第1版
[60]平狄克,鲁宾费尔德.微观经济学[M].北京:中国人民大学出版社,1997,第1版
[61]王国成,黄韬,现代经济博弈论:市场经济中的竞争与对策[M].经济科学出版社,1996,第1版
[62]陈菲琼.企业知识联盟——理论与实证研究[M].北京:商务印书馆,2003,第1版
[63]汝宜红,配送中心规划[M].北方交通大学出版社,2004,第1版
①徐天亮.运输与配送[M].北京:中国物资出版社,2002,第1版
②运输省流通对策本部:共同运输系统导入推进纲要.[R].日本
①北冈正敏.物流系统シスリ厶计设のすすめ方[M].日本:中央经济社,1990,第1版
②《中华人民共和国标准·物流术语》.2001
③王之泰.现代物流学[M].北京:北京物资学院出版社,2001,第1版
④崔介何.物流学[M].北京:北京大学出版社,2003,第1版
⑤李京文,徐寿波.物流学及其应用[M].北京:人民交通出版社,1987,第1版
⑥何明珂.现代物流与配送中心:推动流通创新的趋势[M].北京:人民交通出版社,1997,第1版
⑦国内贸易部行业管理一司人事部人事考试中心组编.商业经济专业知识与实务.1999
①刘培松.连锁营销[M].湖南出版社,1999,第1版
②何景华.共同配送——配送物流发展的新趋势[J].世界海运,2001,5
③李建华,顾穗珊.物流成本及其管理模式的研究[J].吉林大学社会科学学报,2004,1:88-94
①牛东来.日本零售业物流启示录之五——共同配送[J].商场现代化,2005,2:24-25
②宋华.日本7-11—为顾客提供最大的便利[M].北京:中国人民大学出版社,2000,第1版
③花房陵(著),聂永有(译).物流构造(日)[M].上海:文匯出版社,2002,第1版
①Lisa H. Harrington. Strategic Alliances: Road to the future [J]. Inbound logistics,1992,Vol.12,No.8. 20-23
②Rosabeth Moss Kanter. Collaborative Advantage: The Art of Alliances [J]. Harvard Business Review,1994,Vol.72,No.4,100-106
③吕一林.美国沃尔玛—世界零售第一[M].北京:中国人民大学出版社,2000,第1版
①江宏.联华便利物流中心:构建高效合理的物流系统[J].物流技术与应用,2002,(4):19-23
②汤浅和夫(日).物流管理入门[M].北京:中国铁道出版社,1986,第2版
③MinH, Cooper. A Comparative Review of Analytical Studies on Freight Consolidation and Backhauling [J]. Logistics and Transportation Review,1990,26 (2):149-169
①M.Grazia Speranza, Paul Stahly, New Trend In Distribution logistics[M],北京:清华大学出版社,2003,第1版
②王之泰.现代物流管理[M].北京:中国工人出版社,2001,第1版
③孙宏岭.高效率配送中心的设计与经营[M].北京:中国物资出版社,2002,第1版
④孙明贵.物流管理学[M].北京:北京大学出版社,2002,第1版
①赫渊晓.现代物流配送管理[M].广州:中山大学出版社,2001,第1版.
②张悦来.关于共同配送的思考[J].商品储运与养护,2001,(2):19-22
③Weber A. Uber den Standort der Industrien[M]. Teil: Reine Theories des standorts. Verlag J.C. B. Mohr, Tübingen, 1909
④Hotelling H. Stability in Competition[J]. Economic Journal, 1929, 39(1): 41-57
⑤Hakimi S L. Optimum distribution of switching centers in a communication network and some relatedgraph theoretic problems[J]. Operations Research, 1965, 13(1): 462-475
①Weiszfeld E. Sur le point pour lequel la somme des distances de n points donnés est mini mum [J]. Tohoku Mathematical Journal, 1937, 43(1): 355-386
②Wesolowsky G O. The Weber Problem: History and Perspectives [J]. Location Science, 1993, 1(1): 5-23
③Rosing K E. An optimal method for solving the (generalized) multi-Weber problem[J]. European Journal of Operational Research, 1992b, 58(3): 414-426
①鲁晓春,詹菏生.关于配送中心重心法选址的研究[J].北方交通大学学报. 2000.12
②周梅华.论集约化商品配送中心的选择[J].中国矿业大学学报. 2000,11
③高学东,李宗元.物流中心选址模型及一种启发式算法[J].运筹与管理. 1994,11
④保罗.A.萨缪尔森,威廉.D.诺德豪斯.高鸿业等译.经济学[M].北京:中国发展出版社. 1994,第12版
①郑立群,吴育华,夏庆等.同质成本分配方法及其公理性质研究[J].天津大学学报,2001,34 (5):591-595
②陈伟,查迎春.关于成本分摊的合作博弈方法[J].运筹与管理. 2004,4
①何明珂,石一兵.在我国食品流通领域实施集约化共同配送的有关问题[J].北京商学院学报,1995,(6):58-60
①高鸿业.西方经济学[M].北京:中国人民大学出版社,1996,第1版
①平狄克,鲁宾费尔德.微观经济学[M].北京:中国人民大学出版社,1997,第1版
②李学伟,曾建平,卢勃.中国物流交易模式理论[M].北京:清华大学出版社;北京交通大学出版社,2004,第1版
③陈菲琼.企业知识联盟—理论与实证研究[M].北京:商务印书馆,2003,第1版
①郭耀煌等,运筹学原理与方法[M].西南交通大学出版社,1994,第1版
①蔡临林.物流系统规划——建模及实例分析[M].北京:机械工业出版社,2003,第1版
①许淑君,马士华.从委托-代理理论看我国供应链企业间的合作关系[J].计算机集成制造系统,2000,(12):16-19
①王国成,黄韬.现代经济博弈论:市场经济中的竞争与对策[M].经济科学出版社,1996,第1版
[1] Lisa H. Harrington,Strategic Alliances: Road to the future [J]. Inbound logistics,1992,Vol.12
[2] Rosabeth Moss Kanter,Collaborative Advantage: The Art of Alliances[J]. Harvard Business Review.1994,Vol.72
[3]王之泰.现代物流学[M].北京:北京物资学院出版社,1998,第1版
[4]汤浅和夫[日],靳伟,薛宝田等.物流管理入门[M].北京:中国铁道出版社,1986,第1版
[5]徐天亮.运输与配送[M].北京:中国物资出版社,2002,第1版
[6]日道综合研究所编著.物流手册[M].北京:中国物资出版社,1990,第1版
[7]运输省流通对策本部:共同运输系统导入推进纲要.[R].日本
[8]花房陵(著),聂永有(译).物流构造(日)[M].上海:文匯出版社,2002,第1版
[9]《中华人民共和国标准·物流术语》.2001
[10]吕一林.美国沃尔玛——世界零售第一[M].北京:中国人民大学出版社,2000,第1版
[11]崔介何.物流学[M].北京:北京大学出版社,2003,第1版
[12]李京文,徐寿波.物流学及其应用[M].北京:人民交通出版社,1987,第1版
[13]何明珂.现代物流与配送中心:推动流通创新的趋势[M].北京:人民交通出版社,1997,第1版
[14]国内贸易部行业管理一司人事部人事考试中心组编.商业经济专业知识与实务.1999
[15]孙明贵.物流管理学[M].北京:北京大学出版社,2002,第1版
[16]江宏.联华便利物流中心:构建高效合理的物流系统[J].物流技术与应用,2002,(4):19-23
[17]保罗.A.萨缪尔森,威廉.D.诺德豪斯.经济学[M].高鸿业等译.北京:中国发展出版社,1994,第1版
[18]许淑君,马士华.从委托-代理理论看我国供应链企业间的合作关系[J].计算机集成制造系统,2000,(12):16-19
[19]宋华.日本7-11—为顾客提供最大的便利[M].北京:中国人民大学出版社,2000,第1版
[20] MinH, Cooper. A Comparative Review of Analytical Studies on Freight Consolidation and Backhauling [J]. Logistics and Transportation Review, 1990, 26 (2)
[21] M.Grazia Speranza, Paul Stahly, New Trend In Distribution logistics[M],北京:清华大学出版社,2003
[22] Drezner Z. The planer two-center and two-median problems [J]. Transportation Science, 1984, 18(1): 351-361
[23] Krarup J, Pruzan P M. Selected families of location problems [J]. Annals of Discrete Mathematics, 1979, 5(1): 327-387
[24] Weiszfeld E. Sur le point pour lequel la somme des distances de n points donnés est mini mum [J]. Tohoku Mathematical Journal, 1937, 43(1): 355-386
[25] Klamroth K. Planar Weber location problems with line barriers [J]. Optimization, 2001, 49(1): 517-527
[26] Erkut E, Neuman S. Analytical models for location undesirable facilities [J]. European Journal of Operational Research, 1989, 40(1):275-291
[27] Goldengorin B, Ghosh D, Sierksma G. Branch and peg algorithms for the simple plant locatio problem[J]. Computers & Operations Research, 2003, 30(7): 967-981
[28] Rosing K E. An Optimal Method for solving the (generalized) Multi-Weber Problem [J]. European Journal of Operational Research, 1992b, 58(3): 414-426
[29] Chen P C, Hansen P, Jaumard B, et al. Solution of the Multi-Source Weber and Conditional Weber Problems by d.-c. Programming [J]. OperationResearch, 1998, 46(4):548-562.
[30] Christofides N, Beasley J E. A Tree-Search Algorithm for the p-median problem [J]. European Journal of Operational Research, 1982, 10 (1):196-204
[31] Hanjoul P, Peeters D. A Comparison of two Dual-Based Procedures for Solving the P-Median Problem [J]. European Journal of Operational Research, 1985, 20(1): 387-396
[32] Beasley J E. Lagrange a heuristics for location problems [J]. European Journal of Operational Research, 1993, 65(1): 383-399
[33] Klose A. Das Kombinatorische p-median-Modell und Erweiterungen zur Bestimmung optimaler Standorte[D]. Dissertation Nr. 1464, Hochschule St. gallen, Dufourstrasse 50, Ch-90000 St. Gallen, 1993
[34] Dobson G, Karmarkar US. Competitive location on a network [J]. Operations Research, 1987, 35(1):565-574
[35] Hakimi S L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems [J]. Operations Research, 1965, 13(1): 462-475
[36] Efroymson M A, Ray T L. A Branch-and-Bound Algorithm for Plant Location [J]. Operations Research, 1996, 14(5):361-368
[37] Erlenkotter D. A dual-based procedure for incapacitated facility location [J]. Operations Research, 1978, 26(1): 992-1009
[38] Ryu C, Guignard M. An Exact algorithm for the simple plant location problem with an aggregate capacity constraint [R]. Working paper 92-04-09, Decision Sciences Department, University of Pennsylvania, The Wharton School
[39] Min H, Jayaraman V, Srivastava R. Combined location-routing problems: A synthesis and future research directions [J]. European Journal of Operational Research, 1998, 108(1):1-15
[40] Perl J. A unified warehouse location-routing analysis [D]. PhD Dissertation, Department of Civil Engineering, Northwestern University, Evanston, IL, 1983
[55] Schhilling DA, Jayaraman V, Barkhi R. A review of covering problems in facility location [J], 1993, 1(1): 25-55
[41]马云峰.网络选址中基于时间满意的覆盖问题研究[D].华中科技大学,2005 [42] LBillera,D Heath,J Raanan. International telephone billing rates: A novel application of non atomic game theory [J].Operations Research, 1978, 26(6):956-965
[43] J Roemer, J Silvestre. The proportional solution for economies with both private and public ownership [J]. Journal of Economic Theory, 1993, 59: 426-444
[44] Yu C W, David A K, Wong Y K. The use of game theory in transmission embedded cost allocation. 2000 International Conference on Advances in Power System Control, Operation and Management. Hong Kong (China), 2000, 1: 139-143
[45] BakirtzisAG... Aumann-Shapley transmission congestion pricing. IEEE Power Engineering Review, 2001, 21(3):67-69
[46] Lo K L, Lozano C A, Gers O J M. Game theory application for determining wheeling charges. Proceedings International Conference on Electronic Utility Deregulation and Restructuring and Power Technologies. London (UK), 2000, 308-313
[47]曹卫华,郭正.最优化技术方法及MATLAB的实现[M].化学工业出版社,2005,第1版
[48]鲁晓春,詹菏生.关于配送中心重心法选址的研究[J].北方交通大学学报. 2000,(12)
[49]袁庆达,陈旭梅,基于“服务型”物流战略的P-Center选址问题研究[J].西南交通大学学报,2001,(3)
[50]高学东,李宗元.物流中心选址模型及一种启发式算法[J].运筹与管理,1994,(11)
[51]姜大立,杜文.易腐物品物流配送中心选址的遗传算法[J].西南交通大学学报,1998,33,(4)
[52]王战权.配送中心选址的遗传算法研究[J].实用物流技术,2001,(3)
[53]刘海燕,李宗平,物流配送中心选址模型[J].西南交通大学学报,2000,(3)
[54]郑立群,吴育华,夏庆等.同质成本分配方法及其公理性质研究[J].天津大学学报,2001,34(5):591-595
[56]陈伟,查迎春.关于成本分摊的合作博弈方法[J].运筹与管理,2004,(4)
[57]叶志坚,杜文,向秋.共同配送问题中的费用分担[J].系统工程理论方法应用,2004,(03)
[58]丁浩,李电声.城市物流配送中心选址方法的研究[J].华中科技大学学报,2004,21, (1):50-54
[59]高鸿业.西方经济学[M].北京:中国人民大学出版社,2001,第1版
[60]平狄克,鲁宾费尔德.微观经济学[M].北京:中国人民大学出版社,1997,第1版
[61]王国成,黄韬,现代经济博弈论:市场经济中的竞争与对策[M].经济科学出版社,1996,第1版
[62]陈菲琼.企业知识联盟——理论与实证研究[M].北京:商务印书馆,2003,第1版
[63]汝宜红,配送中心规划[M].北方交通大学出版社,2004,第1版