期刊文献+

双权值最短路径问题的一种解决算法

On the Shartest Path in Direction Diagram by Dud Weight
下载PDF
导出
摘要 物流配送方案中,费用、时间是客户最关心的两个问题。物流企业需要基于这两个客户所关心的问题,提出一套低成本的物流配送方案。本文探求使用费用、时间双权值有向图最短路径问题,解决这种配送方案,并进行算法的时间复杂度分析。 The two key points the customer care are charge & time. It is the most important thing for logistics company to provide his customer a low-price solution. In order to solve the logistics problem,we try using shortest path in direction diagram by dual weight (charge & time). And then do time complexity for the algorithm.
作者 尚靖
出处 《天津市财贸管理干部学院学报》 2008年第2期21-22,共2页 Journal of Tianjin Institute of Financial and Commercial Management
关键词 双权值 最短路径 迪杰斯特拉算法 dual weight path shortest dijkstra algorithm
  • 相关文献

参考文献4

二级参考文献16

  • 1杨莎莎,赵舜.第三方物流:适合我国国情的电子商务物流配送模式[J].商场现代化,2005(9):5-6. 被引量:3
  • 2黄浩.我国农村信息化及实现途径的探索[J].科技情报开发与经济,2006,16(4):72-74. 被引量:24
  • 3Andrew S.Tanenbaum.Computer Networks,3rd ED.,Prentice Hall,1996. 被引量:1
  • 4Baron R J,Shapiro L G.Data Structure and their Implementation.Van Norstrand Reinhold Company,1980. 被引量:1
  • 5Miller Harbey J.Measuring spacing-time accessibility benefits within transportation networks.Geographical Analysis,1999. 被引量:1
  • 6Zhan F B. Three Fastest Shortest Path Algorithms on Real Road Networks. Journal of Geographic Information and Decision Analysis, 1997, 1 被引量:1
  • 7Zhan F B, Noon C E. Shortest path algorithms: An evaluation using real road networks[J]. Transportation Science,1998,32(1):65- 73. 被引量:1
  • 8Michelle Hribar, Valerie Taylor, David Boyce. Choosing a shortest path algorithm [R]. Chicago : Technical Report CSE-95-004, Computer Science Engineering,EECS Department, Northwestern Univ. , 1995. 被引量:1
  • 9康立山.非数值并行算法(第一册):模拟退火算法[M].北京:科学出版社,2003. 被引量:1
  • 10Hribar M R, Taylor V E . Termination detection for parallel shortest path algorithms [R]. Chicago:Technical Report CSE- 97- 004, Computer Science-Engineering, EECS Department, Northwestern Univ. , 1997. 被引量:1

共引文献78

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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