期刊文献+

大规模邻域搜索算法求解时变车辆调度问题 被引量:27

Very large scale neighborhood search algorithm for solving time dependent vehicle routing problem
下载PDF
导出
摘要 对时变网络车辆调度问题提出一种满足先入先出准则的时变处理方法,并建立相应的数学模型,提出一种基于大规模邻域搜索技术的智能优化算法进行求解,算法顶层采用动态规划算法搜索环状交换邻域以得到每辆车的最佳服务顾客集合;底层设计动态搜索算法用以安排每辆车的最佳服务路线.在此基础上提出顶层加入虚拟顾客和底层嵌入insert两类改进策略.通过实验仿真比较,验证了所提算法的有效性. Time dependent vehicle routing problem was formulated by dealing with time periods crossing with first-in first-out property, and a novel intelligent optimization algorithm based on very large scale neighborhood search technology was developed to solve it. In the upper level dynamic programming algorithm was adopted to search cycle transfer neighborhood so as to obtain the optimal customer set for each vehicle, while in the lower level dynasearch heuristics was developed to rank the customers in each vehicle. Based on this, two improvements were given: adding dummy customer in the upper level and embedding insert in the lower level. The efficiency of the method are testified with the results of extensive computational tests.
出处 《管理科学学报》 CSSCI 北大核心 2012年第1期22-32,共11页 Journal of Management Sciences in China
基金 国家自然科学基金资助项目(71001005) 中国博士后科学基金资助项目(20090460196) 中国博士后特别资助项目(201003043) 中央高校基本科研业务费专项资金资助项目(SWJTU11CX087) 四川省教育厅社会科学研究项目(09SB066)
关键词 时变网络车辆调度问题 先入先出 大规模邻域搜索 动态搜索算法 time dependent vehicle routing problem first-in first-out very large scale neighborhood search dynasearch algorithm
  • 相关文献

参考文献16

  • 1Malandraki C, Daskin M S. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms [ J ]. Transportation Science, 1992, 26 (3) : 185 - 200.
  • 2Malandraki 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 ( 1 ) : 45 - 55.
  • 3I Ahn B H, Shin J Y. Vehicle-routing with time windows and time-varying congestion[ J ]. Journal of the Operational Research Society, 1991,42(5) : 393 -400.
  • 4Hill A V, Benton W C. Modeling intra-city time-dependent travel speeds for vehicle scheduling problems[ J]. Journal of the Operational Research Society, 1992, 43 (4) : 343 - 351.
  • 5Horn M E T. Efficient modeling of travel in networks with time-varying link speeds [ J ]. Networks, 2000, 36 (2) : 80 - 90.
  • 6Ichoua S, Gendreau M, Potvin J Y. Vehicle dispatching with time-dependent travel times [ J ]. European Journal of Opera- tional Research, 2003, 144 (2) : 379 - 396.
  • 7Fleischmann B, Gietz M, Gnutzmann S. Time-varying travel times in vehicle routing[ J]. Transportation Science, 2004, 38 (2) : 160 - 173.
  • 8I Haghani A, Jung S. A dynamic vehicle routing problem with time-dependent travel times [ J ]. Computer & Operations Re- search, 2005, 32 ( 11 ) : 2959 - 2986.
  • 9Donati A V, Montemanni R, Casagrande N, et al. Time dependent vehicle routing problem with a multi ant colony system [J]. European Journal of Operational Research, 2008, 185(3) : 1174 -1191.
  • 10李妍峰,李军,赵达.用动态搜索算法求解时间依赖型旅行商问题[J].西南交通大学学报,2008,43(2):187-193. 被引量:6

二级参考文献60

共引文献32

同被引文献220

引证文献27

二级引证文献202

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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