期刊文献+

基于遗传算法的时相关动态车辆路径规划模型 被引量:16

Time-Dependent Dynamic Vehicle Routing Based on Genetic Algorithm
下载PDF
导出
摘要 动态车辆路径规划是智能交通和商业物流领域中的一个重要研究方面,其最大的优点是就是综合考虑了各种实时信息,及时优化更新配送车辆的行驶路径,进一步降低物流成本。提出了一种基于遗传算法的时相关动态车辆路径规划模型。该模型将时变的交通信息和动态客户订单考虑在内,可以获得比较好的动态更新效率和优化结果,为此类动态车辆路径规划探索出了一条可行的途径。 Dynamic vehicle routing plays an important role in the intelligent transportation and logistics. All kinds of real-time information is used to re-optimize the vehicle route. A dynamic vehicle routing model based on genetic algorithm, time-dependent travel information and dynamic custom requests, is proposed. The new model can achieve a better re-optimizing result.
出处 《武汉大学学报(信息科学版)》 EI CSCD 北大核心 2008年第8期875-879,共5页 Geomatics and Information Science of Wuhan University
基金 国家863计划资助项目(2007AA12Z309) 香港理工大学研究基金资助项目(G-YE13)
关键词 动态车辆路径规划 智能交通系统 物流 遗传算法 时相关 dynamic vehicle routing plan intelligent transportation system logistics genetic algorithm time-dependent
  • 相关文献

参考文献11

  • 1Gendreau M, Potvin J Y. Dynamic Vehicle Routing and Dispatching[C]. Fleet Management and Logistics, Kluwer, Boston, 1998.
  • 2Yang Jian, Jaillet P, Mahmassani H. Real-time Multivehicle Truckload Pickup and Delivery Problems[J]. Transportation Science, 2004(38): 135-148.
  • 3Fabri A, Reeht P. On Dynamic Pickup and Delivery Vehicle Routing with Several Time Windows and Waiting Times[J]. Transportation Research Part B, 2006(40): 335-350.
  • 4Fleischmann B, Gnutzmann S, Sandvoss E. Dynamic Vehicle Routing Based on Online Traffic In formation[J]. Transportation Science, 2004 (38) 420-433.
  • 5李兵,郑四发,曹剑东,杨扬,耿华,连小珉.求解客户需求动态变化的车辆路径规划方法[J].交通运输工程学报,2007,7(1):106-110. 被引量:29
  • 6Malandraki C,Daskin M S. Time-Dependent Vehicle Routing Problems: Formulations, Properties, and Heuristic Algorithms[J]. Transportation Science, 1992(26) :185-200.
  • 7Picard J C, Queryranne M. The Time-Dependent Traveling Salesman Problem and hs Application to the Tardiness Problem in One-Machine Scheduling [J]. Operations Research, 1978(26): 86-110.
  • 8Fox K R, Gavish B, Graves S C. A n-Constraint Formulation of the ( Time-Dependent ) Traveling Salesman Problem[J]. Operations Research, 1980 (28): 1 018-1 021.
  • 9Lucena A. Time-Dependent Traveling Salesman Problem-the Deliveryman Case[J]. Networks, 1990 (120): 753-763.
  • 10Wiel R J V, Sahinidis N V. Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem [J]. Transportation Science, 1995(29): 167-183.

二级参考文献10

  • 1杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法[J].交通运输工程学报,2005,5(1):102-105. 被引量:23
  • 2胡大伟,胡勇,朱志强.基于空间填充曲线和动态规划解的定位路线问题[J].长安大学学报(自然科学版),2006,26(3):80-83. 被引量:4
  • 3Dantzig G B,Ramser R H.The truck dispatching problem[J].Management Science,1959,6(1):80-91.
  • 4Thangiah S R,Osman I H,Sun T.Hybrid genetic algorithm simulated annealing and tabu search methods for vehicle routing problem with time windows[R].Slipery Rock:Slippery Rock University,1994.
  • 5Osman I H.Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem[J].Annals of Operations Research,1993,41(1):421-451.
  • 6Clarke G,Wright J W.Scheduling of vehicles from a central depot to a number of delivery points[J].Operations Research,1964,12(4):568-581.
  • 7Psaraftis H N.Vehicle Routing:Methods and Studies[M].Amstersam:North-Holland Press,1988.
  • 8Ghiani G,Guerriero F,Laporte G,et al.Real-time vehicle routing:solution concepts,algorithms and parallel computing strategies[J].European Journal of Operational Research,2003,151(1):1-11.
  • 9宋厚冰,蔡远利.带时间窗的车辆路径混合遗传算法[J].交通运输工程学报,2003,3(4):112-115. 被引量:8
  • 10张波,叶家玮,胡郁葱.模拟退火算法在路径优化问题中的应用[J].中国公路学报,2004,17(1):79-81. 被引量:48

共引文献28

同被引文献145

引证文献16

二级引证文献96

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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