期刊文献+

多目标随机运输路径选择的频域优化模型 被引量:1

Frequency-domain Optimization Model of Multi-objective Stochastic Transportation Path Choice
下载PDF
导出
摘要 根据运输系统的随机特性,讨论时间、损耗和流量等优化目标之间的函数关系,采用概率论方法提出一种用于搜索时变、随机运输网络中多目标路径优化的频域生成图模型(FSG),设计相应的优化算法。FSG通过时频域间概率函数的相互转化,可定量分析O-D对之间多目标路径选择概率的动态变化过程,处理连续概率分布和离散经验分布。结合Matlab给出的算例验证了该算法的可行性和有效性。 Based on stochastic property of the transportation system, the function relation between stochastic travel time, the loss, and the flow are studied. A Frequency-domain Spanning Graph(FSG) model for searching multi-objective optimal path of the time-dependent stochastic transportation network is presented, and the corresponding algorithm is designed to deal with the model, Through the mutual transformation of probability function between time-domain and frequency-domain, O-D multi-objective probability change is capable of quantitative analysis. Continuous probability distribution and discrete probability distribution can be dealt with in the model. Experiment with Matlab proves the feasibility and effectiveness of the algorithm.
出处 《计算机工程》 CAS CSCD 北大核心 2010年第5期199-201,204,共4页 Computer Engineering
关键词 随机运输 频域生成图 多目标 路径优化 stochastic transportation Frequency-domain Spanning Graph(FSG) multi-objective path optimization
  • 相关文献

参考文献6

  • 1Dantzig G B, Ramser J H. The Truck Dispatching Problem[J]. Management Science, 1959, 6(1 ): 80-91. 被引量:1
  • 2Laporte G, Louveaux F, Mercure H. The Vehicle Routing Problem with Stochastic Time[J]. Transportation Science, 1992, 26(3): 161-170. 被引量:1
  • 3Laporte G, Nobert Y. A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem[J]. Operations Research Spektrum, 1983, 5(2): 77-85. 被引量:1
  • 4Laporte G. The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms[J]. European Journal of Operational Research, 1992, 59(3): 345-358. 被引量:1
  • 5郑龙,周经伦,潘正强.基于广义割集算法的军事运输路径优化[J].计算机工程,2007,33(11):4-6. 被引量:6
  • 6Ogata K, System Dynamics[M].4版.韩建友,译.北京:机械工业出版社,2005. 被引量:1

二级参考文献6

  • 1王进发,李励.军事供应链管理[M].北京:国防大学出版社,2004:191,351-354. 被引量:19
  • 2米尔斯切特.数学建模方法与分析[M].北京:机械工业出版社,2005-06. 被引量:1
  • 3Bollobas B.Modern Graph Theory[M].New York:Springer,1998. 被引量:1
  • 4Ford L R,Fulkerson D R.Flows in Networks[M].USA:Princeton University Press,1962. 被引量:1
  • 5Xu Jiefeng,James P K.A Network Flow-based Tabu Search Heuristic for the Vehicle Routing Problem[J].Transportation Science,1996,30(4):379-393. 被引量:1
  • 6Gerla M.A Cut Saturation for Topological Design of Packet Switched Communication Network[C]//Proc.of Nat.Telecommun.Conf.,1974:1 074-1 085. 被引量:1

共引文献5

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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