期刊文献+

基于区间数的应急物资储备库最小费用选址模型 被引量:38

Minimum Cost Model of Emergency Material Storage `Location Based on Interval Number
下载PDF
导出
摘要 本文研究了基于区间数的应急物资储备库最小费用选址问题。给出了区间数的概念和运算,构建了参数为区间数的应急物资储备库最小费用选址模型,提出了求模型满意解的算法,最后通过算例分析说明该方法的有效性。 In this paper, a minimum cost model of emergency material storage location based on interval number is studied. First, the concept and operations of interval number are given. Second, the model of emergency material storage location based on interval number is set up, and the solution algorithm for this model is presented. Finally, a numerical example shows that the method is valid.
出处 《运筹与管理》 CSCD 北大核心 2010年第1期15-20,共6页 Operations Research and Management Science
基金 国家自然科学基金资助项目(NO:70471063 70771010) 985工程二期资助项目(NO:107008200400024)
关键词 管理工程 选址模型 区间数 应急物资储备库 management engineering location model interval number emergency material storage
  • 相关文献

参考文献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 problema[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 covering and sime extension[ J]. Soeio-Economic Planning Science, 1994, 28: 167-178.
  • 8Masood A B, Amr Motagy K, Colonel Ali Alsayed. A multi-objective model for locating fire stations[ J]. European Journal of Operational Reasearch, 1998, 110: 243-260.
  • 9Sydney C K. Chu Lisa Chu. A modeling framework for hospital location and service allocation[ 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 problem[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.

共引文献50

同被引文献434

引证文献38

二级引证文献255

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部