应急物资储备库最小加权距离选址模型被引量：10

Minimum weighed distance model of emergency material storage location

下载PDF

导出

摘要研究了基于梯形模糊数的应急物资储备库最小加权距离选址模型。给出了梯形模糊数的概念和运算,构建了目标函数中参数为梯形模糊数的应急物资储备库最小加权距离选址模型,提出了求解该问题α-水平最优解的算法,最后通过算例分析说明该方法的有效性。 In this paper,a minimum weighed distance model of emergency material storage location based on trapezoidal fuzzy numbers is studied.Firstly,the concept and operations of trapezoidal fuzzy numbers are given.Secondly,the model of emergency material storage location with trapezoidal fuzzy number in objective function is set up,and the solution algorithm for this model is presented.Finally, a numerical example shows the valiadity of the method.

作者郭子雪齐美然张强

机构地区河北大学管理学院北京理工大学管理与经济学院

出处《计算机工程与应用》 CSCD 北大核心 2009年第34期195-197,200,共4页 Computer Engineering and Applications

基金国家自然科学基金No.70471063 No.70771010~~

关键词管理工程应急物资储备库选址模型梯形模糊数 management engineering emergency material storage location model trapezoidal fuzzy numbers

分类号 F253.4 [经济管理—国民经济]

引文网络
相关文献

参考文献13

1Hakimi S L.Optimal location of switching centers and the absolute centers and medians of a graph[J].Operations Research,1964,12: 156-164.
2Roth R.Computer solutions to minimum cover problems[J].Operation Research, 1969,17 : 455-465.
3Revelle C,Swain R W.Central facilities location[J].Geographical Analysis, 1970,2 : 30-42.
4Kariv O,Hakimi S.An algorithmic approach to network location problems[J].SIAM J Appl Math, 1979,37 : 513-538.
5Tanaka H,Asai K.A formulation of fuzzy linear programming based on comparison of fuzzy numbers[J].Control and Cybernet, 1984,13: 185-194.
6Beasley J E,Jomsten K.Enhancing an algorithm for set covering problems[J].European Journal of Operational Research, 1992,58: 293-300.
7Vladimir M,Charles R.The queuing probabilistic location set coveting and sime extension[J].Socio--Economic Planning Science, 1994, 28 : 167-178.
8Masood A B,Motagy A K,Alsayed C A.A muhi-objective model for locating fire stations[J].European Journal of Operational Reasearch, 1998,110: 243-260.
9Chu S C K,Chu L.A modeling framework for hospital location and service alloeation[J].International Transactions in Operational Research, 2000,7 : 539-568.
10Luis G,Acosta E,Roberto D G.Dual-based heuristics for a hierachical covering location probtem[J].Computers & Operations Research, 2003,30 : 65-185.

二级参考文献11

1陈伯成.利用距离矩阵求绝对中心及绝对重心的讨论(p=1)[J].系统工程理论与实践,1997,17(1):1-7. 被引量：10
2汪培庄，应用模糊数学，1989年，214页
3吴望名，应用模糊集方法，1985年，164页
4Hakimi S. L. Optimum locations of switching centers and the absolute centers and medians of a graph[J]. Operations Research, 1965,13:450～459.
5Current J, Min H, Schilling D. Mutiobjective analysis of facility location decisions[J]. European Journal of Operational Research, 1990,49: 295～307.
6Kariv O And Hakimi SL. An algorithmic approach to network location problems, Part I, the P-centers[J]. SIAM. J. Appl. Math, 1997a, 37:513 - 538.
7Averbakh I, Berman Oded. Minimax regret p-center location on a network with demand uncertainy[J]. Location Science, 1997,5(4): 247～254.
8Arie tamir, Dionision Pérez-Brito, JoséA, Moreno-Pérez. Polynomial Algorithm for the p-centdian problem on a tree[J]. Networks, 1998,32(14):255 ～ 262.
9Douglas Moon I, Lee Papayanopoluos. Facility location on a tree with maximum distance constraints[J]. Computers and Operations Research,1995,22(9):905 ～ 914.
10Dionisio Pérez-Brito, José A. Moreno-Pérez. The 2-faclity centdian network problem[J]. Location Science, 1998,6:369 ～ 381.