期刊文献+

基于随机需求的多频次道路货运调度模型及算法 被引量:2

Model and algorithm for multi-frequency goods scheduling problem
下载PDF
导出
摘要 以道路货物运输为研究对象,采用多频次调度方法对随机需求的道路货运调度问题进行研究,给出了基于随机需求的多频次调度模型及求解模型的微粒群算法,同时通过算例验证了该模型的可行性。 Considering the goods scheduling as the research object, the multi - frequency scheduling was used to study the goods scheduling problem when demand at nodes was uncertain, and then the model and PSO algorithm were given. At the same time, an example was given to prove the usage and the value of model.
作者 程赐胜 徐芳
出处 《铁道科学与工程学报》 CAS CSCD 北大核心 2008年第1期91-96,共6页 Journal of Railway Science and Engineering
基金 湖南省教育厅科研基金资助项目(04C068)
关键词 道路货物调度 随机需求 多频次 微粒群算法 goods scheduling problem uncertain demand multi - frequency PSO
  • 相关文献

参考文献7

二级参考文献33

  • 1孙守宇,郑君里.Hopfield网络求解TSP的一种改进算法和理论证明[J].电子学报,1995,23(1):73-78. 被引量:45
  • 2[1]Dantzig G, Ramser J. The truck dispatching problem[J]. Management Sci,1959,6:80-91.
  • 3[2]Fischetti Matteo. A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs[J]. Operations Research,1994,42(5):846-849.
  • 4[3]Vigo Daniele. A heuristic for the asymmetric capacitated vehicle routing problem[J]. European Journal of Operational Research,1996,89:108-126.
  • 5[4]Gendreau Michel. A tabu search heuristic for the vehicle routing problem[J]. Management Sci,1994,40(10):1276-1290.
  • 6[5]Attahiru Sule Alfa. A 3-opt based simulated annealing algorithm for vehicle routing porblems[J]. Computers Ind Engng,1991,21(1-4):635-639.
  • 7[6]Marshall L Fisher. Optimal solution of vehicle routing problems using minimum K-trees[J]. Operations Research,1994,42(4):626-642.
  • 8[7]Glover Fred. Tabu search-partⅠ[J]. ORSA Journal on Computing,1989,1(3):190-205.
  • 9[8]Glover Fred. Tabu Search-part Ⅱ[J]. ORSA Journal on Computing,1990,2(1):4-32.
  • 10[9]Christofides N, Eilon S. An algorithm for the vehicle dispatching problems[J]. Operations Research,1969,20:309-323.

共引文献190

同被引文献21

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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