期刊文献+

Vehicle routing problem with time-varying speed

Vehicle routing problem with time-varying speed
下载PDF
导出
摘要 Vehicle routing problem with time-varying speed ( VRPTS) is a generalization of vehicle routing problem in which the travel speed between two locations depends on the passing areas and the time of a day. This paper proposes a simple model for estimating time-varying travel speeds in VRPTS that relieves much burden to the data-related problems. The study further presents three heuristics ( saving technique,proximity priority searching technique,and insertion technique) for VRPTS,developed by extending and modifying the existing heuristics for conventional VRP. The results of computational experiments demonstrate that the proposed estimation model performs well and the saving technique is the best among the three heuristics. Vehicle routing problem with time-varying speed (VRPTS) is a generalization of vehicle routing problem in which the travel speed between two locations depends on the passing areas and the time of a day. This paper proposes a simple model for estimating time-varying travel speeds in VRPTS that relieves much burden to the data-related problems. The study further presents three heuristics ( saving technique, proximity priority searching technique, and insertion technique) for VRPTS, developed by extending and modifying the existing heuristics for conventional VRP. The results of computational experiments demonstrate that the proposed estimation model performs well and the saving technique is the best among the three heuristics.
作者 刘云忠
机构地区 Statistic School
出处 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2010年第4期584-587,共4页 哈尔滨工业大学学报(英文版)
关键词 vehicle routing problem time-varying speed saving technique proximity priority searching technique insertion technique vehicle routing problem time-varying speed saving technique proximity priority searching technique insertion technique
  • 相关文献

参考文献7

  • 1Hill A V, Benton W C. Modeling intra-city time-dependent travel speeds for vehicle scheduling problems. Journal of Operational Research Society, 1992,43 (4) :343 - 351.
  • 2Malandraki, Daskin M S. Time dependent vehicle routing problems: formulation, properties and heuristic algorithms. Transportation Science, 1992,26 ( 3 ) : 185 - 200.
  • 3Ahn B, Shin J. Vehicle-routing with time windows and time-varying congestion. Journal of Operational Research Society, 1991,42(5) :393 -400.
  • 4Huff D L. Defining and estimating a trading area. Journal of Marketing, 1994,28:34 - 38.
  • 5Clarke G, Wright J. Scheduling of vehicles from a central depot to a number of delivery point. Operations Research, 1964, 12:568-581.
  • 6Williams B W. Vehicle scheduling: proximity searching. Journal of Operational Research Society, 1982, 33:961 - 966.
  • 7Mole R H, Jameson S R. Sequential route building algorithm employing a generalized savings criterion. Operations Research Quarterly, 1976, 27:503 - 511.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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