首页 | 本学科首页   官方微博 | 高级检索  
     检索      

动态车辆路径问题的算法研究
引用本文:钱艳婷,王鹏涛,魏国利.动态车辆路径问题的算法研究[J].天津理工大学学报,2010,26(6).
作者姓名:钱艳婷  王鹏涛  魏国利
作者单位:天津理工大学计算机与通信工程学院;
基金项目:天津市自然科学基金,天津市教委自然科学基金
摘    要:借鉴动态问题中的时间点、时间段等概念,建立了动态车辆路径问题模型,将动态VRP转化为在若干连续的时间段内的相对确定性的静态VRP,为动态VRP的研究提供了一种新的方法.并设计了基于节约法和禁忌搜索的混合算法,从而提高了对动态车辆路径问题求解的效率.

关 键 词:动态车辆路径问题  节约法  禁忌搜索算法

Research the algorithm on dynamic vehicle routing problem
QIAN Yan-ting,WANG Peng-tao,WEI Guo-li.Research the algorithm on dynamic vehicle routing problem[J].Journal of Tianjin University of Technology,2010,26(6).
Authors:QIAN Yan-ting  WANG Peng-tao  WEI Guo-li
Institution:QIAN Yan-ting,WANG Peng-tao,WEI Guo-li(School of Computer and Communications Engineering,Tianjin University of Technology,Tianjin 300384,China)
Abstract:Introducing the concepts of the time point and the time section,a dynamic modle of vehicle routing problem(VRP) was proposed,which transformed dynamic vehicle routing problem into a series of static problem,a new method for dynamic vehicle routing problem was provided.A hybrid algorithm based on a economical method and tabu search algorithms was designed,thereby improving the solving efficiency for dynamic vehicle routing problem.
Keywords:dynamic vehicle routing problem  economical method  tabu search algorithms  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号