期刊文献+

基于时延-容量转换的网络路径优选研究 被引量:1

Research on Paths Optimization in Network Using Delay-Capacity Conversion Method
下载PDF
导出
摘要 应急救灾、军事作战过程中需要进行大规模的物资调度,受运输网络容量的限制,保障物资需要在网络单元处等待并逐步转运,导致传输时延随物资数量的变化而呈现不确定性。本文在详细分析描述保障网络传输机制的基础上,提出一种基于网络时延-容量转换的建模方法,建立最小时延网络路径优选模型,并改进Dijkstra算法求解网络最优路径,最后应用算例验证模型正确性及算法有效性。 large-scale support material must be scheduled by logistics support network in disaster relief operations and military operations. However, support material may be transported through a unit in turn because of its' constrained capacity, which causes the transfer delay changing with the quantity of the given material. This paper analyzes and describes the transportation mechanism of the network, a kind of modeling method is proposed based on delay -capacity conversion. Then, a path selection optimization model with minimal delay is designed, and the optimal route can be figured out by a modified Dijkstra algorithm. Finally, an example is given to validate the validity of the model and the feasibility of this algorithm.
出处 《管理工程学报》 CSSCI 北大核心 2009年第3期111-114,共4页 Journal of Industrial Engineering and Engineering Management
基金 国家自然科学基金资助项目(70501032)
关键词 物流保障网络 时延-容量转换 路径优选 logistics support network delay-capacity conversion path selection optimization
  • 相关文献

参考文献8

二级参考文献20

  • 1董振宁,刘家壮.无容量限制的最小费用流问题[J].Journal of Mathematical Research and Exposition,2004,24(4):751-757. 被引量:4
  • 2张学渊,梁雄健.关于通信网可靠性定义的探讨[J].北京邮电大学学报,1997,20(2):30-35. 被引量:19
  • 3许俊明.图论及其应用[M].合肥:中国科学技术大学出版社,1998.46-48.
  • 4谢政 李建平.网络算法与复杂度理论[M].长沙:国防科技大学出版社,1995.78-84.
  • 5石垒著.高技术局部战争装备保障[M].北京:国防大学出版社,2001..
  • 6.GJB451—90.可靠性维修性术语[S].,..
  • 7<运筹学>教材编写组.运筹学[M].北京:清华大学出版社,1990..
  • 8Goldberg A V,Rao S. Flows in undirected unit capacity networks[A]. Proceedings of 38th IEEE Annual Symposium on Foundations of Computer Science[C]. New York: ACM Press, 1997:2~35.
  • 9Karger D R. Better random sampling algorithms for flows in undirected graphs[A]. Proceedings of 9th ACM-SIAM Symposium on Discrete Algorithms[C]. New York:ACM Press, 1998:490~499.
  • 10Karger D R. Using random sampling to find maximum flows in uncapacitated undirected graphs[A]. Proceedings of 29th Annual ACM Symposium on Theory of Computing[C]. New York: ACM Press, 1997:240~249.

共引文献16

同被引文献7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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