期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

时变网络中物流车辆调度问题的研究 被引量：2

On Vehicle Routing Problem in Time Dependent Network
下载PDF
导出
摘要 研究了时变网络中的车辆调度问题,设计了该问题的并行遗传算法并进行求解.仿真结果表明,该并行遗传算法优于BC-saving启发式算法. Vehicle routing problem in time dependent network was researched. The parallel genetic algorithm for this problem was designed and solved. The simulation result showed that the parallel genetic algorithm was better than BC-saving heuristic algorithm.
作者 郑成武 刘冬梅
机构地区 天津师范大学管理学院
出处 《天津师范大学学报（自然科学版）》 CAS 2007年第3期76-80,共5页 Journal of Tianjin Normal University：Natural Science Edition
关键词 车辆调度 时变 启发式算法 并行遗传算法 vehicle routing time dependent heuristic algorithm parallel genetic algorithm
分类号 U116.1 [交通运输工程]
  • 相关文献

参考文献8

  • 1Malandraki C, Daskin M S. Time dependent vehicle routing problem: Formulations, properties and heuristic algorithms[J]. Transportation Science,1992,26(3):185-200.
  • 2Yang B P. A solution of the bicriteria vehicle scheduling problems with time and area dependent travel speeds[J]. Computer Industrial Engineering, 2000,38(6): 173 - 187.
  • 3Hill A V, Benton W C. Modeling intra-city time-dependent travel speeds for vehicle scheduling problems[J]. Journal of the Operations Research Society, 1992,43 (4) : 343 - 351.
  • 4Malandraki C, Dial R B. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem[J]. European Journal of Operational Research,1996, 90(8):44-55.
  • 5Cooke K L, Halsey E. The shortest route through a network with time-dependent internodal transit times[J]. Journal of Mathematical Analysis and Applications, 1996,14(8):492-498.
  • 6Chabini I. A new algorithm for shortest paths in discrete dynamic networks[C]. Proceeding of the 8th IFAC symposium on Transportation Systems, Chania, Greece,1992: 551-556.
  • 7Soumia I, Michel G, Jean Y P. Vehicle dispatching with time dependent travel time [J]. European Journal of Operational Research, 2003,144(6) :379-396.
  • 8Manrice Circ. Discrete particle swarm optimization illustrated by traveling salesmam problem[EB/OL]. http://www. cba. neu. edu/msotomon/problems, 2000.

同被引文献23

  • 1谢红薇,张晓波,袁占花,余雪丽.基于遗传算法求解应急决策系统中的最优路径[J].计算机应用,2005,25(4):737-738. 被引量：15
  • 2王正国,王红卫,刘会新.双目标时变速度车辆路径问题的模型及算法[J].华中科技大学学报（自然科学版）,2005,33(12):88-91. 被引量：4
  • 3MODESTI P, SCIOMACHEN A. A utility measure for finding multi- objective shortest paths in urban multimodal transportation networks [J]. European Journal of Operational Research, 1998, 111(2): 495 - 508.
  • 4CHEN Y L TANG K. Minimum time paths in a network with mixed time constraints [ J]. Computer Operational Research, 1998, 25 (10) : 793 -805.
  • 5SHIA HANMAO, SPENCERB T H. Time-work tradeoffs of the ain- gle-source shortest paths problem [ J]. Journal of Algorithms, 2000, 35(2) : 189 -201.
  • 6ANEJA Y P, NAIR K P K. The constraned shortest path probIem [J]. Naval Research Lo~sfics Quarterly, 1978, 25(11): 549-555.
  • 7PRETOLANI D. A diteocted hypergraph model for random time-de- pendent shortest path [ J]. European Journal of Operational Re- search, 2000, 123(8): 315-342.
  • 8OPASANON S, MILLER-HOOKS E. Muhicriteria adaptive paths in stochastic, tlme-varying networks [ J]. European Journal of Opera- tional Research, 2006, 173(5): 72-91.
  • 9MILLER-HOOKS E, MAHMASSANI H S. Least possible time paths in stochastic, time-varying networks [ J]. Computers and Operations Research, 1998, 25(12): 1107-1125.
  • 10魏航,李军,魏洁.时变条件下多式联运有害物品的路径选择[J].系统管理学报,2007,16(6):644-652. 被引量：12

引证文献2

二级引证文献11

天津师范大学学报（自然科学版）
2007年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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