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

基于禁忌搜索的动态车辆路径问题研究
引用本文:刘霞,齐欢. 基于禁忌搜索的动态车辆路径问题研究[J]. 武汉理工大学学报(交通科学与工程版), 2010, 34(2): 293-296. DOI: 10.3963/j.issn.1006-2823.2010.02.020
作者姓名:刘霞  齐欢
作者单位:1. 华中科技大学控制科学与工程系,武汉,430074;江汉大学物理与信息工程学院,武汉,430056
2. 华中科技大学控制科学与工程系,武汉,430074
基金项目:国家自然科学基金项目(批准号:60904074);;武汉市青年科技晨光计划项目(批准号:200950199019-02)资助
摘    要:在对动态车辆路径问题进行描述的基础上,分析了求解动态车辆路径问题的主要策略.通过将计划周期分片,将动态车辆路径问题转换为一系列的静态子问题,对静态子问题采用禁忌搜索算法进行求解.采用该算法对9个算例进行了测试,与文献中其他算法的计算结果相比较,有3个问题得到了最好解,7个问题得到了最好平均解,表明了算法的有效性.

关 键 词:运输  动态车辆路径问题  禁忌搜索  启发式  优化  

Research of Dynamic Vehicle Routing Problem Based on Tabu Search Algorithm
Liu Xia,Qi Huan. Research of Dynamic Vehicle Routing Problem Based on Tabu Search Algorithm[J]. journal of wuhan university of technology(transportation science&engineering), 2010, 34(2): 293-296. DOI: 10.3963/j.issn.1006-2823.2010.02.020
Authors:Liu Xia  Qi Huan
Affiliation:Department of Control Science & Engineering/a>;HUST/a>;Wuhan 430074/a>;China;School of Physics and Information Engineering/a>;Jianghan University/a>;Wuhan 430056/a>;China
Abstract:In this paper dynamic vehicle routing problem is described and its treatment strategies are analyzed.Planning horizon is divided and dynamic vehicle routing problem are partitioned into a series of static sub-problems,which is solved by tabu search.Instances are tested and results are compared with other algorithms in literature,three best solutions and seven best average solutions have been found among nine instances by tabu search.It demonstrates the effectiveness and robustness of the algorithm in solvin...
Keywords:transportation  dynamic vehicle routing problem  tabu search  heuristics  optimization  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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