期刊文献+

时变车辆路径问题的启发式算法 被引量:14

Heuristic methods for time-dependent vehicle routing problem
下载PDF
导出
摘要 标准的带时间窗车辆路径问题一般假定车辆的行驶速度保持恒定,然而在实际应用中车辆的行驶速度通常是时变的,因此近年来时变车辆路径问题正日益成为该领域的研究热点.本文对时变车辆路径问题的求解策略进行了研究,并设计了一种两阶段启发式算法对问题进行求解,算法的第一阶段提出了一种"最先过期用户优先"的启发式算法求得初始解,第二阶段利用模拟退火算法对初始解进行了改进.实验结果表明该算法可以有效地求解时变车辆路径问题. The general vehicle routing problem with time windows supposes that the travelling speed of vehicles is constant, while in practice the travelling speed is time-dependent, so, in recent years, the time-dependent vehicle routing problem has become one of the research focuses. This paper studies the solving strategy of the time-dependent problem and designs a two-phase heuristic method, in which in the first phase a "first-expired- first-serviced" heuristic is proposed to gain the initial solution, and in the second phase the simulated annealing algorithm is used to improve the initial solution. Experiment results show that the algorithm can solve the time-dependent vehicle routing problem effectively.
出处 《系统工程学报》 CSCD 北大核心 2012年第2期256-262,共7页 Journal of Systems Engineering
基金 国家自然科学基金资助项目(70631003 90718037 71001032)
关键词 车辆路径问题 时变 最先过期用户优先 模拟退火 vehicle routing problem time-dependent first-expired-first-serviced simulated annealing
  • 相关文献

参考文献12

  • 1Hashimoto H,Yagiura M,Ibaraki T. An iterated local search algorithm for the time-dependent vehicle routing problem with time windows[J].Discrete Optimization,2008,(02):434-456.
  • 2Xiang Z,Chu C,Chen H. The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments[J].European Journal of Operational Research,2008,(02):534-551.
  • 3Donati A V,Montemanni R,Casagrande N. Time dependent vehicle routing problem with a multi ant colony system[J].European Journal of Operational Research,2008,(03):1174-1191.
  • 4Kuo Y,Wang C C,Chuang P Y. Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds[J].Computers & Industrial Engineering,2009,(04):1385-1392.
  • 5Kuo Y. Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem[J].Computers & Industrial Engineering,2010,(01):157-165.
  • 6Tagmouti M,Gendreau M,Potvin J Y. Arc routing problems with time-dependent service costs[J].European Journal of Operational Research,2007,(01):30-39.
  • 7Chen H K,Hsueh C F,Chang M S. The real-time time-dependent vehicle routing problem[J].Transportation Research Part E:Logistics and Transportation Review,2006,(05):383-408.
  • 8Ichoua S,Gendreau M,Potvin J Y. Vehicle dispatching with time-dependent travel times[J].European Journal of Operational Research,2003,(02):379-396.
  • 9Tan K C,Lee L H,Zhu Q L. Heuristic methods for vehicle routing problem with time windows[J].Artificial Intelligence in Engineering,2001,(03):281-295.
  • 10Moghaddam R T,Safaei N,Gholipour Y. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length[J].Applied Mathematics and Computation,2006,(02):445-454.

二级参考文献14

  • 1Dror M.Arc Routing:Theory,Solution and Application[M].Netherlands:Kluwer Academic Publishers,2000.
  • 2Euler L.Solutio problematis ad geometrian situs pertinentis[J].Commentarii Academiae Scintarum Petropolitanae,8:128-140.
  • 3Guan M G.Graphic programming using odd and even points[J].Chinese Math.,1:273-277.
  • 4Golden B L,Wong T.Capacitated arc routing problems[J].Networks,1981,11(2):305-315.
  • 5Assad A A,Golden B L.Arc routing methods and applications[A].In:Network Routing,Handbooks in Operations Research and Management Science[M].Amsterdam:North-Holland Press,1995,8:375-483.
  • 6Eiselt H A,Gendreau M,Laporte G.Arc routing problems Ⅰ:The Chinese postman problem[J].Operations Research,1995,43(2):231-242.
  • 7Eiselt H A,Gendreau M,Laporte G.Arc routing problems Ⅱ:The rural postman problem[J].Operations Research,1995,43(3):399-414.
  • 8Hertz A,Laporte G,Nanchen H P.Improvement procedures for the undirected rural postman problem[J].Informs Journal of Computing,1999,11(1):53-62.
  • 9Hertz A,Laporte G,Mittaz M.A tabu search heuristic for the capacitated are routing problem[J].Operations Research,2000,48(1):129-135.
  • 10Hertz A,Mittaz M.A variable neighborhood descent algorithms for the undirected capacitated arc routing problem[J].Transportation Science,2001,35(4):425-434.

共引文献10

同被引文献134

引证文献14

二级引证文献243

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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